# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
677285 | PositiveDelta | Jail (JOI22_jail) | C++17 | 79 ms | 1080 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;
struct LCA {
int n;
vector<int> depth;
vector<vector<int>> g, dp;
void dfs(int u) {
depth[u] = (u == 0 ? 0 : depth[dp[0][u]] + 1);
for (int i = 0; i + 1 < 20; i++)
dp[i + 1][u] = dp[i][dp[i][u]];
for (int v : g[u])
if (v != dp[0][u]) {
dp[0][v] = u;
dfs(v);
}
}
LCA(vector<vector<int>> g) : g(g) {
n = g.size();
depth.resize(n);
dp.assign(20, vector<int>(n, 0));
dfs(0);
}
int lca(int u, int v) {
if (depth[u] < depth[v])
swap(u, v);
# | 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... |