a/Library
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Enforce consistent style

Browse source
This commit is contained in:
Anthony Wang 2020-08-21 10:46:26 -05:00
parent 29eb7792ce
commit d0f1b59908
1 changed files with 6 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
Graph/lca.cpp
View file

@ -1,17 +1,17 @@
int d[MAXN], L[MAXN][20];
vector<int> G[MAXN];
int d[MN], L[MN][20];
vector<int> G[MN];
void dfs(int u = 1, int p = 0) {
d[u] = d[p] + 1;
L[u][0] = p;
for (int i = 0; i < 16 && L[u][i]; i++) L[u][i + 1] = L[L[u][i]][i];
for (int i = 0; i < 18 && L[u][i]; i++) L[u][i + 1] = L[L[u][i]][i];
for (auto& v : G[u]) if (v != p) dfs(v, u);
}
int lca(int u, int v) {
if (d[u] > d[v]) swap(u, v);
for (int i = 16; i >= 0; i--) if (d[v] - (1 << i) >= d[u]) v = L[v][i];
for (int i = 18; i >= 0; i--) if (d[v] - (1 << i) >= d[u]) v = L[v][i];
if (u == v) return u;
for (int i = 16; i >= 0; i--) if (L[u][i] && L[u][i] != L[v][i]) u = L[u][i], v = L[v][i];
for (int i = 18; i >= 0; i--) if (L[u][i] && L[u][i] != L[v][i]) u = L[u][i], v = L[v][i];
return L[u][0];
}
}