initial reorg

Author: lrvideckis

library/trees/centroid_decomp_uncommon/count_paths_per_length.hpp

@@ -1,4 +1,4 @@
 //! returns 1 if v is in u's subtree
 bool in_subtree(int u, int v) {
-  return in[u] <= in[v] && in[v] < in[u] + siz[u];
+  return tin[u] <= tin[v] && tin[v] < tin[u] + siz[u];
 }

library/trees/extra_members/dist_edges.hpp renamed to library/trees/extra_members/dist.hpp

@@ -5,6 +5,5 @@
 //! @space O(1)
 int next_on_path(int u, int v) {
   assert(u != v);
-  return in_subtree(u, v) ? rmq.query(in[u] + 1, in[v] + 1)
-                          : p[u];
+  return in_subtree(u, v) ? rmq.query(tin[u] + 1, tin[v] + 1) : p[u];
 }

library/trees/extra_members/in_subtree.hpp

@@ -11,7 +11,7 @@
 //! @time O(|subset| log |subset|)
 //! @space O(|subset|)
 array<vi, 2> compress_tree(vi subset) {
-  auto proj = [&](int v) { return in[v]; };
+  auto proj = [&](int v) { return tin[v]; };
   ranges::sort(subset, {}, proj);
   int len = sz(subset);
   rep(i, 1, len)

library/trees/lca_rmq/next_on_path.hpp renamed to library/trees/extra_members/next_on_path.hpp

@@ -14,13 +14,13 @@
 // NOLINTNEXTLINE(readability-identifier-naming)
 struct LCA {
   int n;
-  vi in, siz, d, p;
+  vi tin, siz, d, p;
   RMQ<int, function<int(int, int)>> rmq = {{}, NULL};
   LCA(const auto& adj):
-    n(sz(adj)), in(n), siz(n, 1), d(n), p(n) {
+    n(sz(adj)), tin(n), siz(n, 1), d(n), p(n) {
     vi order;
     auto dfs = [&](auto&& self, int v) -> void {
-      in[v] = sz(order), order.push_back(v);
+      tin[v] = sz(order), order.push_back(v);
       for (int u : adj[v])
         if (u != p[v])
           d[u] = d[p[u] = v] + 1, self(self, u),
@@ -32,7 +32,7 @@ struct LCA {
   }
   int lca(int u, int v) {
     if (u == v) return u;
-    auto [x, y] = minmax(in[u], in[v]);
+    auto [x, y] = minmax(tin[u], tin[v]);
     return p[rmq.query(x + 1, y + 1)];
   }
 #include "../extra_members/dist_edges.hpp"