摘要：
ControlTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 984Accepted Submission(s): 445Problem Description You, the head of Department of Security, recently received a top-secret information that a group of terrorists is planning to transport some W. 阅读全文
摘要：
PotsTime Limit:1000MSMemory Limit:65536KTotal Submissions:7783Accepted:3261Special JudgeDescriptionYou are given two pots, having the volume ofAandBliters respectively. The following operations can be performed:FILL(i) fill the poti(1 ≤i≤ 2) from the tap;DROP(i) empty the potito the drain;POUR(i,j) 阅读全文
摘要：
FoodTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1491Accepted Submission(s): 534Problem Description You, a part-time dining service worker in your college’s dining hall, are now confused with a new problem: serve as many people as possible. Th.. 阅读全文
摘要：
Repairing CompanyTime Limit:1000MSMemory Limit:131072KTotal Submissions:5696Accepted:1530DescriptionLily runs a repairing company that services theQblocks in the city. One day the company receivesMrepair tasks, theith of which occurs in blockpi, has a deadlinetion any repairman’s arrival, which is a 阅读全文
摘要：
Part AcquisitionTime Limit:1000MSMemory Limit:65536KTotal Submissions:2909Accepted:1262Special JudgeDescriptionThe cows have been sent on a mission through space to acquire a new milking machine for their barn. They are flying through a cluster of stars containing N (1 <= N <= 50,000) planets, 阅读全文
摘要：
Power NetworkTime Limit:2000MSMemory Limit:32768KTotal Submissions:19870Accepted:10452DescriptionA power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produce an amount 0 b 阅读全文