【bzoj1576】[Usaco2009 Jan]安全路经Travel

给一张无向图，1号点到i号点的最短路唯一，求1到i不经过原最短路最后一条边的最短距离。n <= 100000

由于最短路唯一，先求最短路径树，考虑非树边uv，它能使uv以上，lca以下的点多一种路径，长度为dis[u] + dis[v] + edge[i] - dis[x]。我们令这条非树边的值为val[i] = dis[u] + dis[v] + edge[i]，我们只需对每个x，找出最小的val。可以先按val排序，然后使用并查集压缩路径即可。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#define Rep(i, x, y) for (int i = x; i <= y; i ++)
#define Dwn(i, x, y) for (int i = x; i >= y; i --)
#define RepE(i, x) for(int i = pos[x]; i; i = g[i].nex)
using namespace std;
typedef long long LL;
const int M = 200005;
priority_queue< pair<int, int> > q;
struct Edge { int y, nex, z; } g[M * 2];
struct arr { int x, y, z; } b[M];
int n, m, X[M], Y[M], Z[M], fa[M], dis[M], pos[M], sz, qz, h[M], ans[M], bz; bool vis[M];
void Init(int x, int y, int z) { g[++ sz] = (Edge) { y, pos[x], z }, pos[x] = sz; }
int Serc(int x) { if (h[x]) return h[x]; return Serc(fa[x]) + 1;  }
int Find(int x, int y) {
    if (x == y) return x;
    if (h[x] < h[y]) swap(x, y);
    if (!ans[x]) ans[x] = qz - dis[x];
    return fa[x] = Find(fa[x], y);
}
bool cmp(arr x, arr y) { return x.z < y.z; }
int main()
{
    scanf ("%d%d", &n, &m);
    Rep(i, 1, m) {
        int x, y, z; scanf ("%d%d%d", &x, &y, &z);
        X[i] = x, Y[i] = y, Z[i] = z;
        Init(x, y, z), Init(y, x, z);
    }
    q.push( make_pair(0, 1) );
    Rep(i, 2, n) dis[i] = 1 << 29;
    while (!q.empty()) {
        int x = (q.top()).second; q.pop();
        if (vis[x]) continue; vis[x] = 1;
        RepE(i, x) {
            // cout << x << endl;
            int y = g[i].y;
            if (dis[y] > dis[x] + g[i].z) {
                dis[y] = dis[x] + g[i].z; q.push( make_pair(-dis[y], y) ), fa[y] = x;
            }
        }
    } // puts("fin");
    h[1] = 1; Rep(i, 2, n) h[i] = Serc(i) + 1;
    Rep(i, 1, m) {
        int x = X[i], y = Y[i], z = Z[i];
        if (dis[x] > dis[y]) swap(x, y);
        if (dis[x] + z == dis[y]) continue ;
        b[++ bz] = (arr) { x, y, dis[x] + dis[y] + z };
    }
    sort(b+1, b+bz+1, cmp);
    Rep(i, 1, bz) {
        int x = b[i].x, y = b[i].y;
        qz = b[i].z; Find(x, y);
    }
    Rep(i, 2, n) {
        if (!ans[i]) puts("-1");
        else printf("%d\n", ans[i]);
    }
 
    return 0;
}