随笔分类 -  最短路

[题解] BYVoid 魔兽世界模拟赛 Stage.1 埃雷萨拉斯寻宝 (缩点最短路)
摘要：传送门 https://www.byvoid.com/zhs/blog/byvoid wow stage 1 埃雷萨拉斯寻宝 问题描述 一万两千年前，当精灵还是在艾萨拉女王的统治下的时候，辛德拉就是是女王手下一名很有 地位的法师了。他受任建造了一座城市，来保存女王的法师们进行魔法研究的成果和法术物 阅读全文
posted @ 2017-08-28 21:10 lstttt 阅读(288) 评论(0) 推荐(0)
[题解] PowerOJ 1749 孤岛营救问题 (最短路)
摘要：传送门 https://www.oj.swust.edu.cn/problem/show/1749 1749: 孤岛营救问题 Time Limit: 1000 MS Memory Limit: 65536 KB Total Submit: "50" Accepted: "29" Page View: 阅读全文
posted @ 2017-08-26 14:26 lstttt 阅读(665) 评论(0) 推荐(0)
[题解] PowerOJ 1750 汽车加油行驶问题 (最短路)
摘要：传送门 https://www.oj.swust.edu.cn/problem/show/1750 1750: 汽车加油行驶问题 Time Limit: 1000 MS Memory Limit: 65536 KB Total Submit: "55" Accepted: "31" Page Vie 阅读全文
posted @ 2017-08-26 09:53 lstttt 阅读(1242) 评论(0) 推荐(1)
[题解] poj 1716 Integer Intervals (差分约束+spfa)
摘要：传送门 http://poj.org/problem?id=1716 Integer Intervals | Time Limit: 1000MS | | Memory Limit: 10000K | | Total Submissions: 15086 | | Accepted: 6375 | D 阅读全文
posted @ 2017-08-20 14:17 lstttt 阅读(278) 评论(0) 推荐(0)
[题解] hdu 2433 Travel (BFS)
摘要：传送门 http://acm.hdu.edu.cn/showproblem.php?pid=2433 Travel Time Limit: 10000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Subm 阅读全文
posted @ 2017-08-20 13:01 lstttt 阅读(201) 评论(0) 推荐(1)
[题解] poj 3169 Layout (差分约束+bellmanford)
摘要：传送门 http://poj.org/problem?id=3169 Layout | Time Limit: 1000MS | | Memory Limit: 65536K | | Total Submissions: 12028 | | Accepted: 5771 | Description 阅读全文
posted @ 2017-08-19 17:18 lstttt 阅读(167) 评论(0) 推荐(0)
[题解] poj 3660 Cow Contest (floyd)
摘要：传送门 http://poj.org/problem?id=3660 Cow Contest | Time Limit: 1000MS | | Memory Limit: 65536K | | Total Submissions: 12726 | | Accepted: 7084 | Descrip 阅读全文
posted @ 2017-08-19 15:44 lstttt 阅读(97) 评论(0) 推荐(0)
[题解] hdu 1142 A Walk Through the Forest (dijkstra最短路 + 记忆化搜索)
摘要：传送门 http://acm.hdu.edu.cn/showproblem.php?pid=1142 A Walk Through the Forest Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/ 阅读全文
posted @ 2017-08-19 11:03 lstttt 阅读(167) 评论(0) 推荐(0)
[题解] poj 1724 ROADS (dijkstra最短路+A*搜索)
摘要：传送门 http://poj.org/problem?id=1724 ROADS | Time Limit: 1000MS | | Memory Limit: 65536K | | Total Submissions: 16053 | | Accepted: 5758 | Description N 阅读全文
posted @ 2017-08-18 21:49 lstttt 阅读(168) 评论(0) 推荐(0)
[题解] poj 2449 Remmarguts' Date (dijkstra最短路+A*搜索)
摘要：传送门 http://poj.org/problem?id=2449 Remmarguts' Date | Time Limit: 4000MS | | Memory Limit: 65536K | | Total Submissions: 30603 | | Accepted: 8361 | De 阅读全文
posted @ 2017-08-18 20:28 lstttt 阅读(371) 评论(0) 推荐(0)
[题解] poj 3159 Candies (dijkstra最短路+差分约束)
摘要：传送门 http://poj.org/problem?id=3159 Candies | Time Limit: 1500MS | | Memory Limit: 131072K | | Total Submissions: 33044 | | Accepted: 9265 | Descriptio 阅读全文
posted @ 2017-08-18 15:33 lstttt 阅读(151) 评论(0) 推荐(0)
[题解] poj 3259 Wormholes (dfs/bellmanford判负环)
摘要：传送门 http://poj.org/problem?id=3259 Wormholes | Time Limit: 2000MS | | Memory Limit: 65536K | | Total Submissions: 54401 | | Accepted: 20260 | Descript 阅读全文
posted @ 2017-08-18 11:19 lstttt 阅读(148) 评论(0) 推荐(0)
[题解] hdu 1596 find the safest road (dijkstra最短路)
摘要：传送门 http://acm.hdu.edu.cn/showproblem.php?pid=1596 find the safest road Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Othe 阅读全文
posted @ 2017-08-18 09:51 lstttt 阅读(108) 评论(0) 推荐(0)
[题解] uva 658 It's not a Bug, it's a Feature! (dijkstra最短路)
摘要：传送门 https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=599 658 It's not a Bug, it's a Feature! Time limit 阅读全文
posted @ 2017-08-17 17:09 lstttt 阅读(131) 评论(0) 推荐(0)
[题解] uva 247 Calling Circles (floyd判联通/tarjan强连通分量)
摘要：传送门 https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=183 247 Calling Circles Time limit: 3.000 seconds 阅读全文
posted @ 2017-08-17 11:08 lstttt 阅读(161) 评论(0) 推荐(0)
[题解] uva 11721 Instant View of Big Bang(spfa求负环)
摘要：传送门 https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2768 11721 Instant View of Big Bang Time limit: 2. 阅读全文
posted @ 2017-08-12 14:57 lstttt 阅读(174) 评论(0) 推荐(0)