Submission #144448

#	Time	Username	Problem	Language	Result	Execution time	Memory
144448		Ort	Birokracija (COCI18_birokracija)	C++11	70 / 100	214 ms	20032 KiB

birokracija

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/rope>
#define MEM(a, b) memset(a, (b), sizeof(a))
#define ALL(c) (c).begin(),(c).end()
#define sz(a) ((int)(a.size()))
#define ll long long
#define LINF (ll)1e18
#define INF (int)1e9
#define MINF 0x3F3F3F3F
#define pb push_back
#define fs first
#define sc second
#define mp make_pair
#define MOD 1000000007
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAX 200005
#define watch(x) cerr<<#x<<" = "<<(x)<<endl;

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

template<class T> using indexed_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

int n;
int arr[MAX], c[MAX];
vector<int> adj[MAX];
 
void dfs1(int s, int p) {
	c[s] = 1;
	for(auto u:adj[s]) {
		if(u==p) continue;
		dfs1(u, s);
		c[s] += c[u];
	}
}

void dfs2(int s, int p) {
	for(auto u:adj[s]) {
		if(u==p) continue;
		dfs2(u, s);
		c[s] += c[u];
	}
}

int main() {
	cin >> n;
	for(int i=2;i<=n;i++) cin >> arr[i];
	for(int i=2;i<=n;i++) {adj[arr[i]].push_back(i);adj[i].push_back(arr[i]);}
	dfs1(1, 0); dfs2(1, 0);
	for(int i=1;i<=n;i++) cout << c[i] << " ";
	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: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10