Jelly_acm的博客

Fire NetProblem DescriptionSuppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wal

奔小康赚大钱Problem Description传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革：重新分配房子。这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住（如果有老百姓没房子住的话，容易引起不安定因素），每家必须分配到一间房子且只能得到一间房子。另一方面,村长和另外的村领导希望得到最大的效益,

TourTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 3378    Accepted Submission(s): 1627Problem DescriptionIn the kingdom of Hen

1099. Work SchedulingTime limit: 0.5 secondMemory limit: 64 MBThere is certain amount of night guards that are available to protect the local junkyard from possible junk robberies. These

Boke and Tsukkomi                                                                              Time Limit: 3000/3000 MS (Java/Others)    Memory Limit: 102400/102400 K (Java/Others)             

Gopher IITime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9005 Accepted: 3724DescriptionThe gopher family, having averted the canine threat, must face a

Sorting SlidesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4442 Accepted: 1757DescriptionProfessor Clumsey is going to give an important talk this

Girls and BoysTime Limit: 5000MS Memory Limit: 10000KTotal Submissions: 12747 Accepted: 5678DescriptionIn the second year of the university somebody started a

KindergartenTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6882 Accepted: 3402DescriptionIn a kindergarten, there are a lot of kids. All girls of the

Cyclic Tour                                                                               Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/65535 K (Java/Others)                     

The Perfect StallTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25739 Accepted: 11444DescriptionFarmer John completed his new barn just last week, co

Optimal MilkingTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 17811 Accepted: 6368Case Time Limit: 1000MSDescriptionFJ has moved his K (1 <= K

Jamie's Contact GroupsTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 7721 Accepted: 2599DescriptionJamie is a very popular girl and has quite a lot of

Steady Cow AssignmentTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6817 Accepted: 2349DescriptionFarmer John's N (1 FJ would like to rearrange the

The Accomodation of StudentsTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6424    Accepted Submission(s): 2880Problem Description

CoursesProblem DescriptionConsider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a com

棋盘游戏Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4808    Accepted Submission(s): 2848Problem Description小希和Gardon在玩一个游戏：对一个N*

SwapTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3371    Accepted Submission(s): 1235Special JudgeProblem DescriptionGiven an

Oil SkimmingProblem DescriptionThanks to a certain "green" resources company, there is a new profitable industry of oil skimming. There are large slicks of crude oil floating in the Gulf of

Rain on your ParadeProblem DescriptionYou’re giving a party in the garden of your villa by the sea. The party is a huge success, and everyone is here. It’s a warm, sunny evening, and a sooth

Antenna PlacementTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9586 Accepted: 4736DescriptionThe Global Aerial Research Centre has been allotted the t

Strategic GameProblem DescriptionBob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has th

Air RaidProblem DescriptionConsider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and w

Treasure ExplorationTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 8550 Accepted: 3495DescriptionHave you ever read any book about treasure exploration

Cat VS DogProblem DescriptionThe zoo have N cats and M dogs, today there are P children visiting the zoo, each child has a like-animal and a dislike-animal, if the child's like-animal is a

Going HomeDescriptionOn a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adjacent point. For each little man, you need to pay a $1 travel fee for every