随笔分类 -  最短路径

摘要:In ActionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3869Accepted Submission(s): 1237Problem D... 阅读全文
posted @ 2014-05-22 12:37 heaventouch 阅读(201) 评论(0) 推荐(0) 编辑
摘要:SightseeingTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 639Accepted Submission(s): 249Problem D... 阅读全文
posted @ 2014-05-20 20:36 heaventouch 阅读(394) 评论(0) 推荐(0) 编辑
摘要:How Many Paths Are ThereTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1010Accepted Submission(s)... 阅读全文
posted @ 2014-05-20 09:13 heaventouch 阅读(429) 评论(0) 推荐(0) 编辑
摘要:Here We Go(relians) AgainTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 685Accepted Submission(s)... 阅读全文
posted @ 2014-05-19 23:21 heaventouch 阅读(307) 评论(0) 推荐(0) 编辑
摘要:find the safest roadTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6119Accepted Submission(s): 2... 阅读全文
posted @ 2014-05-18 20:50 heaventouch 阅读(183) 评论(0) 推荐(0) 编辑
摘要:Bus SystemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6082Accepted Submission(s): 1560Problem ... 阅读全文
posted @ 2014-05-17 08:28 heaventouch 阅读(274) 评论(0) 推荐(0) 编辑
摘要:TruckingTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1692Accepted Submission(s): 587Problem D... 阅读全文
posted @ 2014-05-16 15:22 heaventouch 阅读(223) 评论(0) 推荐(0) 编辑
摘要:A Walk Through the ForestTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5306Accepted Submission(s... 阅读全文
posted @ 2014-05-16 13:16 heaventouch 阅读(206) 评论(0) 推荐(0) 编辑
摘要:Domino EffectTime Limit:2 Seconds Memory Limit:65536 KBDid you know that you can use domino bones for other things besides playing Dominoes? Take a nu... 阅读全文
posted @ 2014-05-14 18:29 heaventouch 阅读(248) 评论(0) 推荐(0) 编辑
摘要:最短路Time Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 26172Accepted Submission(s): 11289Problem Description在每年的校赛里,所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候,却是非常累的!所以现在他们想要寻找最短的从商店到赛场的路线,你可以帮助他们吗?Input输入包括多组数据。每组数据第一行是两个整数N、M(N12 #inclu 阅读全文
posted @ 2014-03-12 19:10 heaventouch 阅读(325) 评论(0) 推荐(0) 编辑
摘要:Invitation CardsTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1588Accepted Submission(s): 714Problem DescriptionIn the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They 阅读全文
posted @ 2013-11-24 10:34 heaventouch 阅读(324) 评论(0) 推荐(0) 编辑
摘要:XYZZYTime Limit:1000MSMemory Limit:30000KTotal Submissions:3105Accepted:887DescriptionThe prototypical computer adventure game, first designed by Will Crowther on the PDP-10 in the mid-1970s as an attempt at computer-refereed fantasy gaming, and expanded into a puzzle-oriented game by Don Woods at S 阅读全文
posted @ 2013-11-23 17:47 heaventouch 阅读(372) 评论(0) 推荐(0) 编辑
摘要:ArbitrageTime Limit:1000MSMemory Limit:65536KTotal Submissions:13800Accepted:5815DescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US Dollar buys 0.5 British pound, 阅读全文
posted @ 2013-11-23 11:27 heaventouch 阅读(408) 评论(0) 推荐(1) 编辑
摘要:Stockbroker GrapevineTime Limit:1000MSMemory Limit:10000KTotal Submissions:24372Accepted:13408DescriptionStockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the stockbrokers to give your employer the tactical edge in the st 阅读全文
posted @ 2013-11-23 10:09 heaventouch 阅读(221) 评论(0) 推荐(0) 编辑
摘要:FroggerTime Limit:1000MSMemory Limit:65536KTotal Submissions:22557Accepted:7339DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tourists' sunscreen 阅读全文
posted @ 2013-11-23 09:21 heaventouch 阅读(242) 评论(0) 推荐(0) 编辑
摘要:昂贵的聘礼Time Limit:1000MSMemory Limit:10000KTotal Submissions:33365Accepted:9500Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低要求。酋长说:"嗯,如果你能够替我弄到大祭司的皮袄,我可以只要8000金币。如果你能够弄来他的水晶球,那么只要5000金币就行了。"探险家就跑到大祭司那里,向他要求皮袄或水晶球,大祭司要他用金币来换,或者替他弄来其他的东西,他可 阅读全文
posted @ 2013-11-22 12:16 heaventouch 阅读(279) 评论(0) 推荐(0) 编辑
摘要:Harry Potter and the Final BattleTime Limit: 5000/3000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2118Accepted Submission(s): 580Problem DescriptionThe final battle is coming. Now Harry Potter is located at city 1, and Voldemort is located at city n. To make the wo 阅读全文
posted @ 2013-11-19 17:26 heaventouch 阅读(501) 评论(0) 推荐(0) 编辑
摘要:FlightTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2014Accepted Submission(s): 428Problem DescriptionRecently, Shua Shua had a big quarrel with his GF. He is so upset that he decides to take a trip to some other city to avoid meeting her. He w 阅读全文
posted @ 2013-11-19 11:03 heaventouch 阅读(417) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示