Submission #1176492

#	Time	Username	Problem	Language	Result	Execution time	Memory
1176492		prideliqueee	Birokracija (COCI18_birokracija)	C++20	100 / 100	63 ms	28740 KiB

birokracija

#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<<' ';
}

• 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: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10