最短路
文章平均质量分 86
丿残念灬
这个作者很懒,什么都没留下…
展开
-
SCU-4527 NightMare2(Dijkstra)
涨姿势的一道题,最短路与二分的结合,求得在限定距离内,获得价值的最大值题解:二分答案(获得的最多财宝价值),Dijkstra求最短路,在获得价值为mid的情况下,如果能在时间k内走到终点,则返回true,否则返回false#include#include#include#include#includeusing namespace std;const int max原创 2016-08-08 15:03:08 · 422 阅读 · 0 评论 -
HDU-5521 Meeting(Dijkstra)
MeetingTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1824 Accepted Submission(s): 571Problem DescriptionBessie and her f原创 2016-09-22 22:29:32 · 453 阅读 · 0 评论 -
LightOJ-1321 Sending Packets(期望+spfa)
M - Sending Packets LightOJ - 1321 题意:给定一张无向图,每条边都有一个通过的概率 ,如果无法通过,那么就要回到起点重新出发从起点到终点的时间固定为K,如果成功到达,又需要额外花费K的时间,问走S次的最小期望时间题解:spfa+期望。先跑一遍spfa,找出从0到n-1的最大成功概率设期望值为E,成功概率为p,如果成功,期望值为p*2k,如果不成功,期望值为(1-p...原创 2017-01-24 22:55:43 · 890 阅读 · 0 评论 -
HDU-3790 最短路径问题(Dijkstra)
最短路径问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22943 Accepted Submission(s): 6849Problem Description给你n个点,m条无向边,每条边都有长度d和花原创 2016-08-10 20:23:25 · 286 阅读 · 0 评论 -
POJ-3259 Wormholes(SPFA)
WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 44207 Accepted: 16258DescriptionWhile exploring his many farms, Farmer John has discovered a原创 2016-08-10 22:24:25 · 258 阅读 · 0 评论 -
HDU-5418 Victor and World(状压+spfa)
Victor and WorldTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 1294 Accepted Submission(s): 582Problem DescriptionAfter trying原创 2016-08-10 11:39:32 · 417 阅读 · 0 评论 -
HDU-1869 六度分离(Floyd)
六度分离Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8072 Accepted Submission(s): 3312Problem Description1967年,美国著名的社会学家斯坦利·米尔格兰姆提原创 2016-08-10 20:21:48 · 363 阅读 · 0 评论 -
简单的图论问题(Dijkstra)
O - 简单的图论问题?Time Limit:5000MS Memory Limit:65535KB 64bit IO Format:Submit StatusDescription给一个 n 行 m 列的迷宫,每个格子要么是障碍物要么是空地。每个空地里都有一个权值。你的 任务是从找一条(r1,c1)到(r2,c2原创 2016-08-10 20:17:26 · 2075 阅读 · 0 评论 -
HDU-4360 As long as Binbin loves Sangsang(Dijkstra)
As long as Binbin loves SangsangTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3415 Accepted Submission(s): 746Problem Description原创 2016-08-10 20:13:20 · 330 阅读 · 0 评论 -
POJ-3169 Layout(SPFA)
LayoutTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10156 Accepted: 4891DescriptionLike everyone else, cows like to stand close to their friends when原创 2016-08-20 21:13:27 · 210 阅读 · 0 评论 -
POJ - 3660 Cow Contest(Floyd)
Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9807 Accepted: 5513DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participa原创 2016-08-09 11:31:30 · 333 阅读 · 0 评论 -
HDU-6331 Problem M. Walking Plan(分块+最短路)
Problem M. Walking PlanTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 169 Accepted Submission(s): 40 Problem DescriptionThere are ...原创 2018-07-30 22:45:59 · 321 阅读 · 0 评论