蓝桥杯 历届试题 发现环(DFS)

题目链接:http://lx.lanqiao.cn/problemset.page?code=PREV-&userid=162162

#include<bits/stdc++.h>
using namespace std;

#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=1e5+5;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
int n,x,y,flag=1,tp;
int fa[maxn],ans[maxn],cnt=0;
vector<int> g[maxn];
void dfs(int u,int pre){
    if(!flag) return ;
    if(fa[u]!=-1){
        fa[u]=pre,flag=0,tp=u;
        while(fa[u]!=tp) ans[cnt++]=fa[u],u=fa[u];
        ans[cnt++]=tp;
        sort(ans,ans+cnt);
        rep(i,0,cnt) cout<<ans[i]<<" ";puts("");
        return ;
    }
    else fa[u]=pre;
    for(int i=0;i<g[u].size()&&flag;i++){
        if(pre==g[u][i]) continue;
        dfs(g[u][i],u);
    }
}
int main(){
    cin>>n;
    rep(i,0,n){
        cin>>x>>y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    mst(fa,-1);
    dfs(1,0);
    return 0;
}