CF131D Subway 解题报告

CF131D Subway 解题报告

1 题目链接

传送门

2 题目大意

题目 : 地铁

题目大意 :

给定一个有n个点m条边的无向图，该无向图连通且有且仅有一个环（简单来说就是一个n个点m条边的基环树）。试求出图上每一个点离这个环的最短距离。

3 解法分析

此题应该能即刻想到大概思路。
显然，我们只需要找到环然后套用最短路模板即可。
那么$dfs+dijkstra$（$O(n^2)$）或者$dfs+SPFA$都行。
本蒟蒻这里就放代码了 （这题真的是太水了）。

4 AC Code

Dalao代码 #001

// From KrK
// Rating 2787
#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;

const int Maxn = 3005;

int n;
vector <int> neigh[Maxn];
bool taken[Maxn];
int p[Maxn];
bool found;
int dist[Maxn];
queue <int> Q;

void Get(int v)
{
	taken[v] = true;
	for (int i = 0; i < neigh[v].size() && !found; i++) {
		int u = neigh[v][i];
		if (p[v] != u)
			if (!taken[u]) { p[u] = v; Get(u); }
			else {
				do {
					dist[v] = 0; Q.push(v);
					v = p[v];
				} while (v != u);
				dist[v] = 0; Q.push(v);
				found = true;
			}
	}
}

int main()
{
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		int a, b; scanf("%d %d", &a, &b);
		neigh[a].push_back(b); neigh[b].push_back(a);
	}
	fill(dist + 1, dist + n + 1, Maxn);
	Get(1);
	while (!Q.empty()) {
		int v = Q.front(); Q.pop();
		for (int i = 0; i < neigh[v].size(); i++) {
			int u = neigh[v][i];
			if (dist[v] + 1 < dist[u]) dist[u] = dist[v] + 1, Q.push(u);
		}
	}
	for (int i = 1; i <= n; i++)
		printf("%d%c", dist[i], i + 1 <= n? ' ': '\n');
	return 0;
}

Dalao代码 #002

//https://codeforces.com/contest/131/submission/162698268
//From yh2021ZJJ
#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef pair<int,int> pii;
int n,m,idx[3005];
bool vis[3005];
vector<int> e[3005],go,cir;
bool dfs(int now,int fa){
	if(vis[now]){
		int pos=0;
		while(go[pos]!=now) pos++;
		for(int i=pos;i<go.size();i++) cir.push_back(go[i]);
		return true;
	}
	vis[now]=1;
	go.push_back(now);
	for(int i=0;i<e[now].size();i++) if(e[now][i]!=fa)
		if(dfs(e[now][i],now)) return true;
	int pos=0;
	while(go[pos]!=now) pos++;
	go.erase(go.begin()+pos);
	return false;
}
void bfs(int st){
	queue<pii> q;
	q.push({st,0});
	memset(vis,0,sizeof vis);
	vis[st]=1;
	idx[st]=0;
	while(!q.empty()){
		pii t=q.front();
		q.pop();
		for(int i=0;i<e[t.fi].size();i++){
			if(vis[e[t.fi][i]]||idx[e[t.fi][i]]<t.se+1) continue;
			vis[e[t.fi][i]]=1;
			idx[e[t.fi][i]]=t.se+1;
			q.push({e[t.fi][i],t.se+1}); 
		}
	}
}//无权边所以能bfs
int main(){
	memset(idx,0x7f,sizeof idx);
	scanf("%d",&n);
	for(int i=1,u,v;i<=n;i++){
		scanf("%d%d",&u,&v);
		e[v].push_back(u);
		e[u].push_back(v);
	}
	bool f=dfs(1,0);
	for(int i=0;i<cir.size();i++) bfs(cir[i]);
	for(int i=1;i<=n;i++) printf("%d ",idx[i]);
	return 0;
}//这可是集训队巨奆

蒟蒻代码

#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define N 3007
using namespace std;

struct node {
	int pos,dis;
	node (int x,int y) {
		pos = x, dis = y;
	}
	bool operator < (const node &x) const {
		return x.dis < dis;
	}
};

int n;
int dis[N];
vector <int> e[N];
bool vis[N], flag[N], opt1, opt2;

void dfs(int x, int t, int top) {
	flag[x] = 1;
	for (register int i = 0; i < e[x].size(); ++i) {
		register int y = e[x][i];
		if (y == t)
			continue;
		if (flag[y]) {
			if (y == top)
				opt2 = 1;
			opt1 = 1;
			return;
		}
		dfs(y, x, top);
		if (opt1)
			return;
	}
	flag[x] = 0;
}

void dijkstra() {
	priority_queue <node> q;
	fill(dis + 1, dis + 1 + n, inf);
	for (register int i = 1; i <= n; ++i) {
		if (!flag[i])
			continue;
		dis[i] = 0;
		vis[i] = 1;
		q.push(node(i, 0));
	}
	while (q.size()) {
		register int x = q.top().pos;
		q.pop();
		for (register int i = 0; i < e[x].size(); ++i) {
			register int y = e[x][i];
			if (dis[y] > dis[x] + 1) {
				dis[y] = dis[x] + 1;
				if (!vis[y])
					vis[y] = 1, q.push(node(y, dis[y]));
			} 
		}
	}
}

int main() {
	scanf("%d", &n);
	for (register int i = 1, x, y; i <= n; ++i) {
		scanf("%d%d", &x, &y);
		e[x].push_back(y);
		e[y].push_back(x);
	}
	for (register int i = 1; i <= n; ++i, opt1 = 0) {
		dfs(i, 0, i);
		if (opt2)
			break;
		fill(flag + 1, flag + 1 + n, 0);
	}
	dijkstra();
	for (register int i = 1; i <= n; ++i)
		printf("%d ", dis[i]);
	puts("");
	return 0;
}//早些时候写的题现在才想起来（码风不正很正常

5 瞎说

为什么register不能用了啊啊啊！！
苦改码风ing~