随笔分类 - 图论
摘要:Problem B: Double KingsTime Limit:1 SecMemory Limit:128 MBSubmit:142Solved:65[Submit][Status][Web Board]DescriptionOur country is tree-like structure, that is to say that N cities is connected by exactly N - 1 roads.The old king has two little sons. To make everything fairly, he dicided to divide th
阅读全文
摘要:Cat vs. DogTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 164 Accepted Submission(s): 63Problem Description The latest reality show has hit the TV: ``Cat vs. Dog''. In this show, a bunch of cats and dogs compete for the very prestigious B
阅读全文
摘要:50 years, 50 colorsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 39 Accepted Submission(s): 33Problem Description On Octorber 21st, HDU 50-year-celebration, 50-color balloons floating around the campus, it's so nice, isn't it? To celebra
阅读全文
摘要:Strategic GameTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 58 Accepted Submission(s): 40Problem Description Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is v.
阅读全文
摘要:Air RaidTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 72 Accepted Submission(s): 61Problem Description Consider 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.
阅读全文
摘要:Bus PassTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 82 Accepted Submission(s): 33Problem Description You travel a lot by bus and the costs of all the seperate tickets are starting to add up. Therefore you want to see if it might be advantage.
阅读全文
摘要:Transit searchTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 39 Accepted Submission(s): 18Problem DescriptionHenry decides to develop a web site, which will provide the service of transit search. But he can only get the transit data of Guangzhou.
阅读全文
摘要:In ActionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 169 Accepted Submission(s): 78Problem Description Since 1945, when the first nuclear bomb was exploded by the Manhattan Project team in the US, the number of nuclear weapons have soared ac..
阅读全文
摘要:TruckingTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 55 Accepted Submission(s): 19Problem Description A certain local trucking company would like to transport some goods on a cargo truck from one place to another. It is desirable to transpor.
阅读全文
摘要:PseudoforestTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 157 Accepted Submission(s): 69Problem DescriptionIn graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. The maximal pseudofores.
阅读全文

浙公网安备 33010602011771号