随笔分类 -  最短路

1 2 下一页

LightOJ 1074 - Extended Traffic (SPFA)
摘要:http://lightoj.com/volume_showproblem.php?problem=10741074 - Extended TrafficPDF (English)StatisticsForumTime Limit:2 second(s)Memory Limit:32 MBDhaka city is getting crowded and noisy day by day. Certain roads always remain blocked in congestion. In order to convince people avoid shortest routes, a 阅读全文

posted @ 2013-10-02 23:00 kuangbin 阅读(2231) 评论(1) 推荐(0)

HDU 4725 The Shortest Path in Nya Graph (最短路)
摘要:The Shortest Path in Nya GraphTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 37Accepted Submission(s): 6Problem DescriptionThis is a very easy problem, your task is just calculate el camino mas corto en un grafico, and just solo hay que cambiar un 阅读全文

posted @ 2013-09-11 17:44 kuangbin 阅读(4043) 评论(11) 推荐(0)

POJ 1062 昂贵的聘礼 (最短路)
摘要:昂贵的聘礼Time Limit:1000MSMemory Limit:10000KTotal Submissions:30963Accepted:8737Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低要求。酋长说:"嗯,如果你能够替我弄到大祭司的皮袄,我可以只要8000金币。如果你能够弄来他的水晶球,那么只要5000金币就行了。"探险家就跑到大祭司那里,向他要求皮袄或水晶球,大祭司要他用金币来换,或者替他弄来其他的东西,他可 阅读全文

posted @ 2013-06-18 19:15 kuangbin 阅读(1297) 评论(0) 推荐(0)

POJ 2502 Subway
摘要:SubwayTime Limit:1000MSMemory Limit:65536KTotal Submissions:4928Accepted:1602DescriptionYou have just moved from a quiet Waterloo neighbourhood to a big, noisy city. Instead of getting to ride your bike to school every day, you now get to walk and take the subway. Because you don't want to be la 阅读全文

posted @ 2013-06-18 16:33 kuangbin 阅读(2188) 评论(0) 推荐(0)

POJ 3159 Candies(差分约束,最短路)
摘要:CandiesTime Limit:1500MSMemory Limit:131072KTotal Submissions:20067Accepted:5293DescriptionDuring the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flymouse distribute them. All the kids lov 阅读全文

posted @ 2013-06-17 22:35 kuangbin 阅读(1838) 评论(0) 推荐(1)

POJ 1511 Invitation Cards(单源最短路,优先队列优化的Dijkstra)
摘要:Invitation CardsTime Limit:8000MSMemory Limit:262144KTotal Submissions:16178Accepted:5262DescriptionIn the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. They 阅读全文

posted @ 2013-06-17 19:54 kuangbin 阅读(2464) 评论(0) 推荐(0)

POJ 3660 Cow Contest(传递闭包floyed算法)
摘要:Cow ContestTime Limit:1000MSMemory Limit:65536KTotal Submissions:5989Accepted:3234DescriptionN(1 ≤N≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows code better than others. Each cow has a certain constant skill rating that is unique among 阅读全文

posted @ 2013-06-17 18:10 kuangbin 阅读(2372) 评论(0) 推荐(0)

POJ 1502 MPI Maelstrom(最短路)
摘要:MPI MaelstromTime Limit:1000MSMemory Limit:10000KTotal Submissions:4017Accepted:2412DescriptionBIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. Valentine McKee's research advis 阅读全文

posted @ 2013-06-17 15:30 kuangbin 阅读(961) 评论(1) 推荐(0)

POJ 3259 Wormholes(最短路,判断有没有负环回路)
摘要:WormholesTime Limit:2000MSMemory Limit:65536KTotal Submissions:24249Accepted:8652DescriptionWhile exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that is BEFORE 阅读全文

posted @ 2013-06-17 15:26 kuangbin 阅读(892) 评论(0) 推荐(0)

POJ 3268 Silver Cow Party (最短路)
摘要:Silver Cow PartyTime Limit:2000MSMemory Limit:65536KTotal Submissions:10147Accepted:4497DescriptionOne cow from each ofNfarms (1 ≤N≤ 1000) conveniently numbered 1..Nis going to attend the big cow party to be held at farm #X(1 ≤X≤N). A total ofM(1 ≤M≤ 100,000) unidirectional (one-way roads connects p 阅读全文

posted @ 2013-06-16 00:12 kuangbin 阅读(1103) 评论(0) 推荐(0)

POJ 1797 Heavy Transportation (Dijkstra算法,求路径的最小值中的最大值)
摘要:Heavy TransportationTime Limit:3000MSMemory Limit:30000KTotal Submissions:17314Accepted:4546DescriptionBackgroundHugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his cu 阅读全文

posted @ 2013-06-15 18:33 kuangbin 阅读(1011) 评论(0) 推荐(0)

POJ 2253 Frogger (求每条路径中最大值的最小值,Dijkstra变形)
摘要:FroggerTime Limit:1000MSMemory Limit:65536KTotal Submissions:20314Accepted:6601DescriptionFreddy 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-06-15 18:30 kuangbin 阅读(744) 评论(0) 推荐(0)

POJ 2253 Frogger (最短路,floyed)
摘要:FroggerTime Limit:1000MSMemory Limit:65536KTotal Submissions:20310Accepted:6597DescriptionFreddy 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-06-14 15:40 kuangbin 阅读(2792) 评论(0) 推荐(0)

HDU 3416 Marriage Match IV(SPFA+最大流)
摘要:Marriage Match IVTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1514Accepted Submission(s): 427Problem DescriptionDo not sincere non-interference。Like that show, now starvae also take part in a show, but it take place between city A and B. Starvae 阅读全文

posted @ 2013-05-04 13:00 kuangbin 阅读(1613) 评论(0) 推荐(0)

POJ 1847 Tram(最短路)
摘要:TramTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 7180Accepted: 2601DescriptionTram network in Zagreb consists of a number of intersections and rails connecting some of them. In every intersection there is a switch pointing to the one of the rails going out of the intersection. When the t 阅读全文

posted @ 2012-08-19 14:54 kuangbin 阅读(826) 评论(0) 推荐(0)

POJ 1511 Invitation Cards(最短路)
摘要:Invitation CardsTime Limit: 8000MSMemory Limit: 262144KTotal Submissions: 14556Accepted: 4710DescriptionIn the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. T 阅读全文

posted @ 2012-08-18 20:57 kuangbin 阅读(478) 评论(0) 推荐(0)

POJ 2240 Arbitrage(求正环)
摘要:ArbitrageTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 11008Accepted: 4629DescriptionArbitrage 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 po 阅读全文

posted @ 2012-08-18 19:39 kuangbin 阅读(585) 评论(0) 推荐(0)

POJ 1125 Stockbroker Grapevine(任意两点的最短路,FLoyed 算法)
摘要:Stockbroker GrapevineTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 21124Accepted: 11474DescriptionStockbrokers 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 th 阅读全文

posted @ 2012-08-18 18:50 kuangbin 阅读(414) 评论(0) 推荐(0)

POJ 2253 Frogger(最短路的变形)
摘要:FroggerTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 17842Accepted: 5818DescriptionFreddy 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' sunsc 阅读全文

posted @ 2012-08-18 17:13 kuangbin 阅读(771) 评论(0) 推荐(0)

POJ 1062 昂贵的聘礼(最短路Dijkstra)
摘要:昂贵的聘礼Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 27365Accepted: 7639Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低要求。酋长说:"嗯,如果你能够替我弄到大祭司的皮袄,我可以只要8000金币。如果你能够弄来他的水晶球,那么只要5000金币就行了。"探险家就跑到大祭司那里,向他要求皮袄或水晶球,大祭司要他用金币来换,或者替他弄来其他的东 阅读全文

posted @ 2012-08-18 01:45 kuangbin 阅读(612) 评论(0) 推荐(0)

1 2 下一页

导航

JAVASCRIPT: