# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
75857 | chunghan | 트리 (KOI16_tree) | C++14 | 2073 ms | 66560 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<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
int n, q, par[200001], set[200001], b, c, d;
vector<int> chi[200001];
void r(int p, int c) {
int i;
for(i = 0; i < chi[p].size(); i++)
if(chi[p][i] == c) break;
if(i < chi[p].size()) chi[p].erase(chi[p].begin() + i);
}
void f(int a, int p) {
set[a] = p;
for(int i = 0; i < chi[a].size(); i++) {
f(chi[a][i], p);
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> q;
set[1] = 1;
for(int i = 2; i <= n; i++) {
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... |