The Dream Of leozp

题目:http://poj.org/problem?id=1511 题意：就是求所有的节点到节点 1，然后从节点1返回的最小距离的和。 简单SPFA，和poj 3268 无多少差异。 #include #include #include #include #include #include #include #include #include #include #include #inclu

Dining Time Limit: 2000MS   Memory Limit: 65536KB   64bit IO Format: %I64d & %I64u Submit Status Description Cows are such finicky eaters. Each cow has a preference f

The Perfect Stall Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 20863   Accepted: 9417 Description Farmer John completed his new barn just last week, compl

QS Network Time Limit: 2 Seconds      Memory Limit: 65536 KB Sunny Cup 2003 - Preliminary Round April 20th, 12:00 - 17:00 Problem E: QS Network In the planet w-503 of galaxy cgb, there is

欢迎参加hihoCoder挑战赛14和15，赢取100件Tshirt！ Language: Default Constructing Roads Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 20997   Accepted: 8875

欢迎参加hihoCoder挑战赛14和15，赢取100件Tshirt！ Language: Default Building a Space Station Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 5944   Accepted: 2952

ZOJ Problem Set - 1456 Minimum Transport Cost Time Limit: 2 Seconds      Memory Limit: 65536 KB These are N cities in Spring country. Between each pair of cities there may be one transportat

Drainage Ditches 点击打开链接 Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 56466   Accepted: 21694 Description Every time it rains on Farmer John's fields, a p

题意：N块地，M条路，W个虫洞。判断有没有可以是时间倒流的路径。注意把W次输入的w[i]改成-w[i]。 SPFA:判断有没有入队次数超过N的点。

俩次SPFA。。。。

The Unique MST Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 20421   Accepted: 7183 Description Given a connected undirected graph, tell if its minimum spann

1074 - Extended Traffic     PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB Dhaka city is getting crowded and noisy day by day. Cert