#include<bits/stdc++.h> #include"incursion.h" using namespace std; #define inf (int)2e9 #define nl '\n' const int N = 45001; vector<int> g[N]; int p[N]; int n; vector<int> mark(vector<pair<int, int>> e, int x){ n = e.size()+1; return vector<int>(n); } void dfs(int v){ for(int ch : g[v]){ if(ch != p[v]){ p[ch] = v; dfs(ch); } } } void locate(vector<pair<int, int>> e, int x, int t){ for(auto [a, b] : e){ g[a].push_back(b); g[b].push_back(a); } int f; for(int i = 1; i <= n; i++){ if(g[i].size() == 2){ dfs(i); f = i; break; } } while(x != f){ visit(p[x]); x = p[x]; } return; }