CPPCodeSnippets/cses-distances-2.cpp at master · rnagasudhakar/CPPCodeSnippets · GitHub

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
#include<bits/stdc++.h>
using namespace std;
#define ll long long

void dfs(vector<vector<ll>>&graph, ll sou, ll par,vector<ll>&in,vector<ll>&children){
	for(auto it:graph[sou]){
		if(it!=par){
			dfs(graph,it,sou,in,children);
			in[sou] += in[it];
			children[sou]+=children[it];
		}
	}
	in[sou]+=children[sou];
	children[sou]+=1;
}

void dfs2(vector<vector<ll>>&graph, ll sou, ll par,vector<ll>&out,vector<ll>&in,vector<ll>&children, ll x){
	ll val = in[sou];
	for(auto it:graph[sou]){
		if(it!=par){
			out[it]+=val;
			out[it]-=in[it];
			out[it]+=out[sou];
			ll temp = x-children[it];
			out[it]-=children[it];
			out[it]+=temp;
			dfs2(graph,it,sou,out,in,children,x);
		}
	}

}

int main(){
	ll x;
	cin>>x;
	vector<vector<ll>>graph(x);
	for(int i=0;i<x-1;i++){
		ll sou,des;
		cin>>sou>>des;
		sou--;
		des--;
		graph[sou].push_back(des);
		graph[des].push_back(sou);
	}
	vector<ll>in(x,0);
	vector<ll>children(x,0);
	vector<ll>out(x,0);
	dfs(graph,0,-1,in,children);
	dfs2(graph,0,-1,out,in,children,x);
	for(int i=0;i<x;i++){
		cout<<in[i]+out[i]<<" ";
	}

	return 0;
}