POJ - 3259 Wormholes

题目链接
题意：有N个农场，这N个农场之间有M条路径、W个虫洞，虫洞可以从地点A传送到地点B的之前的时刻。能不能通过虫洞由A穿越回这个时刻之前的A。
思路： spfa判断负环。

#pragma GCC optimize(2)
#include<map>
#include<queue>
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

#define fi first
#define se second
#define ff double
#define int long long
#define PII pair<int,int>
#define all(x) x.begin(),x.end()
#define debug(x) cout << x << endl
#define mem(a,b) memset(a,b,sizeof(a))

const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int N = 505;
const int M = 6050;
int t, n, m, x, dis[N], vis[N], cnt[N];
int h[M], e[M], w[M], ne[M], idx;
void add(int a, int b, int c){e[idx] = b; w[idx] = c; ne[idx] = h[a]; h[a] = idx ++;}
int spfa(){
    mem(dis,INF); mem(vis, 0); mem(cnt, 0);
    queue<int> q;
    dis[1] = 0; vis[1] = 1; cnt[1] ++;
    q.push(1);
    while(q.size()){
        int v = q.front(); q.pop();
        vis[v] = 0;
        for(int i = h[v];i != -1;i = ne[i]){
            int j = e[i];
            if(dis[j] > dis[v] + w[i]){
                dis[j] = dis[v] + w[i];
                cnt[j] ++;
                if(cnt[j] >= n) return 1;
                if(!vis[j]) vis[j] = 1, q.push(j);
            }
        }
    }
    return 0;
}
signed main() {
    cin >> t;
    while(t --){
        mem(h, -1); idx = 0;
        cin >> n >> m >> x;
        for(int i = 0;i < m;i ++){
            int u, v, z;
            cin >> u >> v >> z;
            add(u, v, z);
            add(v, u, z);
        }
        for(int i = 0;i < x;i ++){
            int u, v, z;
            cin >> u >> v >> z;
            add(u, v, -z);
        }
        if(spfa()) puts("YES");
        else puts("NO");

    }
}