187562025-11-04 17:00:25algoproFire on a Treecpp17Wrong answer 0/100239ms40536 KiB
// UUID: 7fdef4db-a270-4cd7-9975-5fdff3603539
#include <bits/stdc++.h>
using namespace std;
const int c=2e5+10;
vector<int> adj[c];
int dp[c];
void dfs1(int cs, int p)
{
	dp[cs]=1;
	int s=0,mx=0;
	for(int &i:adj[cs])
		if(i!=p)
		{
			dfs1(i,cs);
			s+=dp[i];
			mx=max(mx,dp[i]);
		}
	dp[cs]+=s-mx;
}
int ans[c];
void dfs2(int cs, int p, int ert)
{
	int s=ert,mx=ert;
	for(int &i:adj[cs])
		if(i!=p) s+=dp[i],mx=max(mx,dp[i]);
	ans[cs]=1+s-mx;
	vector<array<int, 2>> gy{{ert,p}};
	for(int &i:adj[cs])
		if(i!=p) gy.push_back({dp[i],i});
	sort(gy.rbegin(),gy.rend());
	for(int &i:adj[cs])
	{
		if(i==p) continue;
		int tmp=s+1;
		if(i==gy[0][1]) tmp-=gy[1][0];
		else tmp-=gy[0][0];
		dfs2(i,cs,tmp);
	}
}
int main() {
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int n; cin>>n;
	for(int i=1; i<n; i++)
	{
		int a,b; cin>>a>>b;
		a++,b++;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}
	dfs1(1,0);
	dfs2(1,0,0);
	for(int i=1; i<=n; i++)
		cout<<ans[i]<<" ";
	cout<<"\n";

}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted4ms4916 KiB
2Accepted4ms5100 KiB
subtask20/35
3Wrong answer6ms5136 KiB
4Wrong answer4ms4984 KiB
5Accepted4ms5136 KiB
6Wrong answer6ms4916 KiB
7Wrong answer4ms4916 KiB
subtask30/25
8Wrong answer6ms4916 KiB
9Wrong answer6ms5172 KiB
10Accepted6ms5428 KiB
11Wrong answer7ms5368 KiB
12Wrong answer6ms5356 KiB
13Wrong answer6ms5172 KiB
subtask40/40
14Wrong answer103ms9808 KiB
15Wrong answer143ms12220 KiB
16Accepted190ms40536 KiB
17Wrong answer236ms14124 KiB
18Wrong answer238ms12852 KiB
19Wrong answer197ms13300 KiB
20Wrong answer196ms14128 KiB
21Wrong answer239ms13540 KiB
22Wrong answer172ms13120 KiB