oj.uz

Submission #649862

# Submission time Handle Problem Language Result Execution time Memory
649862 2022-10-11T13:18:45 Z inksamurai Birokracija (COCI18_birokracija) C++17
100 / 100
 134 ms 26016 KB 
#include <bits/stdc++.h>
#define int ll
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3yqVz8E ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e

signed main(){
_3yqVz8E;
	int n;cin>>n;
	vec(vi) adj(n);
	rng(i,1,n){
		int _par;
		cin>>_par;
		_par-=1;
		adj[_par].pb(i);
		adj[i].pb(_par);
	}
	vi pns(n);
	auto dfs=[&](auto self,int v,int par)->int{
		int now=0;
		for(auto u:adj[v]){
			if(u==par) continue;
			now+=self(self,u,v);
			pns[v]+=pns[u];
		}
		pns[v]+=now+1;
		return now+1;
	};
	dfs(dfs,0,-1);
	rep(i,n)cout<<pns[i]<<" ";
	print();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 364 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1756 KB Output is correct
2 Correct 8 ms 2260 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 5616 KB Output is correct
2 Correct 21 ms 5604 KB Output is correct
3 Correct 20 ms 6668 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 15556 KB Output is correct
2 Correct 61 ms 17120 KB Output is correct
3 Correct 59 ms 26016 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 15556 KB Output is correct
2 Correct 70 ms 15992 KB Output is correct
3 Correct 63 ms 18060 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 15316 KB Output is correct
2 Correct 66 ms 16296 KB Output is correct
3 Correct 78 ms 19776 KB Output is correct