more changes

Author: lrvideckis

library/contest/random.hpp

@@ -9,7 +9,7 @@
 //! @endcode
 mt19937 rng(
   chrono::steady_clock::now().time_since_epoch().count());
-template<class T> T rnd(T l, T r) {
+auto rnd(auto l, auto r) {
   assert(l <= r);
-  return uniform_int_distribution<T>(l, r)(rng);
+  return uniform_int_distribution(l, r)(rng);
 }

library/data_structures/dsu/range_parallel_dsu.hpp

@@ -8,16 +8,14 @@
 struct rp_dsu {
   vector<UF> ufs;
   rp_dsu(int n): ufs(bit_width(unsigned(n)), UF(n)) {}
-  template<class F>
-  void join(int l1, int l2, int len, const F& f) {
+  void join(int l1, int l2, int len, const auto& f) {
     if (len == 0) return;
     int lg = __lg(len);
     join_impl(lg, l1, l2, f);
     join_impl(lg, l1 + len - (1 << lg),
       l2 + len - (1 << lg), f);
   }
-  template<class F>
-  void join_impl(int lvl, int u, int v, const F& f) {
+  void join_impl(int lvl, int u, int v, const auto& f) {
     if (lvl == 0) {
       u = ufs[0].find(u);
       v = ufs[0].find(v);

library/data_structures/seg_tree_uncommon/find_first.hpp

@@ -25,13 +25,11 @@
 //! such element exists then `r` is returned
 //! @time O(log(n))
 //! @space O(log(n)) for recursion stack
-template<class F>
-int find_first(int l, int r, const F& f) {
+int find_first(int l, int r, const auto& f) {
   return find_first_in_range(l, r, f, 0, n, 1);
 }
 //! invariant: f(tree[v], tl, tr) is 1
-template<class F>
-int find_first_in_subtree(const F& f, int tl, int tr,
+int find_first_in_subtree(const auto& f, int tl, int tr,
   int v) {
   if (v >= n) return tl;
   int tm = split(tl, tr);
@@ -40,9 +38,8 @@ int find_first_in_subtree(const F& f, int tl, int tr,
     return find_first_in_subtree(f, tl, tm, 2 * v);
   return find_first_in_subtree(f, tm, tr, 2 * v + 1);
 }
-template<class F>
-int find_first_in_range(int l, int r, const F& f, int tl,
-  int tr, int v) {
+int find_first_in_range(int l, int r, const auto& f,
+  int tl, int tr, int v) {
   if (r <= tl || tr <= l) return r;
   if (l <= tl && tr <= r)
     return f(tree[v], tl, tr)

library/data_structures/seg_tree_uncommon/find_last.hpp

@@ -25,12 +25,11 @@
 //! such element exists then (l - 1) is returned
 //! @time O(log(n))
 //! @space O(log(n)) for recursion stack
-template<class F> int find_last(int l, int r, const F& f) {
+int find_last(int l, int r, const auto& f) {
   return find_last_in_range(l, r, f, 0, n, 1);
 }
 //! invariant: f(tree[v], tl, tr) is 1
-template<class F>
-int find_last_in_subtree(const F& f, int tl, int tr,
+int find_last_in_subtree(const auto& f, int tl, int tr,
   int v) {
   if (v >= n) return tl;
   int tm = split(tl, tr);
@@ -39,8 +38,7 @@ int find_last_in_subtree(const F& f, int tl, int tr,
     return find_last_in_subtree(f, tm, tr, 2 * v + 1);
   return find_last_in_subtree(f, tl, tm, 2 * v);
 }
-template<class F>
-int find_last_in_range(int l, int r, const F& f, int tl,
+int find_last_in_range(int l, int r, const auto& f, int tl,
   int tr, int v) {
   if (r <= tl || tr <= l) return l - 1;
   if (l <= tl && tr <= r)

library/graphs/enumerate_triangles.hpp

@@ -7,9 +7,8 @@
 //! @endcode
 //! @time O(n + m ^ (3/2))
 //! @space O(n + m)
-template<class F>
 void enumerate_triangles(const vector<pii>& edges, int n,
-  F f) {
+  auto f) {
   vi deg(n);
   for (auto [u, v] : edges) deg[u]++, deg[v]++;
   vector<vi> adj(n);

library/monotonic_stack/cartesian_k_ary_tree.hpp

@@ -31,8 +31,7 @@
 //! @returns parent array
 //! @time O(n)
 //! @space a O(n) vector is allocated and returned
-template<class T>
-vi cart_k_ary_tree(const vector<T>& a, const vi& l) {
+vi cart_k_ary_tree(const auto& a, const vi& l) {
   vi p(l);
   for (int i = sz(a) - 1; i >= 0; i--)
     for (int j = i - 1; j != l[i]; j = l[j])

library/monotonic_stack/monotonic_stack.hpp

@@ -7,8 +7,7 @@
 //!   a[le[i]] < a[i]
 //! @time O(n)
 //! @space O(n)
-template<class T, class F>
-vi mono_st(const vector<T>& a, F cmp) {
+vi mono_st(const auto& a, auto cmp) {
   vi l(sz(a));
   rep(i, 0, sz(a)) for (
     l[i] = i - 1; l[i] >= 0 && !cmp(a[l[i]], a[i]);) l[i] =

library/strings/longest_common_subsequence/lcs_queries.hpp

@@ -13,8 +13,7 @@
 //! ))
 //! @time O(n*m*log(m) + q*log(m) + q*log(q))
 //! @space O(n + m + q)
-template<class T>
-vi lcs_queries(const T& s, const T& t,
+vi lcs_queries(const auto& s, const auto& t,
   const vector<array<int, 3>>& queries) {
   int n = sz(s), m = sz(t), q = sz(queries);
   vector<vector<array<int, 3>>> qs(n);

library/strings/prefix_function.hpp

@@ -2,7 +2,7 @@
 //! https://cp-algorithms.com/string/prefix-function.html#implementation
 //! @time O(n)
 //! @space O(n)
-template<class T> vi prefix_function(const T& s) {
+vi prefix_function(const auto& s) {
   vi pi(sz(s));
   rep(i, 1, sz(s)) {
     int j = pi[i - 1];

library/strings/wildcard_pattern_matching.hpp

@@ -19,9 +19,8 @@ vector<vl> make_powers(const vl& v) {
   }
   return pws;
 }
-template<class F>
 vector<bool> wildcard_pattern_matching(const vl& s,
-  const vl& t, F conv) {
+  const vl& t, auto conv) {
   int n = sz(s), m = sz(t);
   auto s_pws = make_powers(s);
   auto t_pws = make_powers(t);