#include <bits/stdc++.h>
using namespace std;
const int nx=2e5+5;
#define ll long long
ll n, p, sz[nx], dp[nx];
vector<int> d[nx];
void dfs(int u)
{
sz[u]=dp[u]=1;
for (auto v:d[u]) dfs(v), sz[u]+=sz[v], dp[u]+=dp[v]+sz[v];
}
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n;
for (int i=2; i<=n; i++) cin>>p, d[p].push_back(i);
dfs(1);
for (int i=1; i<=n; i++) cout<<dp[i]<<' ';
}
# | 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... |