# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
660211 | QwertyPi | Regions (IOI09_regions) | C++14 | 5345 ms | 34088 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>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
using namespace std;
const int N = 1 << 18;
const int LGN = 18;
const int R = 25001;
const int B = 500;
int p[N], r[N];
int tl[N], tr[N], preord[N], cnt[R];
int prec[N / B][R], id[R], ids = 0;
vector<int> G[N];
vector<int> emp[N];
vector<int> pos[R];
int n, rn, q;
int ct = 0;
void dfs(int v){
tl[v] = ++ct; preord[ct] = v;
for(auto u : G[v]){
dfs(u);
}
tr[v] = ct;
}
bool vis[N];
void dfs_prec(int Co, int v, int acc = 0){
if(r[v] == Co) vis[v] = true;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |