poj Wormholes

Wormholes

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 43393		Accepted: 15936

Description

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.

最短路判断负环问题，要注意路径是双向边

Bellman-Ford

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
const int N = 300000;
struct node
{
    int from, to, cost;
}p[N];
int dis[N];


int main()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {
        int n, m, w;
        scanf("%d %d %d", &n, &m, &w);
        int k=0;
        int x, y, cost;
        for(int i=0;i<m;i++)
        {


            scanf("%d %d %d", &x, &y, &cost);
            p[k].from=x, p[k].to=y, p[k].cost=cost;
            k++;
            p[k].from=y, p[k].to=x, p[k].cost=cost;
            k++;
        }
        for(int i=m;i<m+w;i++)
        {
            scanf("%d %d %d", &x, &y, &cost);
            p[k].from=x, p[k].to=y, p[k].cost=-cost;
            k++;
        }
        int flag=0;
        memset(dis,0,sizeof(dis));
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<k;j++)
            {
                node e=p[j];
                if(dis[e.to]>dis[e.from]+e.cost)
                {
                    dis[e.to]=dis[e.from]+e.cost;
                    if(i==n-1)
                    {
                        flag=1;
                    }
                }
            }
            if(flag==1)
            {
                break;
            }
        }
        if(flag==1)
        {
            printf("YES\n");
        }
        else
        {
            printf("NO\n");
        }
    }
    return 0;
}