#include "beechtree.h"
#include<bits/stdc++.h>

using namespace std;

typedef int ll;

vector<ll> beechtree(ll n, ll m, vector<ll> p, vector<ll> c) {
	vector<vector<ll>> sons(n);
	for (ll i = 1; i < n; i++) {
		sons[p[i]].push_back(i);
	}
	vector<ll> ans(n, 0);
	ans[n - 1] = 1;
	ans[n - 2] = 1;
	for (ll i = n - 3; i >= 0; i--) {
		if (c[i + 2] != c[i + 1]) {
			break;
		}
		ans[i] = 1;
	}
	return ans;
	for (ll i = 0; i < n; i++) {
		set<tuple<ll, ll, ll>> s;
		s.insert(make_tuple(-((ll)sons[i].size()), -1, i));
		bool b = true;
		map<ll, ll> ncol;
		ll nnum = 0;
		while (!s.empty()) {
			auto[_, need, i] = *s.begin();
			s.erase(s.begin());
			if (need != -1) {
				if (ncol[c[i]] != need) {
					b = false;
					break;
				}
				ncol[c[i]]++;
			}
			for (auto j : sons[i]) {
				s.emplace(-((ll)sons[j].size()), nnum, j);
			}
			nnum++;
		}
		if (b) {
			ans[i] = 1;
		}
	}
	return ans;
}