Wormholes(spfa判断负环)

Wormholes

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 48169		Accepted: 17781

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.

Source

#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
#define inf 0x3f3f3f3f
#define maxn 550
struct Edge
{
    int to;
    int w;
    int next;
}e[5500];
int head[maxn];
int dis[maxn];
int num[maxn];
int vis[maxn];
int n, m, cnt,z;
 void add(int u, int v, int w)
 {
     e[cnt].to = v;
     e[cnt].w = w;
     e[cnt].next = head[u];
     head[u] = cnt++;
 }
int spfa(int sc)
{
   memset(vis, 0, sizeof(vis));
   memset(dis, inf, sizeof(vis));
   memset(num, 0, sizeof(num));
   dis[sc] = 0;
   vis[sc] = 1;
   queue<int>q;
   q.push(sc);
   num[sc]++;
   while(!q.empty())
   {
       int now = q.front();
       q.pop();
       vis[now] = 0;
       for(int i = head[now]; i != -1; i = e[i].next)
       {
           int to = e[i].to;
           if(dis[to] > dis[now] + e[i].w)
           {
               dis[to] = dis[now] + e[i].w;
               if(!vis[to])
               {
                   q.push(to);
                   vis[to] = 1;
                   num[to]++;
                   if(num[to] > n)
                      return 0;
               }
           }
       }
   }
   return 1;

}
int main()
{
   int t;
   scanf("%d", &t);
   while(t--)
   {
       memset(head, -1, sizeof(head));
       cnt = 0;

       scanf("%d%d%d", &n, &m, &z);
       int u, v, w;
       for(int i = 0; i < m; i++)
       {
           scanf("%d%d%d", &u, &v, &w);
           add(u, v, w);
           add(v, u, w);
       }
       for(int i = 0; i < z; i++)
       {
           scanf("%d%d%d", &u, &v, &w);
           add(u, v, -w);
       }
       if(spfa(1))
         printf("NO\n");
       else printf("YES\n");
   }
}