oj.uz

Submission #30886

# Submission time Handle Problem Language Result Execution time Memory
30886 2017-07-30T11:04:32 Z cgiosy None (KOI16_treeM) C++14
0 / 100
 1463 ms 28456 KB 
#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.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 12960 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 12960 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Runtime error 1463 ms 28456 KB Execution timed out (wall clock limit exceeded)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 12960 KB Output isn't correct
2 Halted 0 ms 0 KB -