# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
600514 | Bobaa | Jail (JOI22_jail) | C++17 | 605 ms | 64648 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;
const int maxn = 120005;
vector<int> g[maxn];
int n, par[maxn], hd[maxn], sz[maxn], dep[maxn], dfn[maxn], seq[maxn], best[maxn], dft, memtp, tg[10 * maxn], tp, indeg[10 * maxn];
pair<int, int> walk[maxn], mem[100 * maxn];
struct node {
int up, dwn;
} seg[maxn << 2];
void adde(int u, int v) {
mem[++memtp] = pair<int, int>(tg[u], v);
tg[u] = memtp;
++indeg[v];
}
void build(int l, int r, int rt) {
if (l == r) {
seg[rt].up = l;
seg[rt].dwn = l + n;
return;
}
seg[rt].up = ++tp;
indeg[tp] = 0;
tg[tp] = 0;
seg[rt].dwn = ++tp;
indeg[tp] = 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |