【TopCoder 8404】WarTransportation（最短路 + 有后效性的动态规划）

题目链接：【TopCoder 8404】WarTransportation

题目大意：有一个$n$个节点$m$条边的有向图，一个人要从图的$1$号节点走到$2$号节点。但是图的一条边断了，只有走到一条边的端点才能知道一条边是否断掉。问那个人在最坏情况下最少要走多少距离（无解输出$-1$）。$n\le 100,m\le 500$。

首先，我们算出$worst[u]$，表示点$u$的一条出边断掉后，从$u$到终点所走的最短距离的最大值。由于数据范围小，可以暴力处理。然后，令$dp[u]$表示从点$u$到终点在最坏情况下走的最短距离，可得出状态转移方程$dp[u]=max(worst[u],min\{dp[v]+length[u][v]\})$。可是给出的图不一定是$DAG$，所以$DP$可能有后效性。所以我们使用最短路更新$dp$。具体处理方法见代码。

#include <cstdio>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <iostream>
using namespace std;
const int maxn = 105;
const int maxm = 1005;
struct WarTransportation {
    bool vis[maxn];
    int n, dist[maxn], bad[maxn];
    int tot, ter[maxm], nxt[maxm], wei[maxm], lnk[maxn];
    int max(int a, int b) {
        return a > b ? a : b;
    }
    int min(int a, int b) {
        return a < b ? a : b;
    }
    void addedge(int u, int v, int w) {
        ter[++tot] = v;
        wei[tot] = w;
        nxt[tot] = lnk[u];
        lnk[u] = tot;
    }
    int spfa0(int p, int x) {
        memset(dist, 0x3f, sizeof(dist));
        memset(vis, 0, sizeof(vis));
        queue<int> que;
        dist[p] = 0;
        vis[p] = 1;
        que.push(p);
        int u, v, w;
        while (!que.empty()) {
            u = que.front();
            que.pop();
            for (int i = lnk[u]; i; i = nxt[i]) {
                if (!(i & 1) || i == x) {
                    continue;
                }
                v = ter[i], w = wei[i];
                if (dist[v] > dist[u] + w) {
                    dist[v] = dist[u] + w;
                    if (!vis[v]) {
                        vis[v] = 1;
                        que.push(v);
                    }
                }
            }
            vis[u] = 0;
        }
        return dist[2];
    }
    void spfa1() {
        memset(dist, 0x3f, sizeof(dist));
        memset(vis, 0, sizeof(vis));
        queue<int> que;
        dist[2] = 0;
        vis[2] = 1;
        que.push(2);
        int u, v, w;
        while (!que.empty()) {
            u = que.front();
            que.pop();
            for (int i = lnk[u]; i; i = nxt[i]) {
                if (i & 1) {
                    continue;
                }
                v = ter[i], w = wei[i];
                if (dist[v] > max(bad[v], dist[u] + w)) {
                    dist[v] = max(bad[v], dist[u] + w);
                    if (!vis[v]) {
                        vis[v] = 1;
                        que.push(v);
                    }
                }
            }
            vis[u] = 0;
        }
    }
    int messenger(int m, vector<string> vs) {
        n = m;
        tot = 0;
        memset(lnk, 0, sizeof(lnk));
        string s;
        for (int i = 0; i < vs.size(); i++) {
            s += vs[i];
        }
        int x[3], cur = 0, val = 0;
        for (int i = 0; i < s.size(); i++) {
            if (s[i] == ',') {
                x[2] = val;
                addedge(x[0], x[1], x[2]);
                addedge(x[1], x[0], x[2]);
                cur = val = 0;
            } else if (s[i] == ' ') {
                x[cur++] = val;
                val = 0;
            } else {
                val = val * 10 + s[i] - '0';
            }
        }
        x[2] = val;
        addedge(x[0], x[1], x[2]);
        addedge(x[1], x[0], x[2]);
        memset(bad, 0, sizeof(bad));
        for (int u = 1; u <= n; u++) {
            if (u == 2) {
                continue;
            }
            for (int i = lnk[u]; i; i = nxt[i]) {
                if (!(i & 1)) {
                    continue;
                }
                bad[u] = max(bad[u], spfa0(u, i));
            }
            printf("%d%c", bad[u], " \n"[u == n]);
        }
        spfa1();
        if (dist[1] >= 0x3f3f3f3f) {
            return -1;
        } else {
            return dist[1];
        }
    }
};
#ifndef ONLINE_JUDGE
WarTransportation sample;
vector<string> vs;
string s;
int n;
int main() {
    cin >> n;
    getchar();
    getline(cin, s);
    vs.push_back(s);
    cout << sample.messenger(n, vs) << endl;
    return 0;
}
#endif