# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
403638 | saarang123 | Railway (BOI17_railway) | C++17 | 144 ms | 24920 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 MXN = 100 * 1000 + 3;
const int LGN = 19;
vector<int> g[MXN];
int nxt[MXN], up[MXN][LGN], dt[MXN], tin[MXN], p[MXN];
int n, m, k;
void dfs(int v = 1, int pp = 1) {
up[v][0] = pp;
tin[v] = ++tin[0];
for(int i = 1; i < LGN; ++i)
up[v][i] = up[up[v][i - 1]][i - 1];
for(int u : g[v]) if(u != pp) {
dt[u] = dt[v] + 1;
dfs(u, v);
}
}
int kth(int v, int diff) {
for(int i = 0; i < LGN; i++)
if(diff >> i & 1)
v = up[v][i];
return v;
}
int LCA(int u, int v) {
if(dt[u] > dt[v])
swap(u, v);
v = kth(v, dt[v] - dt[u]);
# | 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... |