summaryrefslogtreecommitdiff
path: root/graph/binary_lifting.cpp
diff options
context:
space:
mode:
authorGloria Mundi <gloria@gloria-mundi.eu>2024-02-27 13:04:43 +0100
committerGloria Mundi <gloria@gloria-mundi.eu>2024-02-27 13:04:43 +0100
commite09410a14cee2ac5a6e415a4fc8233edcecdf82f (patch)
treeb016e7854feecdd3821c43bf05711c7f387b4e33 /graph/binary_lifting.cpp
parent101ca1a295a47c6ab7a89129873f5ad5bd3c49f4 (diff)
add binary lifting and make old LCA optional
Diffstat (limited to 'graph/binary_lifting.cpp')
-rw-r--r--graph/binary_lifting.cpp28
1 files changed, 28 insertions, 0 deletions
diff --git a/graph/binary_lifting.cpp b/graph/binary_lifting.cpp
new file mode 100644
index 0000000..9e0dfc3
--- /dev/null
+++ b/graph/binary_lifting.cpp
@@ -0,0 +1,28 @@
+struct Lift {
+ vector<int> dep, par, jmp;
+
+ Lift(vector<vector<int>> &adj, int root):
+ dep(adj.size()), par(adj.size()), jmp(adj.size(), root) {
+ function<void(int,int,int)> dfs = [&](int u, int p, int d) {
+ dep[u] = d, par[u] = p;
+ jmp[u] = dep[p] + dep[jmp[jmp[p]]] == 2*dep[jmp[p]]
+ ? jmp[jmp[p]] : p;
+ for (int v: adj[u]) if (v != p) dfs(v, u, d+1);
+ };
+ dfs(root, root, 0);
+ }
+
+ int depth(int v) { return dep[v]; }
+ int lift(int v, int d) {
+ while (dep[v] > d) v = dep[jmp[v]] < d ? par[v] : jmp[v];
+ return v;
+ }
+ int lca(int u, int v) {
+ v = lift(v, dep[u]), u = lift(u, dep[v]);
+ while (u != v) {
+ if (jmp[u] == jmp[v]) u = par[u], v = par[v];
+ else u = jmp[u], v = jmp[v];
+ }
+ return u;
+ }
+};