# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134257 | Kastanda | Railway (BOI17_railway) | C++11 | 190 ms | 22256 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>
#define pb push_back
#define x first
#define y second
using namespace std;
const int N = 100005, LG = 17;
int n, q, k, ts, A[N], st[N], en[N], H[N], P[N][LG], R[N];
vector < pair < int , int > > Adj[N];
void DFS(int v, int p)
{
st[v] = ts ++;
P[v][0] = p;
for (int i = 1; i < LG; i++)
P[v][i] = P[P[v][i - 1]][i - 1];
for (auto &u : Adj[v])
if (u.x != p)
H[u.x] = H[v] + 1, DFS(u.x, v);
en[v] = ts;
}
inline int LCA(int v, int u)
{
if (H[v] < H[u])
return (LCA(u, v));
for (int i = 0; i < LG; i++)
if ((H[v] - H[u]) & (1 << i))
v = P[v][i];
if (v == u)
return (v);
for (int i = LG - 1; ~ i; i --)
if (P[v][i] != P[u][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... |