P1613 跑路(倍增+最短路)

跑路 - 洛谷https://www.luogu.com.cn/problem/P1613

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))

int n, m;
//int head[MAXN];
//int nxt[MAXN];
//int ver[MAXN];
bool g[100][100][100];
//int cnt;
int d[100][100];
#if 0
inline void add(int x, int y) {
	ver[++cnt] = y;
	nxt[cnt] = head[x];
	head[x] = cnt;
}
#endif

inline void solve() {
	for (int k = 1; k <= 64; k++) {
		for (int t = 1; t <= n; t++) {
			for (int i = 1; i <= n; i++) {
				for (int j = 1; j <= n; j++) {
					if (g[i][t][k - 1] && g[t][j][k - 1]){
						g[i][j][k] = true;
						d[i][j]=1;
					}
				}
			}
		}
	}
}

inline void floyd() {
	for (int k = 1; k <= n; k++) {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
			}
		}
	}
	printf("%d", d[1][n]);
}

int main() {
	memset(d, 0x3f, sizeof(d));
	int x, y;
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= m; i++) {
		scanf("%d %d", &x, &y);
		//	add(x, y);
		d[x][y] = 1;
		g[x][y][0] = true;
	}
	solve();
	floyd();
	return 0;
}