Submission #30886

#	Time	Username	Problem	Language	Result	Execution time	Memory
30886		cgiosy	트리 (KOI16_treeM)	C++14	0 / 100	1463 ms	28456 KiB

tree

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

int n, q, a, b, c, d, x, k;
struct {int p; int r; set<int> c;} t[200010];

void f(int i)
{
	t[i].r = k;

	for(int j : t[i].c)
		f(j);
}

int main()
{
	cin >> n >> q;

	t[1].p = t[1].r = 1;

	for(int i = 2; i <= n; i++)
	{
		cin >> a;
		t[i].p = a;
		t[i].r = 1;
		t[a].c.insert(i);
	}

	for(int i = 0; i < q; i++)
	{
		cin >> b >> c >> d;
		x = (t[b].r == t[c].r);

		puts(x ? "YES" : "NO");

		if(d)
		{
			k = x ? b : c;
			t[t[k].p].c.erase(k);
			f(k);
		}
	}
}

• Subtask 1: 0 / 22
• Subtask 2: 0 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 29