# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
976649 | eysbutno | Regions (IOI09_regions) | C++17 | 3804 ms | 34676 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 main() {
int n, r, q;
cin >> n >> r >> q;
vector<int> region(n);
cin >> region[0];
--region[0];
vector<vector<int>> adj(n);
for (int i = 1; i < n; i++) {
int p, h;
cin >> p >> h;
--p, --h;
adj[p].push_back(i);
region[i] = h;
}
// Calculating Euler tour indices.
vector<int> tin(n), tout(n), mp(n);
vector<vector<int>> comp(r);
int timer = 0;
function<void(int)> tour = [&](int u) -> void {
tin[u] = timer++;
mp[tin[u]] = u;
comp[region[u]].push_back(tin[u]);
for (int v : adj[u]) {
tour(v);
}
tout[u] = timer;
};
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |