more fixes

Author: lrvideckis

library/trees/linear_kth_path.hpp

@@ -1,10 +1,10 @@
 #pragma once
 #include "linear_lca.hpp"
 #include "ladder_decomposition/linear_kth_par.hpp"
-struct linear_kth_path {
-  linear_lca lin_lca;
-  linear_kth_par lin_kp;
-  linear_kth_path(const vector<vi>& adj):
+template<class G> struct linear_kth_path {
+  linear_lca<G> lin_lca;
+  linear_kth_par<G> lin_kp;
+  linear_kth_path(const G& adj):
     lin_lca(adj), lin_kp(adj) {}
   //! @param u,v endpoint nodes of path
   //! @param k index into path

library/trees/linear_lca.hpp

@@ -1,15 +1,20 @@
 #pragma once
 //! https://codeforces.com/blog/entry/125371
+//! @code
+//!   vector<vi> adj(n);
+//!   linear_lca llca(adj);
+//!   vector<basic_string<int>> adj1(n);
+//!   linear_lca llca1(adj1);
+//! @endcode
 //! @time O(n + q)
 //! @space O(n)
-struct linear_lca {
+template<class G> struct linear_lca {
   struct node {
     int d, label, asc;
   };
   vector<node> t;
   vi head;
-  linear_lca(const vector<vi>& adj):
-    t(sz(adj)), head(sz(t) + 1) {
+  linear_lca(const G& adj): t(sz(adj)), head(sz(t) + 1) {
     vector<pii> order;
     auto dfs = [&](auto&& self, int v, int p) -> void {
       order.emplace_back(v, p);

tests/library_checker_aizu_tests/compress_tree_asserts.hpp

@@ -6,7 +6,7 @@
 #undef LCA
 #include "../../library/contest/random.hpp"
 void compress_tree_asserts(vector<vector<int>> adj,
-  LCA& lc_rm) {
+  LCA<vector<vi>>& lc_rm) {
   int n = sz(adj);
   vector<bool> used(n);
   KACTL_LCA kactl_lca(adj);

tests/library_checker_aizu_tests/trees/kth_node_on_path.test.cpp

@@ -2,7 +2,6 @@
   "https://judge.yosupo.jp/problem/jump_on_tree"
 #include "../template.hpp"
 #include "../../../library/contest/random.hpp"
-#include "../../../library/monotonic_stack/monotonic_stack.hpp"
 #include "../../../library/trees/tree_lift/tree_lift.hpp"
 #include "../../../library/trees/lca_rmq/lca_rmq.hpp"
 #include "../../../library/trees/linear_lca.hpp"
@@ -12,7 +11,7 @@ int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
   cin >> n >> q;
-  vector<vector<int>> adj(n);
+  vector<vi> adj(n);
   for (int i = 0; i < n - 1; i++) {
     int u, v;
     cin >> u >> v;