随笔分类 - 网络流
摘要：NetworkTime Limit:1000MSMemory Limit:10000KTotal Submissions:7510Accepted:3525DescriptionA Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from 1 to N . No two places have the same number. The lines are bidirectional
阅读全文
摘要：Redundant PathsTime Limit:1000MSMemory Limit:65536KTotal Submissions:6982Accepted:3042DescriptionIn order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbered 1..F) to another field, Bessie and the rest of the herd are forced to cross near the Tree of Rotten Apples. Th
阅读全文
摘要：ElectricityTime Limit:5000MSMemory Limit:65536KTotal Submissions:2515Accepted:839DescriptionBlackouts and Dark Nights (also known as ACM++) is a company that provides electricity. The company owns several power plants, each of them supplying a small area that surrounds it. This organization brings a
阅读全文
摘要：Fiber NetworkTime Limit:1000MSMemory Limit:65536KTotal Submissions:2660Accepted:1221DescriptionSeveral startup companies have decided to build a better Internet, called the "FiberNet". They have already installed many nodes that act as routers all around the world. Unfortunately, they star
阅读全文
摘要：Play on WordsTime Limit:1000MSMemory Limit:10000KTotal Submissions:7970Accepted:2802DescriptionSome of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors, the puzzle is very important
阅读全文
摘要：Optimal MilkingTime Limit:2000MSMemory Limit:30000KTotal Submissions:9498Accepted:3433Case Time Limit:1000MSDescriptionFJ has moved his K (1 <= K <= 30) milking machines out into the cow pastures among the C (1 <= C <= 200) cows. A set of paths of various lengths runs among the cows and
阅读全文
摘要：Gold TransportationTime Limit:2000MSMemory Limit:65536KTotal Submissions:2407Accepted:858DescriptionRecently, a number of gold mines have been discovered in Zorroming State. To protect this treasure, we must transport this gold to the storehouses as quickly as possible. Suppose that the Zorroming St
阅读全文
摘要：T-Shirt GumboTime Limit:1000MSMemory Limit:65536KTotal Submissions:2261Accepted:1056DescriptionBoudreaux and Thibodeaux are student volunteers for this year's ACM South Central Region's programming contest. One of their duties is to distribute the contest T-shirts to arriving teams. The T-sh
阅读全文
摘要：Secret Milking MachineTime Limit:1000MSMemory Limit:65536KTotal Submissions:7681Accepted:2340DescriptionFarmer John is constructing a new milking machine and wishes to keep it secret as long as possible. He has hidden in it deep within his farm and needs to be able to get to the machine without bein
阅读全文
摘要：Ranking the CowsTime Limit:2000MSMemory Limit:65536KTotal Submissions:2248Accepted:1045DescriptionEach of Farmer John'sNcows (1 ≤N≤ 1,000) produces milk at a different positive rate, and FJ would like to order his cows according to these rates from the fastest milk producer to the slowest.FJ has
阅读全文
摘要：Island TransportTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2822Accepted Submission(s): 922Problem 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.
阅读全文
摘要：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.
阅读全文
摘要：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..
阅读全文
摘要：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
阅读全文
摘要：KingTime Limit:1000MSMemory Limit:10000KTotal Submissions:8492Accepted:3203DescriptionOnce, in one kingdom, there was a queen and that queen was expecting a baby. The queen prayed: ``If my child was a son and if only he was a sound king.'' After nine months her child was born, and indeed, sh
阅读全文
摘要：Cashier EmploymentTime Limit:1000MSMemory Limit:10000KTotal Submissions:6401Accepted:2312DescriptionA supermarket in Tehran is open 24 hours a day every day and needs a number of cashiers to fit its need. The supermarket manager has hired you to help him, solve his problem. The problem is that the s
阅读全文
摘要：Network of SchoolsTime Limit:1000MSMemory Limit:10000KTotal Submissions:8632Accepted:3408DescriptionA number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains a list of schools to which it distributes software (the “receiving sc
阅读全文
摘要：IntervalsTime Limit:2000MSMemory Limit:65536KTotal Submissions:18595Accepted:6976DescriptionYou are given n closed, integer intervals [ai, bi] and n integers c1, ..., cn.Write a program that:reads the number of intervals, their end points and integers c1, ..., cn from the standard input,computes the
阅读全文
摘要：PIGSTime Limit:1000MSMemory Limit:10000KTotal Submissions:13440Accepted:5932DescriptionMirko works on a pig farm that consists of M locked pig-houses and Mirko can't unlock any pighouse because he doesn't have the keys. Customers come to the farm one after another. Each of them has keys to s
阅读全文
摘要：A Plug for UNIXTime Limit:1000MSMemory Limit:65536KTotal Submissions:12318Accepted:4079DescriptionYou 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 the free flow of information and idea
阅读全文
浙公网安备 33010602011771号