图上倍增
在一个有向图、无向图上进行倍增。一般设数组 G [ i ] [ j ] [ k ] G[i][j][k] G[i][j][k],表示是否有从 i → j i \to j i→j的路径,且路径的长度为 2 k 2^k 2k.
更新方法:
最外层枚举 k k k,内层枚举点对 i , j i,j i,j,最内层枚举中间点 t t t,使得 G [ i ] [ j ] [ k ] = G [ i ] [ t ] [ k − 1 ] A N D G [ t ] [ j ] [ k − 1 ] G[i][j][k] = G[i][t][k-1] AND G[t][j][k-1] G[i][j][k]=G[i][t][k−1]ANDG[t][j][k−1]。
例题
做一次图上倍增,然后做最短路即可。
#include <bits/stdc++.h>
using namespace std;
#define FR freopen("in.txt", "r", stdin)
#define FW freopen("out.txt", "w", stdout)
#define MAXT 10000
typedef long long ll;
bool G[55][55][65]; // 倍增数组
int dis[55][55]; // 邻接矩阵
int n, m;
int main()
{
scanf("%d %d", &n, &m);
memset(dis, MAXT, 55 * 55 * sizeof(int));
for (int i = 0; i < m; i++)
{
int u, v;
scanf("%d %d", &u, &v);
G[u][v][0] = true;
dis[u][v] = 1;
}
// 倍增
for (int k = 1; k < 65; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
for (int t = 1; t <= n; t++)
{
G[i][j][k] = G[i][j][k] || (G[i][t][k - 1] && G[t][j][k - 1]);
if (G[i][j][k])
dis[i][j] = 1;
}
// Floyd SP
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
{
dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
}
printf("%d", dis[1][n]);
return 0;
}