Submission #1071472

#	Time	Username	Problem	Language	Result	Execution time	Memory
1071472		UmairAhmadMirza	Beech Tree (IOI23_beechtree)	C++17	9 / 100	29 ms	3524 KiB

beechtree

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

int const N=8;
vector<int> child[N];
vector<int> all;
set<int> ch_col[N];
vector<int> ans;
void dfs(int node){
	all.push_back(node);
	for(int i:child[node])
		dfs(i);
}
vector<int> beechtree(int n, int M, vector<int> P, vector<int> C){
	if(n>8)
		return ans;
	for (int i = 1; i < n; ++i){
		child[P[i]].push_back(i);
		ch_col[P[i]].insert(C[i]);
	}
	ans.resize(n);
	// for (int i = 0; i < n; ++i)
		// ans[i]=1;
	int gv[n]={0};
	for(int i=0;i<n;i++){
		all.clear();
		dfs(i);
		int sz=all.size();
		do{
			if(all[0]!=i)
				break;
			for (int j = 0; j < sz; ++j)
				gv[all[j]]=j;
			map<int,int> ccnt;
			bool ck=1;
			for(int j=1;j<sz;j++){
				if(gv[P[all[j]]]!=ccnt[C[all[j]]])
					ck=0;
				ccnt[C[all[j]]]++;
			}
			ans[i]|=ck;
		}while(next_permutation(all.begin(), all.end()));
	}
	return ans;
}

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