Jack Ge for ACM

摘要： Desert KingTime Limit:3000MSMemory Limit:65536KTotal Submissions:17772Accepted:5011DescriptionDavid the Great has just become the king of a desert country. To win the respect of his people, he decided to build channels all over his country to bring water to every village. Villages which are connecte 阅读全文

摘要： Picnic PlanningTime Limit:5000MSMemory Limit:10000KTotal Submissions:8340Accepted:2946DescriptionThe Contortion Brothers are a famous set of circus clowns, known worldwide for their incredible ability to cram an unlimited number of themselves into even the smallest vehicle. During the off-season, th 阅读全文

摘要： Full Tank?Time Limit:1000MSMemory Limit:65536KTotal Submissions:5619Accepted:1836DescriptionAfter going through the receipts from your car trip through Europe this summer, you realised that the gas prices varied between the cities you visited. Maybe you could have saved some money if you were a bit 阅读全文

摘要： Sightseeing CowsTime Limit:1000MSMemory Limit:65536KTotal Submissions:6684Accepted:2196DescriptionFarmer John has decided to reward his cows for their hard work by taking them on a tour of the big city! The cows must decide how best to spend their free time.Fortunately, they have a detailed city map 阅读全文

摘要： Cow RelaysTime Limit:1000MSMemory Limit:65536KTotal Submissions:4395Accepted:1748DescriptionFor their physical fitness program,N(2 ≤N≤ 1,000,000) cows have decided to run a relay race using theT(2 ≤T≤ 100) cow trails throughout the pasture.Each trail connects two different intersections (1 ≤I1i≤ 1,0 阅读全文

摘要： Closest Common AncestorsTime Limit:2000MSMemory Limit:10000KTotal Submissions:12745Accepted:4162DescriptionWrite a program that takes as input a rooted tree and a list of pairs of vertices. For each pair (u,v) the program determines the closest common ancestor of u and v in the tree. The closest com 阅读全文

摘要： Nearest Common AncestorsTime Limit:1000MSMemory Limit:10000KTotal Submissions:13981Accepted:7454DescriptionA rooted tree is a well-known data structure in computer science and engineering. An example is shown below:In the figure, each node is labeled with an integer from {1, 2,...,16}. Node 8 is the 阅读全文

摘要： Pushing BoxesTime Limit:2000MSMemory Limit:131072KTotal Submissions:3943Accepted:1394Special JudgeDescriptionImagine you are standing inside a two-dimensional maze composed of square cells which may or may not be filled with rock. You can move north, south, east or west one cell at a step. These mov 阅读全文

摘要： As long as Binbin loves SangsangTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1601Accepted Submission(s): 429Problem DescriptionBinbin misses Sangsang so much. He wants to meet with Sangsang as soon as possible.Now Binbin downloads a map from ELG 阅读全文

摘要： IntervalsTime Limit:2000MSMemory Limit:65536KTotal Submissions:18740Accepted:7042DescriptionYou 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 阅读全文