# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
53634 | baactree | Regions (IOI09_regions) | C++17 | 7638 ms | 92340 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;
vector<int> adj[200005];
int arr[200005];
const int sz = 600;
int cache[sz][25005];
pair<int, int> cnt[25005];
int inv[25005];
int le[200005], ri[200005];
vector<int> idx[25005];
vector<pair<int, int> > vec[25005];
int vn;
void dfs(int now, int par) {
idx[arr[now]].push_back(vn);
le[now] = vn++;
for (auto &there : adj[now]) {
if (there == par)continue;
dfs(there, now);
}
ri[now] = vn++;
vec[arr[now]].emplace_back(le[now], ri[now]);
}
int main() {
scanf("%d%d%d", &n, &r, &q);
scanf("%d", &arr[1]);
cnt[arr[1]].first++;
for (int i = 2; i <= n; i++) {
int a, b;
scanf("%d%d", &a, &b);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |