-
Notifications
You must be signed in to change notification settings - Fork 1
/
Tree Distances I.cpp
88 lines (79 loc) · 1.92 KB
/
Tree Distances I.cpp
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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include<bits/stdc++.h>
using namespace std;
#define INF 2047483647
#define INFL 9223372036854775807
#define ll long long
#define pii pair<int,int>
#define pII pair<ll,ll>
#define vi vector<int>
#define vii vector<pii>
#define vI vector<ll>
#define VII vector<pII>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define ull unsigned long long
#define M 1000000007
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL);
#define take(x) scanf("%d",&x)
#define DE(x) printf("\ndebug %d\n",x);
#define vout(x) for(int i=0;i<x.size();i++) printf("%d ",x[i]);
#define pie acos(-1)
#define MOD 998244353
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int my_rand(int l, int r){return uniform_int_distribution<int>(l,r) (rng);}
int Set(int N,int pos){return N=N | (1<<pos);}
int reset(int N,int pos){return N= N & ~(1<<pos);}
bool check(int N,int pos){return (bool)(N & (1<<pos));}
const int maxn = 2e5+5;
vector<int> adj[maxn];
int disa[maxn],disb[maxn];
int mxDis = 0;
int Left,Right;
void dfs(int u,int height){
disa[u] = height;
if( height>mxDis ) {
mxDis = height;
Left = u;
}
for(auto v:adj[u]){
if( disa[v] == 0 )
dfs(v,height+1);
}
}
void dfs2(int u,int height){
disa[u] = height;
if( height>mxDis ) {
mxDis = height;
Right = u;
}
for(auto v:adj[u]){
if( disa[v] == 0 )
dfs2(v,height+1);
}
}
void dfs3(int u,int height){
disb[u] = height;
for(auto v:adj[u]){
if( disb[v] == 0 )
dfs3(v,height+1);
}
}
int main(){
int n;
cin>>n;
for(int i=0;i<n-1;i++){
int a,b;
cin>>a>>b;
adj[a].pb(b);
adj[b].pb(a);
}
dfs(1,1); mxDis = 0; fill(disa,disa+n+1,0);
dfs2(Left,1);
dfs3(Right,1);
//DE(Left); DE(Right)
for(int i=1;i<=n;i++){
cout<<max(disa[i],disb[i])-1<<" ";
}
}