# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
30885 | cgiosy | 트리 (KOI16_tree) | C++14 | 26 ms | 12960 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int n, m, 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, m = n + q; 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[k].c.erase(t[k].p);
f(k);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |