# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
637628 | 4EVER | Putovanje (COCI20_putovanje) | C++11 | 136 ms | 23464 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;
int n;
vector<pair<int, int>> adj[200001];
int val[200001], cnt[200001], depth[200001], c[200001], d[200001];
int spt[19][200001];
void DFS(int u = 1, int par = -1){
for(auto x : adj[u]){
int v = x.first;
if(v == par) continue;
depth[v] = depth[u] + 1;
spt[0][v] = u;
for(int i = 1; i <= 18; i++) spt[i][v] = spt[i - 1][spt[i - 1][v]];
DFS(v, u);
}
}
int LCA(int u, int v){
if(depth[u] < depth[v]) swap(u, v);
int k = depth[u] - depth[v];
for(int i = 18; i >= 0; i--) if((k >> i) & 1) u = spt[i][u];
if(u == v) return u;
for(int i = 18; i >= 0; i--) if(spt[i][u] != spt[i][v]){
u = spt[i][u];
v = spt[i][v];
}
return spt[0][u];
}
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... |