POJ 3259 Wormholes 判断负圈（Ford）

While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that is BEFORE you entered the wormhole! Each of FJ’s farms comprises N (1 ≤ N ≤ 500) fields conveniently numbered 1…N, M (1 ≤ M ≤ 2500) paths, and W (1 ≤ W ≤ 200) wormholes.
As FJ is an avid time-traveling fan, he wants to do the following: start at some field, travel through some paths and wormholes, and return to the starting field a time before his initial departure. Perhaps he will be able to meet himself ? .
To help FJ find out whether this is possible or not, he will supply you with complete maps to F (1 ≤ F ≤ 5) of his farms. No paths will take longer than 10,000 seconds to travel and no wormhole can bring FJ back in time by more than 10,000 seconds.

Input
Line 1: A single integer, F. F farm descriptions follow.
Line 1 of each farm: Three space-separated integers respectively: N, M, and W
Lines 2… M+1 of each farm: Three space-separated numbers ( S, E, T) that describe, respectively: a bidirectional path between S and E that requires T seconds to traverse. Two fields might be connected by more than one path.
Lines M+2… M+ W+1 of each farm: Three space-separated numbers ( S, E, T) that describe, respectively: A one way path from S to E that also moves the traveler back T seconds.

Output
Lines 1… F: For each farm, output “YES” if FJ can achieve his goal, otherwise output “NO” (do not include the quotes).

Sample Input
2
3 3 1
1 2 2
1 3 4
2 3 1
3 1 3
3 2 1
1 2 3
2 3 4
3 1 8

Sample Output
NO
YES

Hint
For farm 1, FJ cannot travel back in time.
For farm 2, FJ could travel back in time by the cycle 1->2->3->1, arriving back at his starting location 1 second before he leaves. He could start from anywhere on the cycle to accomplish this.

题目大意：有一个人在n个点之间走来走去。n个点之间有双向的道路，也有单向的 可以回到几秒前的虫洞。
问： 存不存在一种走法，走来走去走来走去，走回到起点的时候，时间刚好在自己出发以前？

代码如下：

#include
#include
#include
#include
#include
#include
#define ll long long
#define inf 1e9
#define N 110
using namespace std;
struct edge{
int from,to,cost;
}es[6000];
int d[510];
int n,m,w,s;
bool loop(){
memset(d,0,sizeof(d));
for(int i=1;i<=n;i++){
for(int j=0;j<s;j++){
edge e=es[j];
if(d[e.to]>d[e.from]+e.cost){
d[e.to]=d[e.from]+e.cost;
if(i==n)return true;//如果第n次仍然更新了，则存在负圈
}
}
}
return false;
}
int main(){
int T;
scanf("%d",&T);
while(T–){
int a,b,c;
s=0;
scanf("%d %d %d",&n,&m,&w);
while(m–){
scanf("%d %d %d",&a,&b,&c);
es[s].from=a;
es[s].to=b;
es[s++].cost=c;
es[s].from=b;
es[s].to=a;
es[s++].cost=c;
}
while(w–){
scanf("%d %d %d",&a,&b,&c);
es[s].from=a;
es[s].to=b;
es[s++].cost=-c;
}
if(loop())printf(“YES\n”);
else printf(“NO\n”);
}
return 0;
}