POJ 3259 Wormholes

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.

题意：john是狂热的时间旅行者，他在探索他的农场的时候发现许多虫洞，他从一个农场到另一个农场可以通过走路或者是虫洞，如果通过虫洞的话，花的时间会减少，判断他能否碰到他自己~~~

思路：bellman—ford  判断负环

代码：

#include<stdio.h>
#include<string.h>
int dis[600];
int n,m,w,s[6000],e[6000],t[6000];
int Bellman()
{
    memset(dis,0,sizeof(dis));
    for(int i=0; i<=n; i++)
    {
        int flag=0;
        for(int j=0; j<m*2+w; j++)
        {
            if(dis[e[j]]>dis[s[j]]+t[j])
            {
                flag=1;
                dis[e[j]]=dis[s[j]]+t[j];
            }
        }
        if(!flag)
            return 0;
    }
    return 1;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d%d",&n,&m,&w);
        for(int i=0; i<m; i++)
        {
            scanf("%d%d%d",&s[i*2],&e[i*2],&t[i*2]);//双向通道，所以要这样~~~
            s[i*2+1]=e[i*2];
            e[i*2+1]=s[i*2];
            t[i*2+1]=t[i*2];
        }
        for(int i=0; i<w; i++)
        {
            scanf("%d%d%d",&s[m*2+i],&e[m*2+i],&t[m*2+i]);
            t[m*2+i]=-t[m*2+i];
        }
        if(Bellman())
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}