Submission #886867

#	Time	Username	Problem	Language	Result	Execution time	Memory
886867		vjudge1	Birokracija (COCI18_birokracija)	C++17	100 / 100	48 ms	38740 KiB

birokracija

#include <bits/stdc++.h>
using namespace std;
#define sp << " " << 
#define int long long
#define vi vector<int>
#define F(xxx,yyy) for (int xxx=1;xxx<=yyy;xxx++)
#define pii pair<int,int>
#define pb push_back
const int N = 5e5+1;
const int inf = 1e9+1;
const int MOD = 1e9+7;
vi edges[N],sz(N),dp(N);


void dfs(int node) {
  for (auto it : edges[node]) dfs(it);
  int ans = 1;
  sz[node] = 1;
  for (auto it : edges[node]) {
    ans+=dp[it]+sz[it];
    sz[node]+=sz[it];
  }
  dp[node] = ans;
}

void solve() {  
  int n;
  cin >> n;
  for (int i=2;i<=n;i++) {
    int p;
    cin >> p;
    edges[p].pb(i);
  }
  dfs(1);
  F(i,n) cout << dp[i] << " ";
  cout << endl;
} 
    
                  
                             
signed main() { 
  ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  #ifdef Local
  freopen("in","r",stdin);
  freopen("out","w",stdout); 
  #endif
  int t = 1;
  //cin >> t;
	F(i,t) solve();
}

• 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