Submission #857558

#	Time	Username	Problem	Language	Result	Execution time	Memory
857558		mychecksedad	Beech Tree (IOI23_beechtree)	C++17	14 / 100	100 ms	75424 KiB

beechtree

#include <beechtree.h>
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) x.begin(), x.end()
const int N = 2e5+100;

int sz[N], dep[N], par[N], n, max_dep[N];
vector<array<int, 2>> g[N];
vector<array<int, 3>> s[N];
vector<int> ans, COL, is_full;
set<int> C[N];

void dfs(int v){
	ans[v] = 1;
	sz[v] = 1;
	max_dep[v] = dep[v];
	for(auto U: g[v]){
		int u = U[0], c = U[1];

		dep[u] = dep[v] + 1;
		par[u] = v;
		dfs(u);
		max_dep[v] = max(max_dep[v], max_dep[u]);

		sz[v] += sz[u];
		ans[v] &= ans[u];

		if(C[v].find(c) != C[v].end()) ans[v] = 0;
		C[v].insert(c);
	}
	if(ans[v] == 0) return;

	sort(all(g[v]), [&](const array<int, 2> &x, const array<int, 2> &y){
		return sz[x[0]] > sz[y[0]];
	});

	for(int i = 0; i < g[v].size(); ++i){
		int x = (i == 0 ? v : g[v][i - 1][0]), y = g[v][i][0];
		for(auto col: C[y]){
			if(C[x].find(col) == C[x].end()){
				ans[v] = 0;
				break;
			}
		}
	}

	if(ans[v] == 0) return;	

	if(g[v].size() == 0){
		is_full[v] = 1;
	}else if(g[v].size() == 1){
		is_full[v] = 0;
	}else{
		if(!is_full[g[v][0][0]]){
			ans[v] = 0;
		}
		// ans[v] &= abs(max_dep[g[v][0][0]] - max_dep[g[v][1][0]]) <= 1;
		is_full[v] = (is_full[g[v][0][0]] & is_full[g[v][1][0]]);
	}
}	

vector<int> beechtree(int nn, int m, vector<int> P, vector<int> CC){
	COL = CC;
	n = nn;
	for(int i = 1; i < n; ++i){
		g[P[i]].pb({i, COL[i]});
	}
	ans.resize(n);
	is_full.resize(n);

	dep[0] = 0;
	dfs(0);

	return ans;
}	

Compilation message (stderr)

beechtree.cpp: In function 'void dfs(int)':
beechtree.cpp:38:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |  for(int i = 0; i < g[v].size(); ++i){
      |                 ~~^~~~~~~~~~~~~

• Subtask 0: 0 / 0
• Subtask 1: 0 / 9
• Subtask 2: 5 / 5
• Subtask 3: 9 / 9
• Subtask 4: 0 / 8
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 12
• Subtask 8: 0 / 17
• Subtask 9: 0 / 12