# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
271935 | WLZ | Regions (IOI09_regions) | C++14 | 8106 ms | 112488 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 n, r, q, cur = 0;
vector<int> h, s;
vector< vector<int> > g;
vector< vector< pair<int, int> > > reg;
int dfs(int u) {
int st = cur++;
int en = st;
for (auto& v : g[u]) {
en = dfs(v);
}
reg[h[u]].push_back({st, 1});
reg[h[u]].push_back({en, -1});
return en;
}
long long solve(int r1, int r2) {
int cur = 0, idx = -1;
long long ans = 0;
for (auto& p : reg[r2]) {
if (p.second == -1) {
continue;
}
while (idx + 1 < (int) reg[r1].size() && reg[r1][idx + 1].first < p.first) {
idx++;
cur += reg[r1][idx].second;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |