Submission #1066978

#	Time	Username	Problem	Language	Result	Execution time	Memory
1066978		pcc	Beech Tree (IOI23_beechtree)	C++17	0 / 100	17 ms	30704 KiB

beechtree

#include "beechtree.h"
#include <bits/stdc++.h>
using namespace std;

#define pii pair<int,int>
#define fs first
#define sc second

const int mxn = 2e5+10;

pii par[mxn];
vector<pii> tree[mxn];
vector<int> col[mxn];
vector<int> sub[mxn];
vector<int> ans;
int cnt[mxn];

void dfs(int now){
	memset(cnt,0,sizeof(cnt));
	sub[now].push_back(now);
	for(auto [nxt,w]:tree[now]){
		dfs(nxt);
		for(auto &i:sub[nxt])sub[now].push_back(i);
	}
	vector<int> v = sub[now];
	sort(v.begin()+1,v.end());

	if(v.size() == 1)ans[now] = 1;
	else ans[now] = 0;

	do{
		bool flag = true;
		for(int i = 1;i<v.size();i++){
			int tmp = v[i];
			auto [p,w] = par[tmp];
			int num = cnt[w];
			if(v[num] != p)flag = false;
			cnt[w]++;
		}
		if(flag)ans[now] = 1;
	}while(next_permutation(v.begin()+1,v.end()));
	return;
}


std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C){
	ans = vector<int>(N,1);
	for(int i = 1;i<N;i++){
		int p = P[i];
		tree[p].push_back(pii(i,C[i]));
		par[i] = pii(p,C[i]);
		col[C[i]].push_back(p);
	}
	dfs(0);
	return ans;
}

Compilation message (stderr)

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

• Subtask 0: 0 / 0
• Subtask 1: 0 / 9
• Subtask 2: 0 / 5
• Subtask 3: 0 / 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