# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
763785 | izanbf | Regions (IOI09_regions) | C++14 | 5836 ms | 110480 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 vi = vector<int>;
using vvi = vector<vi>;
const int BIG = 300;
vi r, tin, tout, big_id;
vvi adj, tins, touts, by_r;
int dp[250'000/BIG+1][250'000];
int timer;
void euler(int u, int p) {
tin[u] = timer++;
tins[r[u]].push_back(tin[u]);
for (int v : adj[u]) {
if (v != p) euler(v, u);
}
tout[u] = timer++;
touts[r[u]].push_back(tout[u]);
}
int count_in_range(const vi& v, int l, int r) {
if (v.empty()) return 0;
int ri = upper_bound(v.begin(), v.end(), r) - v.begin();
int li = upper_bound(v.begin(), v.end(), l) - v.begin();
return ri - li;
}
void precompute(int rg, int p, int u) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |