无根树转有根树

直接上代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
#include<bits/stdc++.h>
using namespace std;
#define LOCAL
#define ll long long int
#define inf 0x3f3f3f3f
#define mset(a,b) memset(a,b,sizeof(a))
const int maxn=1e5+5;
vector<int> g[maxn];
int n;
int p[maxn];
void dfs(int u,int fa){
int d=g[u].size();
for(int i=0;i<d;i++){
int v=g[u][i];
if(v!=fa)
dfs(v,p[v]=u);
}
}
void solve(){
int u,v;
scanf("%d",&n);
mset(p,-1);
for(int i=0;i<n;i++){
scanf("%d%d",&u,&v);
g[u].push_back(v);
g[v].push_back(u);
}
int x;//指定root
scanf("%d",&x);
dfs(x,-1);
}
int main(){
#ifdef LOCAL
freopen("in.in","r",stdin);
#endif
solve();
return 0;
}
Author: universal42
Link: https://universal4s.github.io/2019/03/19/no-root-tree-to-root-tree/
Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.