switch to auto

lrvideckis · lrvideckis · commit a4fa7f76cb07 · 2024-12-14T19:08:24.000-06:00
diff --git a/library/graphs/complement_graph_ccs.hpp b/library/graphs/complement_graph_ccs.hpp
@@ -13,8 +13,7 @@
 //!   cc in the compliment graph
 //! @time O(n + m)
 //! @space O(n)
-template<class G>
-vi get_complement_graph_ccs(const G& adj) {
+vi get_complement_graph_ccs(const auto& adj) {
   int n = sz(adj);
   vi cc_id(n), unseen(n);
   iota(all(unseen), 0);
diff --git a/library/graphs/dijkstra.hpp b/library/graphs/dijkstra.hpp
@@ -10,8 +10,7 @@
 //! d[v] = min dist from source->..->v
 //! @time O(n + (m log m))
 //! @space O(n + m)
-template<class G>
-vector<ll> dijkstra(const G& adj, int s) {
+vector<ll> dijkstra(const auto& adj, int s) {
   using p = pair<ll, int>;
   priority_queue<p, vector<p>, greater<>> pq;
   pq.emplace(0, s);
diff --git a/library/graphs/hopcroft_karp.hpp b/library/graphs/hopcroft_karp.hpp
@@ -18,11 +18,11 @@
 //! mvc_r[r] is 1 if r in Min Vertex Cover
 //! @time O(n + m * sqrt(n)) n = lsz + rsz
 //! @space O(n)
-template<class G> struct hopcroft_karp {
+struct hopcroft_karp {
   int m_sz = 0;
   vi to_r, to_l;
   vector<bool> mvc_l, mvc_r;
-  hopcroft_karp(const G& adj, int rsz):
+  hopcroft_karp(const auto& adj, int rsz):
     to_r(sz(adj), -1), to_l(rsz, -1) {
     int lsz = sz(adj);
     while (1) {
diff --git a/library/strings/manacher/is_palindrome.hpp b/library/strings/manacher/is_palindrome.hpp
@@ -2,9 +2,9 @@
 #include "manacher.hpp"
 //! @time O(n + q)
 //! @space O(n)
-template<class T> struct pal_query {
+struct pal_query {
   vi man;
-  pal_query(const T& s): man(manacher(s)) {};
+  pal_query(const auto& s): man(manacher(s)) {};
   bool is_pal(int l, int r) { // [l, r]
     return man[l + r] <= l;
   }
diff --git a/library/strings/manacher/longest_from_index.hpp b/library/strings/manacher/longest_from_index.hpp
@@ -8,7 +8,7 @@
 //!   is a palindrome
 //! @time O(n)
 //! @space O(n)
-template<class T> vi longest_from_index(pal_query<T>& pq) {
+vi longest_from_index(pal_query& pq) {
   int n = (sz(pq.man) + 1) / 2;
   vector longest(n, n - 1);
   for (int i = n - 2; i >= 0; i--) {
diff --git a/library/strings/manacher/longest_palindrome_query.hpp b/library/strings/manacher/longest_palindrome_query.hpp
@@ -3,13 +3,13 @@
 #include "manacher.hpp"
 //! queries for longest palindromic substring of a given
 //! substring
-template<class T> struct longest_pal_query {
+struct longest_pal_query {
   vi man;
   RMQ<int, function<int(int, int)>> rmq = {{}, NULL};
   //! @param s string/vector
   //! @time O(n log n)
   //! @space O(n log n) for rmq, everything else is O(n)
-  longest_pal_query(const T& s): man(manacher(s)) {
+  longest_pal_query(const auto& s): man(manacher(s)) {
     vi init(sz(man));
     iota(all(init), 0);
     rmq = {init, [&](int i1, int i2) {
diff --git a/library/strings/manacher/manacher.hpp b/library/strings/manacher/manacher.hpp
@@ -16,7 +16,7 @@
 //!
 //! @time O(n)
 //! @space O(n)
-template<class T> vi manacher(const T& s) {
+vi manacher(const auto& s) {
   int n = sz(s), p = 0;
   vi man(2 * n - 1);
   rep(i, 0, 2 * n - 1) {
diff --git a/library/strings/suffix_array/suffix_array.hpp b/library/strings/suffix_array/suffix_array.hpp
@@ -34,8 +34,7 @@
 //!
 //! @time O(nlogn + max_num)
 //! @space O(n + max_num)
-template<class T>
-array<vi, 3> get_sa(const T& s, int max_num) {
+auto get_sa(const auto& s, int max_num) {
   int n = sz(s);
   vi sa(n), sa_inv(all(s)), lcp(n - 1);
   iota(all(sa), 0);
@@ -67,5 +66,5 @@ array<vi, 3> get_sa(const T& s, int max_num) {
       sz++;
     lcp[sa_inv[i] - 1] = sz;
   }
-  return {sa, sa_inv, lcp};
+  return tuple{sa, sa_inv, lcp};
 }
diff --git a/library/strings/suffix_array/suffix_array_short.hpp b/library/strings/suffix_array/suffix_array_short.hpp
@@ -10,7 +10,7 @@
 //! runs in ~1.5s for 5e5
 //! @time O(n * log^2(n))
 //! @space O(n)
-template<class T> array<vi, 3> sa_short(const T& s) {
+auto sa_short(const auto& s) {
   int n = sz(s);
   vi sa(n), sa_inv(all(s)), lcp(n - 1);
   iota(all(sa), 0);
@@ -33,5 +33,5 @@ template<class T> array<vi, 3> sa_short(const T& s) {
       sz++;
     lcp[sa_inv[i] - 1] = sz;
   }
-  return {sa, sa_inv, lcp};
+  return tuple{sa, sa_inv, lcp};
 }
diff --git a/library/trees/ladder_decomposition/linear_kth_par.hpp b/library/trees/ladder_decomposition/linear_kth_par.hpp
@@ -12,14 +12,15 @@
 //! kth_par = a node k edges up from v
 //! @time O(n + q)
 //! @space O(n)
-template<class G> struct linear_kth_par {
+struct linear_kth_par {
   struct node {
     int d, p = -1, dl, idx_j, idx_l;
   };
   vector<node> t;
   vector<pii> j;
   vi l;
-  linear_kth_par(const G& adj): t(sz(adj)), j(2 * sz(t)) {
+  linear_kth_par(const auto& adj):
+    t(sz(adj)), j(2 * sz(t)) {
     vi st;
     int pos = 1;
     auto add_j = [&]() -> void {
diff --git a/library/trees/lca_rmq/lca_rmq.hpp b/library/trees/lca_rmq/lca_rmq.hpp
@@ -12,13 +12,13 @@
 //! @time O(nlogn + q)
 //! @space O(nlogn)
 // NOLINTNEXTLINE(readability-identifier-naming)
-template<class G> struct LCA {
+struct LCA {
   struct node {
     int in, sub_sz = 1, d, p = -1;
   };
   vector<node> t;
   RMQ<int, function<int(int, int)>> rmq = {{}, NULL};
-  LCA(const G& adj): t(sz(adj)) {
+  LCA(const auto& adj): t(sz(adj)) {
     vi order;
     auto dfs = [&](auto&& self, int v) -> void {
       t[v].in = sz(order), order.push_back(v);
diff --git a/library/trees/linear_kth_path.hpp b/library/trees/linear_kth_path.hpp
@@ -1,10 +1,10 @@
 #pragma once
 #include "linear_lca.hpp"
 #include "ladder_decomposition/linear_kth_par.hpp"
-template<class G> struct linear_kth_path {
-  linear_lca<G> lin_lca;
-  linear_kth_par<G> lin_kp;
-  linear_kth_path(const G& adj):
+struct linear_kth_path {
+  linear_lca lin_lca;
+  linear_kth_par lin_kp;
+  linear_kth_path(const auto& adj):
     lin_lca(adj), lin_kp(adj) {}
   //! @param u,v endpoint nodes of path
   //! @param k index into path
diff --git a/library/trees/linear_lca.hpp b/library/trees/linear_lca.hpp
@@ -10,13 +10,14 @@
 //! @endcode
 //! @time O(n + q)
 //! @space O(n)
-template<class G> struct linear_lca {
+struct linear_lca {
   struct node {
     int d, label, asc;
   };
   vector<node> t;
   vi head;
-  linear_lca(const G& adj): t(sz(adj)), head(sz(t) + 1) {
+  linear_lca(const auto& 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);
diff --git a/library/trees/subtree_isomorphism.hpp b/library/trees/subtree_isomorphism.hpp
@@ -13,21 +13,18 @@
 //!     isomorphic to subtree v
 //! @time O(n log n)
 //! @space O(n)
-template<class G> struct subtree_iso {
-  int num_distinct_subtrees;
-  vi iso_id;
-  subtree_iso(const G& adj): iso_id(sz(adj), -1) {
-    map<vi, int> hashes;
-    auto dfs = [&](auto&& self, int v, int p) -> int {
-      vi ch_ids;
-      for (int u : adj[v])
-        if (u != p) ch_ids.push_back(self(self, u, v));
-      ranges::sort(ch_ids);
-      return iso_id[v] =
-               hashes.try_emplace(ch_ids, sz(hashes))
-                 .first->second;
-    };
-    rep(i, 0, sz(adj)) if (iso_id[i] == -1) dfs(dfs, i, i);
-    num_distinct_subtrees = sz(hashes);
-  }
-};
+auto subtree_iso(const auto& adj) {
+  vi iso_id(sz(adj), -1);
+  map<vi, int> hashes;
+  auto dfs = [&](auto&& self, int v, int p) -> int {
+    vi ch_ids;
+    for (int u : adj[v])
+      if (u != p) ch_ids.push_back(self(self, u, v));
+    ranges::sort(ch_ids);
+    return iso_id[v] =
+             hashes.try_emplace(ch_ids, sz(hashes))
+               .first->second;
+  };
+  rep(i, 0, sz(adj)) if (iso_id[i] == -1) dfs(dfs, i, i);
+  return pair{sz(hashes), iso_id};
+}
diff --git a/library/trees/tree_lift/tree_lift.hpp b/library/trees/tree_lift/tree_lift.hpp
@@ -12,12 +12,12 @@
 //! kth_p = a node k edges up from v
 //! @time O(n + q log n)
 //! @space O(n)
-template<class G> struct tree_lift {
+struct tree_lift {
   struct node {
     int d, p = -1, j = -1;
   };
   vector<node> t;
-  tree_lift(const G& adj): t(sz(adj)) {
+  tree_lift(const auto& adj): t(sz(adj)) {
     auto dfs = [&](auto&& self, int v) -> void {
       int jump =
         (t[v].d + t[t[t[v].j].j].d == 2 * t[t[v].j].d)
