LightOJ 1074（SPFA+判断负权环）

反思：明明已经想到了有负权环为什么第一次还是没判断呢。事实证明，一心二用好难，一边打游戏一边敲题容易出低级错误。其实是个简单题。

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

using namespace std;

const int INF = 1 << 30;
const int maxn = 210;
const int maxm = 40010;

struct Edge
{
    int v, w, next;
    Edge(){}
    Edge(int vv, int ww, int nn)
    {
        v = vv;
        w = ww;
        next = nn;
    }
};

int n, m;
int cnt;
int head[maxn];
Edge e[maxm];
int vis[maxn];
int dis[maxn];
int busy[maxn];
int update[maxn];
int flag[maxn];

void Init()
{
    cnt = 1;
    memset (head, -1, sizeof(head));
    memset (vis, 0, sizeof(vis));
    for (int i = 1; i <= n; i++) {
        dis[i] = INF;
    }
    memset (update, 0 ,sizeof(update));
    memset (flag, 0, sizeof(flag));
}

void Add(int u, int v, int w)
{
    e[cnt] = Edge (v, w, head[u]);
    head[u] = cnt++;
}

void dfs(int v)
{
    for (int i = head[v]; i != -1; i = e[i].next) {
         int tmp = e[i].v;
         if (!flag[tmp]) {
            flag[tmp] = 1;
            dfs (tmp);
         }
    }
}

void SPFA()
{
    queue<int> q;
    q.push(1);
    vis[1] = 1;
    dis[1] = 0;
    while (!q.empty()) {
        int t = q.front();
        q.pop();
        vis[t] = 0;
        for (int i = head[t]; i != -1; i = e[i].next) {
            int tmp = e[i].v;
            if (!flag[tmp] && dis[tmp] > dis[t] + e[i].w) {
                dis[tmp] = dis[t] + e[i].w;
                update[tmp]++;
                if (update[tmp] >= n) {
                    flag[tmp] = 1;
                    dfs (tmp);
                    continue;
                }
                if (!vis[tmp]) {
                    q.push(tmp);
                    vis[tmp] = 1;
                }
            }
        }
    }
}

int main()
{
    #ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    #endif // ONLINE_JUDGE
    int t;
    scanf ("%d", &t);
    for (int kase = 1; kase <= t; kase++) {
        scanf ("%d", &n);
        Init ();
        for (int i = 1; i <= n; i++) {
            scanf ("%d", &busy[i]);
        }
        scanf ("%d", &m);
        for (int i = 0; i < m; i++) {
            int s, d;
            scanf ("%d%d", &s, &d);
            int cos = (busy[s] - busy[d]) * (busy[s] - busy[d]) * (busy[s] - busy[d]);
            Add (s, d, -cos);
        }
        SPFA ();
        printf ("Case %d:\n", kase);
        int q;
        scanf ("%d", &q);
        for (int i = 0; i < q; i++) {
            int des;
            scanf ("%d", &des);
            if (flag[des] || dis[des] < 3 || dis[des] == INF) {
                printf ("?\n");
            } else {
                printf ("%d\n", dis[des]);
            }
        }
    }
    return 0;
}