随笔分类 -  题解

上一页 1 2 3 4 下一页
[题解] 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 阅读(149) 评论(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 11865 Stream My Contest (二分+最小树形图)
摘要：传送门 https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2965 11865 Stream My Contest Time limit: 1.000 sec 阅读全文
posted @ 2017-08-16 16:55 lstttt 阅读(178) 评论(0) 推荐(0)
[题解] poj 3164 Command Network (朱刘算法 最小树形图(有向生成树))
摘要：传送门 http://poj.org/problem?id=3164 Command Network | Time Limit: 1000MS | | Memory Limit: 131072K | | Total Submissions: 18672 | | Accepted: 5359 | De 阅读全文
posted @ 2017-08-16 16:28 lstttt 阅读(375) 评论(0) 推荐(0)
[题解] uva 11354 Bond(kruskal最小生成树+倍增LCA)
摘要：传送门 https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2339 11354 Bond Time limit: 8.000 seconds | "Root" 阅读全文
posted @ 2017-08-14 21:27 lstttt 阅读(190) 评论(0) 推荐(1)
[题解] bzoj 1016 jsoi 2008 最小生成树计数 (kruskal最小生成树)
摘要：传送门 http://www.lydsy.com/JudgeOnline/problem.php?id=1016 1016: [JSOI2008]最小生成树计数 Time Limit: 1 Sec Memory Limit: 162 MB Submit: 6066 Solved: 2472 "[Su 阅读全文
posted @ 2017-08-14 16:32 lstttt 阅读(197) 评论(0) 推荐(0)
[题解] bzoj 1821 jsoi 2010 Group 部落划分(kruskal最小生成树)
摘要：传送门 http://www.lydsy.com/JudgeOnline/problem.php?id=1821 1821: [JSOI2010]Group 部落划分 Group Time Limit: 10 Sec Memory Limit: 64 MB Submit: 2505 Solved:  阅读全文
posted @ 2017-08-14 11:01 lstttt 阅读(117) 评论(0) 推荐(0)
[题解] uva 10369 Arctic Network(kruskal最小生成树)
摘要：传送门 https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1310 10369 Arctic Network Time limit: 3.000 second 阅读全文
posted @ 2017-08-14 09:44 lstttt 阅读(155) 评论(0) 推荐(0)
[题解] 洛谷 P1550 USACO 2008 OCT 打井Watering Hole (kruskal最小生成树)
摘要：传送门 https://www.luogu.org/problem/show?pid=1550 P1550 [USACO08OCT]打井Watering Hole 时空限制 1s / 128MB 提交 " 讨论" " 题解" 题目背景 John的农场缺水了！！！ 题目描述 Farmer John h 阅读全文
posted @ 2017-08-13 21:59 lstttt 阅读(248) 评论(0) 推荐(0)
[题解] uva 1151 Buy or Build (kruskal最小生成树)
摘要：传送门 https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3592 1151 Buy or Build Time limit: 3.000 seconds | 阅读全文
posted @ 2017-08-13 20:58 lstttt 阅读(83) 评论(0) 推荐(0)
[题解] uva 1395 slim span(kruskal最小生成树)
摘要：传送门 https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4141 1395 Slim Span Time limit: 3.000 seconds | "R 阅读全文
posted @ 2017-08-13 17:12 lstttt 阅读(118) 评论(0) 推荐(0)
[题解] uvalive 5713 Qin Shi Huang's National Road System 秦始皇修路(prim最小生成树)
摘要：传送门 https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3714 5713 Qin Shi Huang's National Road Sys 阅读全文
posted @ 2017-08-13 16:06 lstttt 阅读(97) 评论(0) 推荐(1)
[题解] bzoj 2038 小z的袜子(莫队)
摘要：传送门 http://www.lydsy.com/JudgeOnline/problem.php?id=2038 2038: [2009国家集训队]小Z的袜子(hose) Time Limit: 20 Sec Memory Limit: 259 MB Submit: 11157 Solved: 49 阅读全文
posted @ 2017-08-13 10:02 lstttt 阅读(138) 评论(0) 推荐(0)
[题解] poj 1904 King's Quest (tarjan强连通分量)
摘要：传送门 http://poj.org/problem?id=1904 King's Quest | Time Limit: 15000MS | | Memory Limit: 65536K | | Total Submissions: 9328 | | Accepted: 3441 | | Case 阅读全文
posted @ 2017-08-12 16:46 lstttt 阅读(118) 评论(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)

上一页 1 2 3 4 下一页