# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
155500 | karma | Regions (IOI09_regions) | C++14 | 7211 ms | 131076 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 Task "test"
#define pb emplace_back
using namespace std;
const int N = int(2e5) + 1;
const int C = 25001;
const int Irene = 0;
int r[N], cur, Time, pos[C], rev[C], cnt[C];
vector<int> out[C], in[C], a[N];
vector< vector <int> > ans, rans;
int n, R, Q, p, e1, e2, res;
void DFS(int u) {
in[r[u]].pb(++Time);
for(int v: a[u]) DFS(v);
out[r[u]].pb(Time);
}
void GetAns(int u) {
for(int i = 0; i < cur; ++i) ans[i][r[u] - 1] += cnt[rev[i]];
++cnt[r[u]];
for(int v: a[u]) GetAns(v);
--cnt[r[u]];
}
void GetRans(int u, int e) {
cnt[u] = 0;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |