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 backT 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的农场里field块地，path条路连接两块地，hole个虫洞，虫洞是一条单向路，不但会把你传送到目的地，而且时间会倒退Ts。如果看到了离开之前的自己输出YES。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define inf 0x3f3f3f3f

struct node
{
    int a;
    int b;
    int c;
} s[5100];

int n,m,k,num,dis[5100];

int Bellman_Ford()
{
    memset(dis,inf,sizeof(dis));
    dis[1]=0;
    for(int i=1; i<n; i++)  //n-1次松弛
        for(int j=0; j<num; j++) //枚举每条边
            if(dis[s[j].b]>dis[s[j].a]+s[j].c)
                dis[s[j].b]=dis[s[j].a]+s[j].c;
    for(int j=0; j<num; j++)
        if(dis[s[j].b]>dis[s[j].a]+s[j].c)   //判断是否存在负权边
            return 0;
    return 1;
}

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d %d %d",&n,&m,&k);
        num=0;
        int u,v,w;
        for(int i=0; i<m; i++)
        {
            scanf("%d %d %d",&u,&v,&w);
            s[num].a=u;
            s[num].b=v;
            s[num].c=w;
            num++;
            s[num].a=v;
            s[num].b=u;
            s[num].c=w;
            num++;
        }
        for(int i=0; i<k; i++)
        {
            scanf("%d %d %d",&u,&v,&w);
            s[num].a=u;
            s[num].b=v;
            s[num].c=-w;
            num++;
        }
        int sum=Bellman_Ford();
        if(sum==1)
            printf("NO\n");
        else printf("YES\n");
    }
    return 0;
}