# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
895429 | MinaRagy06 | Regions (IOI09_regions) | C++17 | 4601 ms | 74100 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;
#define ll long long
const int N = 200'005, inf = 1e9 + 5;
vector<int> adj[N];
int a[N], p[N], sz[N], order[N], idx[N];
vector<int> above[N], below[N], gud[N];
void calc1(int i, int c, int r) {
above[r][a[i]] += c;
above[r][a[i]] = min(above[r][a[i]], inf);
c += a[i] == order[r];
for (auto nxt : adj[i]) {
calc1(nxt, c, r);
}
}
int calc2(int i, int r) {
int c = 0;
for (auto nxt : adj[i]) {
c += calc2(nxt, r);
}
below[r][a[i]] += c;
below[r][a[i]] = min(below[r][a[i]], inf);
return c + (a[i] == order[r]);
}
int st[N], en[N], t;
void dfs(int i) {
st[i] = t++;
for (auto nxt : adj[i]) {
dfs(nxt);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |