2013 年 4月 26 日随笔档案 - cssystem

2013年4月26日

摘要： TruckingTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 72 Accepted Submission(s): 28 Problem Description A certain local trucking company would like to transport some goods on a cargo truck from one place to another. It is desi... 阅读全文

posted @ 2013-04-26 22:51 cssystem 阅读(176) 评论(0) 推荐(0) 编辑

6.2.8 In Action

摘要： In ActionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 213 Accepted Submission(s): 94 Problem Description Since 1945, when the first nuclear bomb was exploded by the Manhattan Project team in the US, the number of nuclear we... 阅读全文

posted @ 2013-04-26 22:48 cssystem 阅读(132) 评论(0) 推荐(0) 编辑

6.2.4 Arbitrage

摘要： ArbitrageTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 70 Accepted Submission(s): 37 Problem Description Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one uni... 阅读全文

posted @ 2013-04-26 22:46 cssystem 阅读(155) 评论(0) 推荐(0) 编辑

6.2.3 畅通工程续

摘要：畅通工程续Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 42 Accepted Submission(s): 25 Problem Description 某省自从实行了很多年的畅通工程计划后，终于修建了很多路。不过路多了也不好，每次要从一个城镇到另一个城镇时，都有许多种道路方案可以选择，而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。现在，已知起点和终点，请你计算出要从起点到终点，最短需要行走... 阅读全文

posted @ 2013-04-26 22:44 cssystem 阅读(144) 评论(0) 推荐(0) 编辑

6.2.2 一个人的旅行

摘要：一个人的旅行Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 78 Accepted Submission(s): 35 Problem Description 虽然草儿是个路痴（就是在杭电待了一年多，居然还会在校园里迷路的人，汗~),但是草儿仍然很喜欢旅行，因为在旅途中会遇见很多人（白马王子，^0^），很多事，还能丰富自己的阅历，还可以看美丽的风景……草儿想去很多地方，她想要去东京铁塔看夜景，去威尼斯... 阅读全文

posted @ 2013-04-26 22:43 cssystem 阅读(113) 评论(0) 推荐(0) 编辑

6.1.8 Pseudoforest

摘要： PseudoforestTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 182 Accepted Submission(s): 85 Problem Description In graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. The m... 阅读全文

posted @ 2013-04-26 22:41 cssystem 阅读(165) 评论(0) 推荐(0) 编辑

5.3.4 Connections between cities

摘要： Connections between citiesTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 444 Accepted Submission(s): 142 Problem Description After World War X, a lot of cities have been seriously damaged, and we need to rebuild those cities. Ho... 阅读全文

posted @ 2013-04-26 22:38 cssystem 阅读(125) 评论(0) 推荐(0) 编辑

6.1.7 Connect the Cities

摘要： Connect the CitiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 260 Accepted Submission(s): 93 Problem Description In 2100, since the sea level rise, most of the cities disappear. Though some survived cities are still connecte... 阅读全文

posted @ 2013-04-26 22:33 cssystem 阅读(139) 评论(0) 推荐(0) 编辑

6.1.6 Jungle Roads

摘要： Jungle RoadsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 87 Accepted Submission(s): 79 Problem DescriptionThe Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between... 阅读全文

posted @ 2013-04-26 22:30 cssystem 阅读(188) 评论(0) 推荐(0) 编辑

6.1.5 继续畅通工程

摘要：继续畅通工程Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 110 Accepted Submission(s): 90 Problem Description 省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可）。现得到城镇道路统计表，表中列出了任意两城镇间修建道路的费用，以及该道路是否已经修通的状态。现请你编写程序，计算出全省畅通需要的最... 阅读全文

posted @ 2013-04-26 22:28 cssystem 阅读(140) 评论(0) 推荐(0) 编辑

6.1.4 还是畅通工程

摘要：还是畅通工程Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 112 Accepted Submission(s): 86 Problem Description 某省调查乡村交通状况，得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可），并要求铺设的公路总长度为最小。请计算最小的公路总长度。 ... 阅读全文

posted @ 2013-04-26 22:27 cssystem 阅读(100) 评论(0) 推荐(0) 编辑

6.1.2 Eddy's picture

摘要： Eddy's pictureTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 115 Accepted Submission(s): 85 Problem Description Eddy begins to like painting pictures recently ,he is sure of himself to become a painter.Every day Eddy draws pictu... 阅读全文

posted @ 2013-04-26 22:26 cssystem 阅读(212) 评论(0) 推荐(0) 编辑

6.2.1 最短路

摘要：最短路Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 180 Accepted Submission(s): 100 Problem Description 在每年的校赛里，所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候，却是非常累的！所以现在他们想要寻找最短的从商店到赛场的路线，你可以帮助他们吗？ Input ... 阅读全文

posted @ 2013-04-26 22:22 cssystem 阅读(162) 评论(0) 推荐(0) 编辑

6.1.1 Constructing Roads

摘要： Constructing RoadsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 127 Accepted Submission(s): 92 Problem Description There are N villages, which are numbered from 1 to N, and you should build some roads such that every two village... 阅读全文

posted @ 2013-04-26 22:20 cssystem 阅读(164) 评论(0) 推荐(0) 编辑