saving progress

Author: lrvideckis

library/graphs/dijkstra.hpp

@@ -5,8 +5,7 @@
 //! d[v] = min dist from source->..->v
 //! @time O(n + (m log m))
 //! @space O(n + m)
-vector<ll> dijkstra(
-  const vector<vector<pair<int, ll>>>& adj, int s) {
+template <class G> vector<ll> dijkstra(const G& adj, int s) {
   using p = pair<ll, int>;
   priority_queue<p, vector<p>, greater<>> pq;
   pq.emplace(0, s);

library/graphs/hopcroft_karp.hpp

@@ -12,12 +12,11 @@
 //! mvc_r[r] is 1 if r in Min Vertex Cover
 //! @time O(n + m * sqrt(n)) n = lsz + rsz
 //! @space O(n)
-struct hopcroft_karp {
+template <class G> struct hopcroft_karp {
   int m_sz = 0;
   vi to_r, to_l;
   vector<bool> mvc_l, mvc_r;
-  hopcroft_karp(const vector<vi>& adj, int rsz):
-    to_r(sz(adj), -1), to_l(rsz, -1) {
+  hopcroft_karp(const G& adj, int rsz) : to_r(sz(adj), -1), to_l(rsz, -1) {
     int lsz = sz(adj);
     while (1) {
       queue<int> q;
@@ -46,7 +45,7 @@ struct hopcroft_karp {
         for (int u : adj[v]) {
           int w = to_l[u];
           if (w == -1 ||
-            (level[v] + 1 == level[w] && self(self, w))) {
+              (level[v] + 1 == level[w] && self(self, w))) {
             to_r[v] = u;
             to_l[u] = v;
             return 1;
@@ -56,7 +55,7 @@ struct hopcroft_karp {
         return 0;
       };
       rep(i, 0, lsz) m_sz +=
-        (to_r[i] == -1 && dfs(dfs, i));
+          (to_r[i] == -1 && dfs(dfs, i));
     }
   }
 };

library/strings/knuth_morris_pratt.hpp library/strings/kmp.hpplibrary/strings/knuth_morris_pratt.hpp renamed to library/strings/kmp.hpp

@@ -1,17 +1,21 @@
 #pragma once
 #include "prefix_function.hpp"
 //! @code
+//!   string s,t;
 //!   KMP kmp(t);
 //!   auto match = kmp.find_str(s);
+//!   vi s_vec,t_vec;
+//!   KMP kmp2(t_vec);
+//!   auto match2 = kmp2.find_str(s_vec);
 //! @endcode
 //! if match[i] == 1 then s[i,sz(t)) == t
 //! @time O(|s| + |t|)
 //! @space O(|s| + |t|)
 // NOLINTNEXTLINE(readability-identifier-naming)
-template<class T> struct KMP {
+template <class T> struct KMP {
   T t;
   vi pi;
-  KMP(const T& t): t(t), pi(prefix_function(t)) {}
+  KMP(const T& t) : t(t), pi(prefix_function(t)) {}
   vector<bool> find_str(const T& s) {
     vector<bool> is_m(sz(s));
     int j = 0;

library/strings/manacher/manacher.hpp

@@ -1,7 +1,10 @@
 #pragma once
 //! https://codeforces.com/blog/entry/12143#comment-324162
 //! @code
-//!   auto man = manacher(s);
+//!   string s6;
+//!   auto man = manacher(s6);
+//!   vi s_vec6;
+//!   auto man2 = manacher(s_vec6);
 //! @endcode
 //!
 //! man[center] = index of start of longest
@@ -13,16 +16,16 @@
 //!
 //! @time O(n)
 //! @space O(n)
-template<class T> vi manacher(const T& s) {
+template <class T> vi manacher(const T& s) {
   int n = sz(s), p = 0;
   vi man(max(0, 2 * n - 1));
   rep(i, 0, 2 * n - 1) {
     int r = i <= 2 * (p - man[p])
-      ? p - max(man[2 * p - i], man[p])
-      : i / 2;
+                ? p - max(man[2 * p - i], man[p])
+                : i / 2;
     man[i] = i - r;
     while (
-      man[i] > 0 && r + 1 < n && s[man[i] - 1] == s[r + 1])
+        man[i] > 0 && r + 1 < n && s[man[i] - 1] == s[r + 1])
       man[i]--, r++, p = i;
   }
   return man;

library/strings/suffix_array/suffix_array.hpp

@@ -25,14 +25,17 @@
 //! lcp = {1, 3, 0, 0, 2}
 //!
 //! @code
-//!   auto [sa, sa_inv, lcp] = get_sa(s, 256);
+//!   string s1;
+//!   auto [sa, sa_inv, lcp] = get_sa(s1, 256);
+//!   vi s_vec1;
+//!   auto [sa1, sa_inv1, lcp1] = get_sa(s_vec1, 100'001);
 //! @endcode
 //!
 //! requires 0<=s[i]<max_num
 //!
 //! @time O(nlogn + max_num)
 //! @space O(n + max_num)
-template<class T>
+template <class T>
 array<vi, 3> get_sa(const T& s, int max_num) {
   int n = sz(s);
   vi sa(n), sa_inv(all(s)), lcp(n - 1);
@@ -41,7 +44,7 @@ array<vi, 3> get_sa(const T& s, int max_num) {
     vi y(sa_inv), freq(max_num);
     iota(all(sa_inv), n - i);
     ranges::copy_if(sa, begin(sa_inv) + i,
-      [&](int& x) { return (x -= i) >= 0; });
+                    [&](int& x) { return (x -= i) >= 0; });
     for (int x : y) freq[x]++;
     partial_sum(all(freq), begin(freq));
     for (int x : sa_inv | views::reverse)

library/strings/suffix_array/suffix_array_query.hpp

@@ -3,18 +3,20 @@
 #include "../../data_structures/rmq.hpp"
 #include "find/match.hpp"
 //! @code
-//!   auto [sa1, sa_inv1, lcp1] = get_sa(s, 256);
-//!   sa_query saq(s, sa1, sa_inv1, lcp1);
+//!   string s3;
+//!   auto [sa4, sa_inv4, lcp4] = get_sa(s3, 256);
+//!   sa_query saq(s, sa4, sa_inv4, lcp4);
+//!   vi s_vec3;
+//!   auto [sa5, sa_inv5, lcp5] = get_sa(s_vec3, 100'001);
+//!   sa_query saq2(s_vec3, sa5, sa_inv5, lcp5);
 //! @endcode
-template<class T> struct sa_query {
+template <class T> struct sa_query {
   int n;
   T s;
   vi sa, sa_inv, lcp;
   RMQ<int, function<int(int, int)>> rmq;
   sa_query(const T& s, const vi& sa, const vi& sa_inv,
-    const vi& lcp):
-    n(sz(s)), s(s), sa(sa), sa_inv(sa_inv), lcp(lcp),
-    rmq(lcp, ranges::min) {}
+           const vi& lcp) : n(sz(s)), s(s), sa(sa), sa_inv(sa_inv), lcp(lcp), rmq(lcp, ranges::min) {}
   //! returns max integer k such that
   //!   s.substr(i1, k) == s.substr(i2, k)
   //! @time O(1)

library/strings/suffix_array/suffix_array_short.hpp

@@ -2,12 +2,15 @@
 //! https://github.com/atcoder/ac-library/blob/master/atcoder/string.hpp
 //! @code
 //!   // requires s[i]>=0
-//!   auto [sa2, sa_inv2, lcp2] = sa_short(s);
+//!   string s2;
+//!   auto [sa2, sa_inv2, lcp2] = sa_short(s2);
+//!   vi s_vec2;
+//!   auto [sa3, sa_inv3, lcp3] = sa_short(s_vec2);
 //! @endcode
 //! 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) {
+template <class T> array<vi, 3> sa_short(const T& s) {
   int n = sz(s);
   vi sa(n), sa_inv(all(s)), lcp(n - 1);
   iota(all(sa), 0);
@@ -19,7 +22,7 @@ template<class T> array<vi, 3> sa_short(const T& s) {
     ranges::sort(sa, {}, proj);
     sa_inv[sa[0]] = 0;
     rep(i, 1, n) sa_inv[sa[i]] =
-      sa_inv[sa[i - 1]] + (proj(sa[i - 1]) != proj(sa[i]));
+        sa_inv[sa[i - 1]] + (proj(sa[i - 1]) != proj(sa[i]));
   }
   int sz = 0;
   rep(i, 0, n) {

tests/library_checker_aizu_tests/handmade_tests/string_with_vector.test.cpp

@@ -17,21 +17,18 @@ git submodule update
 	echo "int main() {"
 	echo "vi a,b,subset;"
 	echo "vl left,bottom,s_vec,t_vec;"
-	echo "vector<vi> adj;"
-	echo "vector<vector<pair<int,ll>>> adj_w;"
 	echo "vector<pii> edges;"
 	echo "vector<array<int,2>> eds;"
 	echo "vector<array<int,3>> w_eds;"
 	echo "vector<mint> rhs;"
 	echo "vector<vector<mint>> mat;"
 	echo "vector<vector<bool>> grid;"
-	echo "string s,t;"
 	echo "int n,m,k,tl,tr,l,r,l1,r1,l2,r2,s_l,s_r,root_l,root_r,source,sink,total_flow,bccid,u,v,rsz,cols,cap;"
 } >entire_library_without_main
 
 {
 	cat entire_library_without_main
-	sed --quiet '/\/\/! @code$/,/\/\/! @endcode$/{//!p;}' entire_library_without_main | sed 's/\/\/!//'
+	sed --quiet '/\/\/! @code$/,/\/\/! @endcode$/p' entire_library_without_main | sed 's/\/\/! @code/{/' | sed 's/\/\/! @endcode/}/' | sed 's/\/\/!//'
 	echo "return 0;"
 	echo "}"
 } >entire_library.cpp