#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define int long long
vector<int> ad[200010];
int n;
pair<int,int> ans[200010];
void dfs(int u,int w)
{
ans[u].f=1;
ans[u].s=1;
for(auto x:ad[u])
{
dfs(x,w+1);
ans[u].f+=ans[x].f+ans[x].s;
ans[u].s+=ans[x].s;
}
}
signed main()
{
cin>>n;
for(int i=2;i<=n;i++)
{
int p;
cin>>p;
ad[p].push_back(i);
}
dfs(1,1);
for(int i=1;i<=n;i++)
cout<<ans[i].f<<' ';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |