【POJ】3259 - Wormholes

http://poj.org/problem?id=3259

农夫约翰有F个农场，每个农场有N块地，其间有M条路，W条时光隧道（时间倒流）。问是否可能回到过去？

spfa判负环。某点入队次数≥总点数

#include <iostream>
#include <vector>
#include <queue>
#include <cstring>
using namespace std;

const int maxV=501;
const int maxE=6000;
const int INF=9999999999;

int F,N,M,W;

struct Edge{
    int to,next,val;
}edge[maxE];
int num;
int head[maxE];

void add(int from,int to,int val){
    edge[num].to=to;
    edge[num].val=val;
    edge[num].next=head[from];
    head[from]=num++;
}

int dis[maxV];
int cot[maxV];
bool vis[maxV];

bool spfa(int s){
    queue <int> q;

    for (int i=0;i<=N;i++){
        dis[i]=INF;
    }
    memset(vis,0,sizeof(vis));
    memset(cot,0,sizeof(cot));

    dis[s]=0;
    vis[s]=true;
    q.push(s);

    int now;
    while (!q.empty()){
        now=q.front();
        vis[now]=false;
        q.pop();
        cot[now]++;
        if (cot[now]>=N) return false;
        for (int i=head[now];i!=-1;i=edge[i].next){
            int id=edge[i].to;
            if (dis[id]>dis[now]+edge[i].val){
                dis[id]=dis[now]+edge[i].val;
                if (!vis[id]){
                    q.push(id);
                    vis[id]=true;
                }
            }
        }
    }
    return true;
}
int main(){
    cin >> F;
    while (F--){
        cin >> N >> M >> W;

        int from,to,val;
        memset(head,-1,sizeof(head));
        num=0;
        for (int i=0;i<M;i++){
            cin >> from >> to >> val;
            add(from,to,val);
            add(to,from,val);
        }
        for (int i=0;i<W;i++){
            cin >> from >> to >> val;
            add(from,to,-val);
        }
        if (spfa(1)){
            cout << "NO" << endl;
        }
        else cout << "YES" << endl;
    }
}