摘要:http://codeforces.com/problemset/problem/787/D 题目大意是给出一个有向图,有N个节点,初始节点在S,询问S到所有点最短路。边的读入方式有三种, 1 u v w 表示 u->v有一条边权为w的边, 2 v l r w ,表示v->[l,r]内的任意一个点支
阅读全文
摘要:Age of Moyu Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 119 Accepted Submission(s): 23 Prob
阅读全文
摘要:Senior Pan Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1462 Accepted Submission(s): 573 Pr
阅读全文
摘要:find the longest of the shortest Time Limit: 1000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3990 Accepted Su
阅读全文
摘要:How Many Maos Does the Guanxi Worth Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 3290 Accept
阅读全文
摘要:In Dhaka there are too many vehicles. So, the result is well known, yes, traffic jam. So, mostly people have to spend quite a time in the roads to go
阅读全文
摘要:https://vjudge.net/problem/UVA-10917 给出N点M边的无向图,没重边。对于点A,B,当且仅当从B到终点的最短路小于任何一条从A到终点的最短路时,才考虑从A走到B,否则不会走A-B。一开始理解错了题意以为是走最短路的不同方案。 令f(x)表示从x到2的不同方案,则 f
阅读全文
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=4725 The Shortest Path in Nya Graph Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java
阅读全文