# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
651488 | tanprodium | Regions (IOI09_regions) | C++14 | 8068 ms | 50452 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;
using pii = pair<int, int>;
struct Queries {
int r1, r2;
Queries() {}
Queries(int _r1, int _r2): r1(_r1), r2(_r2) {}
};
const int N = 2e5 + 5;
const int R = 25 * 1e3 + 5;
Queries qr[N];
vector<int> id[R], reg[R], adj[N], e[R];
map<pii, int> save;
map<pii, bool> exist;
int l[N], r[N];
int cnt;
void dfs(int fa, int u) {
l[u] = ++cnt;
for (int v : adj[u])
if (v != fa)
dfs(u, v);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |