# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
734687 | tch1cherin | Homework (CEOI22_homework) | C++17 | 595 ms | 319684 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;
vector<vector<int>> g;
vector<int> t, l, r;
int n = 0;
void DFS(int u) {
l[u] = n, r[u] = 1;
vector<int> same, adj;
for (int v : g[u]) {
if (t[v] == t[u]) {
same.push_back(v);
} else {
adj.push_back(v);
}
}
while (!same.empty()) {
int x = same.back();
same.pop_back();
for (int v : g[x]) {
if (t[v] == t[u]) {
same.push_back(v);
} else {
adj.push_back(v);
}
}
}
g[u] = adj;
for (int v : g[u]) {
# | 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... |