POJ-3259 Wormholes 判断负环

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

题解：spfa，存在负环相当于某个点被改了n次。

代码：

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
using namespace std;
const int maxm = 6000;
const int maxn = 505;
const int INF = 1e5;
int head[maxn], nxt[maxm], tot, ver[maxm], edge[maxm];
int dist[maxn], numOfV[maxn];
bool vis[maxn];
void addEdge(int x, int y, int z)
{
    ver[++tot] = y, edge[tot] = z, nxt[tot] = head[x], head[x] = tot;
}
queue<int>q;
bool spfa(int n)
{
    memset(numOfV, 0, sizeof(numOfV));
    memset(vis, 0, sizeof(vis));
    for(int i = 1; i <= n; ++i)
        dist[i] = INF;
    dist[1] = 0;
    q.push(1);
    while(!q.empty())
    {
        int f = q.front();
        q.pop();
        vis[f] = false;
        for(int i = head[f]; i; i = nxt[i])
        {
            int e = ver[i];
            if(dist[e] > dist[f] + edge[i])
            {
                dist[e] = dist[f] + edge[i];
                numOfV[e]++;
                if(numOfV[e] >= n) //累计变换n次路径则存在负环
                {
                    while(!q.empty())
                        q.pop();
                    return false;
                }
                if(!vis[e])
                {
                    q.push(e);
                    vis[e] = true;
                }
            }
        }
    }
    return true;
}

int main()
{
    int t, s, e, v;
    scanf("%d", &t);
    while(t--)
    {
        int n, m, w;
        tot = 0;
        memset(head, 0, sizeof(head));
        scanf("%d%d%d", &n, &m, &w);
        for(int i = 0; i < m; ++i)
        {
            scanf("%d%d%d", &s, &e, &v);
            addEdge(s, e, v);
            addEdge(e, s, v);
        }
        for(int i = 0; i < w; ++i)
        {
            scanf("%d%d%d", &s, &e, &v);
            addEdge(s, e, -v);
        }
        if(!spfa(n))
            puts("YES");
        else
            puts("NO");
    }
}