Submission #1018508

#	Time	Username	Problem	Language	Result	Execution time	Memory
1018508		vjudge1	Birokracija (COCI18_birokracija)	C++17	70 / 100	99 ms	16660 KiB

birokracija

#include <bits/stdc++.h>

using namespace std;

const int M = 2e5 + 1;

int subt[M],ans[M];
vector<int> nei[M];

void dfs(int u)
{
	subt[u]=1;
	for (int i:nei[u])
	{
		dfs(i);
		ans[u]+=ans[i];
		subt[u]+=subt[i];
	}
	ans[u]+=subt[u];
}

int main()
{
	int n;
	cin>>n;
	for (int i=2;i<=n;i++)
	{
		int u;
		cin>>u;
		nei[u].push_back(i);
	}
	dfs(1);
	for (int i=1;i<=n;i++)
		cout<<ans[i]<<' ';
	cout<<endl;
	
	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10