From 5ab8a5088b729a9953b8dff1b2a985dc8fb2098b Mon Sep 17 00:00:00 2001
From: mzuenni <michi.zuendorf@gmail.com>
Date: Mon, 27 Jun 2022 17:19:28 +0200
Subject: updated tcr

---
 graph/hld.cpp | 52 ++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 52 insertions(+)
 create mode 100644 graph/hld.cpp

(limited to 'graph/hld.cpp')

diff --git a/graph/hld.cpp b/graph/hld.cpp
new file mode 100644
index 0000000..3d63903
--- /dev/null
+++ b/graph/hld.cpp
@@ -0,0 +1,52 @@
+vector<vector<int>> adj;
+vector<int> sz, in, out, nxt, par;
+int t;
+
+void dfs_sz(int v = 0, int from = -1) {
+	sz[v] = 1;
+	for (auto& u : adj[v]) {
+		if (u != from) {
+			dfs_sz(u, v);
+			sz[v] += sz[u];
+		}
+		if (adj[v][0] == from || sz[u] > sz[adj[v][0]]) {
+			swap(u, adj[v][0]);
+}}}
+
+void dfs_hld(int v = 0, int from = -1) {
+	par[v] = from;
+	in[v] = t++;
+	for (int u : adj[v]) {
+		if (u == from) continue;
+		nxt[u] = (u == adj[v][0] ? nxt[v] : u);
+		dfs_hld(u, v);
+	}
+	out[v] = t;
+}
+
+void init() {
+	int n = sz(adj);
+	sz.assign(n, 0); in.assign(n, 0); out.assign(n, 0);
+	nxt.assign(n, 0); par.assign(n, -1);
+	t = 0;
+	dfs_sz(); dfs_hld();
+}
+
+vector<pair<int, int>> get_intervals(int u, int v) {
+	vector<pair<int, int>> res;
+	while (true) {
+		if (in[v] < in[u]) swap(u, v);
+		if (in[nxt[v]] <= in[u]) {
+			res.eb(in[u], in[v] + 1);
+			return res;
+		}
+		res.eb(in[nxt[v]], in[v] + 1);
+		v = par[nxt[v]];
+}}
+
+int get_lca(int u, int v) {
+	while (true) {
+		if (in[v] < in[u]) swap(u, v);
+		if (in[nxt[v]] <= in[u]) return in[u];
+		v = par[nxt[v]];
+}}
-- 
cgit v1.2.3