# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
548710 | nonsensenonsense1 | Jail (JOI22_jail) | C++17 | 5041 ms | 28872 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 <cstdio>
#include <cstring>
#include <vector>
const int N = 120000;
const int LG = 17;
int n, q, m, s[N], t[N], l[N], in[N], out[N], f[LG][N], u[N];
std::vector<int> g[N];
void dfs(int v) {
static int dt = 0;
in[v] = dt++;
for (int i = 0; i < (int)g[v].size(); ++i) if (g[v][i] != f[0][v]) {
f[0][g[v][i]] = v;
dfs(g[v][i]);
}
out[v] = dt;
}
bool par(int u, int v) {
return in[u] <= in[v] && out[u] >= out[v];
}
int lca(int u, int v) {
if (par(u, v)) return u;
for (int i = LG - 1; i >= 0; --i) if (!par(f[i][u], v)) u = f[i][u];
return f[0][u];
}
bool on(int x, int i) {
Compilation message (stderr)
# | 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... |