Submission #857395

#	Time	Username	Problem	Language	Result	Execution time	Memory
857395		mychecksedad	Beech Tree (IOI23_beechtree)	C++17	0 / 100	2 ms	4956 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;


vector<array<int, 2>> g[N];
vector<int> ans;


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

	bool ok = 1;
	for(int i = n - 1; i >= 0; --i){
		if(!ok) ans[i] = 0;
		else{
			if(i < n - 1 && C[i] != C[i + 1]) ok = 0, ans[i] = 0;
			else ans[i] = 1;
		}
	}

	return ans;
}	

• 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