[BZOJ1880][SDOI2009]Elaxia的路线（SPFA+拓扑排序+DP）

首先，分别以$x1,y1,x2,y2$为源点分别跑$4$次SPFA，记$dis<x,y>$为$x$到$y$的最短路，$val<x,y>$为边 <x,y> <script type="math/tex" id="MathJax-Element-4053"> </script>的权值。
跑完最短路后，构建出一个新的有向图，只包含 $x1$到 $y1$的最短路。
判断一条边 <x,y> <script type="math/tex" id="MathJax-Element-4056"> </script>是否在最短路上很简单，即判断是否满足：
$dis<x1,x>+val<x,y>+dis<y1,y>=dis<x1,y1>$。
然后在新图上标记出在 $x2$到 $y2$的最短路径上的边，判断方法也一样，但要注意细节：对于一条边 $(x,y)$，它在 $x2$到 $y2$的最短路径上，可能是从 $x$走到$y$，也可能是从 $y$走到$x$，所以要分别判断是否满足：
1、 $dis<x2,x>+val<x,y>+dis<y2,y>=dis<x2,y2>$
2、 $dis<x2,y>+val<y,x>+dis<y2,x>=dis<x2,y2>$
然后，在新图上按照拓扑序进行DP。设 $f[x]$为 $x1$到 $x$的最短路径与$x2$到 $y2$的最短路径的最长公共路径长度，然后转移就能得出来了。
代码：

#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
inline int read() {
    int res = 0; bool bo = 0; char c;
    while (((c = getchar()) < '0' || c > '9') && c != '-');
    if (c == '-') bo = 1; else res = c - 48;
    while ((c = getchar()) >= '0' && c <= '9')
        res = (res << 3) + (res << 1) + (c - 48);
    return bo ? ~res + 1 : res;
}
const int N = 1505, M = 1e6 + 5, INF = 0x3f3f3f3f;
int n, m, X1, Y1, X2, Y2, ecnt0, nxt0[M], adj0[N], go0[M], val0[M], from0[M],
ecnt, nxt[M], adj[N], go[M], val[M], len, que[N * 10], dis[6][N], sol[N],
cnt[N], im[M]; bool vis[N];
void add_edge0(int u, int v, int w) {
    nxt0[++ecnt0] = adj0[u]; adj0[u] = ecnt0;
    from0[ecnt0] = u; go0[ecnt0] = v; val0[ecnt0] = w;
}
void add_edge(int u, int v, int w, bool x) {
    nxt[++ecnt] = adj[u]; adj[u] = ecnt;
    go[ecnt] = v; val[ecnt] = w; im[ecnt] = x;
}
void spfa(int st, int I) {
    int i; que[len = 1] = st; memset(dis[I], INF, sizeof(dis[I]));
    dis[I][st] = 0; for (i = 1; i <= len; i++) {
        int u = que[i]; vis[u] = 0;
        for (int e = adj0[u], v; e; e = nxt0[e])
            if (dis[I][u] + val0[e] < dis[I][v = go0[e]]) {
                dis[I][v] = dis[I][u] + val0[e];
                if (!vis[v]) vis[que[++len] = v] = 1;
            }
    }
}
void init() {
    int i; for (i = 1; i <= ecnt0; i++)
        if (dis[1][from0[i]] + val0[i] + dis[2][go0[i]] == dis[1][Y1]) {
            if (dis[3][from0[i]] + val0[i] + dis[4][go0[i]] == dis[3][Y2]
            || dis[4][from0[i]] + val0[i] + dis[3][go0[i]] == dis[3][Y2])
                add_edge(from0[i], go0[i], val0[i], 1);
            else add_edge(from0[i], go0[i], val0[i], 0);
            cnt[go0[i]]++;
        }
}
void solve() {
    int H = 0, T = 1; que[1] = X1;
    while (H < T) {
        int u = que[++H];
        for (int e = adj[u], v; e; e = nxt[e]) {
            if (!(--cnt[v = go[e]])) que[++T] = v;
            sol[v] = max(sol[v], sol[u] + val[e] * im[e]);
        }
    }
}
int main() {
    int i, x, y, z; n = read(); m = read();
    X1 = read(); Y1 = read(); X2 = read(); Y2 = read();
    for (i = 1; i <= m; i++) {
        x = read(); y = read(); z = read();
        add_edge0(x, y, z); add_edge0(y, x, z);
    }
    spfa(X1, 1); spfa(Y1, 2); spfa(X2, 3); spfa(Y2, 4);
    printf("%d\n", (init(), solve(), sol[Y1]));
    return 0;
}