一张有向图,有k个公交车,每个公交车从si到ti,随机选一条最短路走,求最坏情况从S到T要搭乘几次公交。n <= 100
我们记录用k次可以走到T的城市,第k+1此只需对每条线路拓扑dp一下,注意只能在割点上车。O(n^4) 可以AC
有一个O(n^3)的做法(未验证),假如是一个DAG,显然不用枚举k,拓扑一遍即可,用f[i][j]表示点i在公交线路j上的最少次数,h[i]表示从点i的最少次数。有拓扑到强联通分量时,将分量里的点按h排序,依次处理。
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#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 N = 105;
int n, m, p, S, T, a[N][N], b[N][N], s[N], t[N], que[N * N], hd, tl, d[N], f[N][N], in[N];
int main()
{
scanf ("%d%d%d%d", &n, &m, &S, &T);
Rep(i, 1, n) Rep(j, i + 1, n) a[i][j] = a[j][i] = m + 1;
Rep(i, 1, m) {
int x, y;
scanf ("%d%d", &x, &y), a[x][y] = b[x][y] = 1;
}
Rep(k, 1, n) {
Rep(i, 1, n) {
Rep(j, 1, n) if (i != j) {
int k0 = a[i][k] + a[k][j], k1 = b[i][k] * b[k][j];
if (a[i][j] > k0) a[i][j] = k0, b[i][j] = k1;
else if (a[i][j] == k0) b[i][j] += k1;
}
}
}
scanf("%d", &p);
Rep(i, 1, p) {
scanf ("%d%d", &s[i], &t[i]);
}
f[0][T] = 1;
Rep(k, 1, n) {
Rep(i, 1, n) f[k][i] = f[k - 1][i];
Rep(i, 1, p) {
que[hd = tl = 1] = t[i];
int mind = a[ s[i] ][ t[i] ];
if (mind > m) continue ;
Rep(x, 1, n) d[x] = 1; d[ t[i] ] = 0;
while (hd <= tl) {
int y = que[hd ++];
if (d[y] && (b[ s[i] ][y] * b[y][ t[i] ] == b[ s[i] ][ t[i] ] || y == s[i])) f[k][y] = 1;
d[y] = max(d[y], f[k - 1][y]);
Rep(x, 1, n) if (a[x][y] == 1 && a[s[i]][x] + a[y][t[i]] + 1 == mind) {
d[x] = min(d[x], d[y]);
if (!in[x]) que[++ tl] = x, in[x] = 1;
}
in[y] = 0;
}
}
if (f[k][S]) { printf("%d\n", k); return 0 ; }
}
puts("-1");
return 0;
}