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

Update lca.cpp

Browse source
This commit is contained in:
Anthony Wang 2021-01-21 20:18:42 -06:00
parent 6087e1adeb
commit 9519fe7099
Signed by: a
GPG key ID: 6FD3502572299774
1 changed files with 13 additions and 17 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

30
Graph/lca.cpp
View file

@ -1,18 +1,14 @@
namespace lca {
int d[MX], L[MX][20];
void dfs(vector<int> * G, int u = 1, int p = 0) {
d[u] = d[p] + 1, L[u][0] = p;
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(G, v, u);
}
int lca(vector<int> * G, int u, int v) {
if (d[u] > d[v]) swap(u, v);
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 = 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];
}
inline int dist(vector<int> * G, int u, int v) {
return d[u]+d[v]-2*d[lca(G, u, v)];
}
int d[MX], L[MX][20];
void dfs(int u = 1, int p = 0) {
d[u] = d[p] + 1, L[u][0] = p;
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 = 18; i >= 0; --i) if (d[v] - (1<<i) >= d[u]) v = L[v][i];
if (u == v) return u;
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];
}
inline int dist(int u, int v) { return d[u]+d[v]-2*d[lca(u, v)]; }