提供新颖的64ptsWA法

123456789101112131415161718192021int vis[N], dis[N], cur[N];
bool SPFA(int s, int t) {
	memset(dis, 0x3f, sizeof dis); // 你好
	memset(vis, 0, sizeof vis);
	queue<int> q; q.push(s); vis[s] = 1, dis[s] = 0;
	while (q.size()) {
		int u = q.front(); q.pop();
		vis[u] = 0;
		for (int i = head[u]; i; i = e[i].nxt) {
			int v = e[i].to;
			if (dis[v] > dis[u] + e[i].c && e[i].w > 0) {
				dis[v] = dis[u] + e[i].c;
				if (!vis[v]) {
					vis[v] = 1;
					q.push(v);
				}
			}
		}
	}
	return dis[t] < 0x3f3f3f3f;
}