# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
955149 | uped | Regions (IOI09_regions) | C++14 | 3534 ms | 60956 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>
#define DEBUG(x) cout << #x << ": " << x << '\n';
using namespace std;
using ll = long long;
const int N = 2e5;
const int R = 25001;
vector<int> adj[N];
int region[N];
int timer = 0;
int tin[N];
int tout[N];
vector<int> region_tin[R];
vector<int> region_nodes[R];
int region_size[R];
void tour(int n, int p = -1) {
tin[n] = timer++;
region_tin[region[n]].push_back(tin[n]);
for (int x : adj[n]) {
if (x == p) continue;
tour(x, n);
}
tout[n] = timer++;
}
map<pair<int, int>, int> precalc_ans;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |