Submission #1018477

#	Time	Username	Problem	Language	Result	Execution time	Memory
1018477		vjudge1	Birokracija (COCI18_birokracija)	C++17	100 / 100	65 ms	30116 KiB

birokracija

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
const int N = 2e5+5;
ll ans[N], sz[N];
vector<int> child[N];

void dfs(int v)
{
  sz[v] = 1;
  for(int u : child[v])
    {
      dfs(u);
      ans[v] += ans[u];
      sz[v] += sz[u];
    }
  ans[v] += sz[v];
}

int main()
{
  int n;
  cin >> n;
  for(int i = 2; i <= n; i ++)
    {
      int x;
      cin >> x;
      child[x].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: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10