# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
714578 | Iliya | Railway (BOI17_railway) | C++17 | 125 ms | 27240 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;
typedef long long ll;
const int N = 1e5 + 10, Log = 20;
vector<int> Adj[N];
vector<pair<int, int>> E;
int n, m, k, H[N], P[Log][N], ts, S[N], F[N], O[N];
void PreDFS(int v, int p)
{
S[v] = ++ts;
P[0][v] = p;
for (int i = 1; i < Log; i++)
P[i][v] = P[i - 1][P[i - 1][v]];
for (int u : Adj[v]) if (u != p)
H[u] = H[v] + 1, PreDFS(u, v);
F[v] = ts;
}
int LCA(int u, int v)
{
if (H[u] < H[v])
swap(u, v);
for (int i = 0; i < Log; i++)
if ((H[u] - H[v]) & (1 << i))
u = P[i][u];
if (u == v)
return u;
for (int i = Log - 1; ~i; i--)
if (P[i][u] != P[i][v])
u = P[i][u], v = P[i][v];
return P[0][v];
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... |