Jelly_acm的博客

Island TransportProblem Description　　In the vast waters far far away, there are many islands. People are living on the islands, and all the transport among the islands relies on the ships.

DiningDescriptionCows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others.Farmer John has cooked fabulous meals for his cows, but he forgot to check his menu against their preferences. Although

ParatroopersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8724 Accepted: 2641DescriptionIt is year 2500 A.D. and there is a terrible war between the

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

"Shortest" pair of pathsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1385 Accepted: 609DescriptionA chemical company has an unusual shortest path p

Farm TourTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17203 Accepted: 6640DescriptionWhen FJ's friends visit him on the farm, he likes to show them

The Windy'sTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 5412 Accepted: 2268DescriptionThe Windy's is a world famous toy factory that owns M top-cla

IntervalsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 8343 Accepted: 3562DescriptionYou are given N weighted open intervals. The ith interval cover

Kaka's Matrix TravelsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9902 Accepted: 4020DescriptionOn an N × N chessboard with a non-negative number i

Minimum CutTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 9715 Accepted: 4085Case Time Limit: 5000MSDescriptionGiven an undirected graph, in whi

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

A Plug for UNIXDescriptionYou are in charge of setting up the press room for the inaugural meeting of the United Nations Internet eXecutive (UNIX), which has an international mandate to make

Flow ProblemProblem DescriptionNetwork flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph.

Secret Milking MachineTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12324 Accepted: 3589DescriptionFarmer John is constructing a new milking machine

Ikki's Story I - Road ReconstructionTime Limit: 2000MS Memory Limit: 131072KTotal Submissions: 7971 Accepted: 2294DescriptionIkki is the king of a small country

PIGSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21349 Accepted: 9755DescriptionMirko works on a pig farm that consists of M locked pig-houses and Mi

Ombrophobic BovinesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19359 Accepted: 4186DescriptionFJ's cows really hate getting wet so much that the m

Sightseeing tourTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9709 Accepted: 4089DescriptionThe city executive board in Lund wants to co

Destroying The GraphTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8446 Accepted: 2725 Special JudgeDescriptionAlice and Bob play the following g

Dual Core CPUTime Limit: 15000MS Memory Limit: 131072KTotal Submissions: 24740 Accepted: 10705Case Time Limit: 5000MSDescriptionAs more and more computers a

Drainage DitchesProblem DescriptionEvery time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thus, Farmer John has built

度度熊的交易计划Time Limit: 12000/6000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 374    Accepted Submission(s): 122Problem Description度度熊参与了喵哈哈村的商业大会，但是