POJ 3259(SPFA判断是否有负权环)

反思：
1.fields之间的路径是双向的，虫洞是单向的，看清楚题意。
2.可以通过SPFA看更新次数判断是否有负权环来判断是否存在满足条件的结果

#include <iostream>
#include <queue>
#include <cstdio>
#include <map>
#include <cstring>
#include <stack>
#include <string>
#include <vector>
#include <cmath>

using namespace std;

const int INF = 1 << 30;

struct Node
{
    int v;
    int w;
    Node(){}
    Node(int vv, int ww) : v(vv), w(ww) {}
};

int n, m, w;
vector<vector<Node> > G;
int dis[600];
int update[600];

void Init()
{
    memset(update, 0, sizeof(update));
    for (int i = 1; i <= n; i++) {
        dis[i] = INF;
    }
    G.resize(m + w + 1);
    for (int i = 1; i <= n; i++) {
        G[i].clear();
    }
}

int SPFA()
{
    queue<int> q;
    q.push(1);
    dis[1] = 0;
    while (!q.empty()) {
        int t = q.front();
        q.pop();
        for (int i = 0, j = G[t].size(); i < j; i++) {
            Node tmp = G[t][i];
            int md = tmp.w + dis[t];
            if (md < dis[tmp.v]) {
                dis[tmp.v] = md;
                update[tmp.v]++;
                if (update[tmp.v] >= n) {
                    return 1;
                }
                q.push(tmp.v);
            }
        }
    }
    return 0;
}

int main()
{
    #ifndef ONLINE_JUDGE
    //freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    #endif // ONLINE_JUDGE
    int f;
    scanf ("%d", &f);
    while (f--) {
        scanf ("%d%d%d", &n, &m, &w);
        Init ();
        for (int i = 0; i < m; i++) {
            int s, e, t;
            scanf ("%d%d%d", &s, &e, &t);
            G[s].push_back(Node(e, t));
            G[e].push_back(Node(s, t));
        }
        for (int i = 0; i < w; i++) {
            int s, e, t;
            scanf ("%d%d%d", &s, &e, &t);
            G[s].push_back(Node(e, -t));
        }

        if (SPFA()) {
            printf ("YES\n");
        } else {
            printf ("NO\n");
        }
    }
    return 0;
}