CodeForces 131D Subway (dfs)

题意：n个点，n条边，无向图，求每个点到环的距离。

题解：dfs
n条边，那么必然只存在一个环。

考虑dfs找环，vis记录是否访问，若访问两次，则该点一定在环上，path记录路径即可。

输出距离的话也是dfs就行了，本来还想记忆化一下，结果写搓了，直接对每个点dfs到环截止就行了，不会t。

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<fstream>
#include<set>
#include<map>
#include<sstream>
#include<iomanip>
#define ll long long
using namespace std;
const int MAXN = 10010;//点数
const int MAXM = 10010;//边数
struct Edge {
    int to, next;
}edge[MAXM];
int head[MAXN], tot;
void addedge(int u, int v) {
    edge[tot].to = v; edge[tot].next = head[u]; head[u] = tot++;
}

void init() {
    tot = 0;
    memset(head, -1, sizeof(head));
}
bool vis[MAXN];
int flag, path[MAXN];
void dfs(int x, int pre) {
    vis[x] = 1;
    for (int i = head[x]; ~i; i = edge[i].next) {
        int v = edge[i].to;
        if (v == pre) continue;
        path[v] = x;
        if (vis[v]) {
            flag = v;
            return;
        }
        dfs(v, x);
        if (flag) return;
    }
}
int d[MAXN];
int res;
void dfs2(int x, int l, int pre) {
    for (int i = head[x]; ~i; i = edge[i].next) {
        int v = edge[i].to;
        if (v == pre) continue;
        /*if (d[v]) {
            res = l + d[v];
            return;
        }*/
        if (vis[v]) {
            res = l;
            return;
        }
        dfs2(v, l + 1, x);
    }
}
int n, u, v, a[MAXN];
int main() {
    init();
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%d%d", &u, &v);
        addedge(u, v);
        addedge(v, u);
    }
    dfs(1, 0);
    memset(vis, 0, sizeof(vis));
    while (!vis[flag]) {
        vis[flag] = 1;
        flag = path[flag];
    }
    for (int i = 1; i <= n; i++) {
        if (vis[i]) printf("0 ");
        else {
            dfs2(i, 1, 0);
            printf("%d ", res);
        }
    }
    return 0;
}