This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub plasmatic1/templates
#include "string/suffix_array.hpp"
#pragma once #include "../template.hpp" const int SA_ONLY = 0, LCP = 1 << 0; struct suf { int idx, r1, r2; bool operator<(const suf &o) const { return r1 == o.r1 ? r2 < o.r2 : r1 < o.r1; } }; template <const int _MN, const int MIN_VAL, const int MAX_VAL, const int MODE> struct SuffixArray { static const int MN = _MN+1, MV = MN+1 > MAX_VAL-MIN_VAL+2 ? MN+1 : MAX_VAL-MIN_VAL+2; suf sa[MN]; int N, crnk[MN]; vector<int> lcp; void rsort_once(function<int(suf&)> key_fun) { static int cnt[MV]; static suf tmp[MN]; fill(cnt, cnt+MV, 0); for (int i = 0; i < N; i++) cnt[key_fun(sa[i])]++; partial_sum(cnt, cnt+MV, cnt); for (int i = N-1; i >= 0; i--) tmp[--cnt[key_fun(sa[i])]] = sa[i]; copy(tmp, tmp+N, sa); } void rsort() { rsort_once([&] (const suf &s) { return s.r2; }); rsort_once([&] (const suf &s) { return s.r1; }); } template <typename Container> vector<int> solve(int N0, const Container &s) { N = N0; for (auto i = 0; i < N; i++) sa[i] = {i, s[i] - MIN_VAL + 1, i + 1 < N ? s[i + 1] - MIN_VAL + 1 : 0}; rsort(); for (int i = 2; i <= N; i *= 2) { int ctr = 0; suf pre{-1, -1, -1}; for (auto j = 0; j < N; j++) { if (sa[j].r1 != pre.r1 || sa[j].r2 != pre.r2) { ctr++; pre = sa[j]; } sa[j].r1 = ctr; crnk[sa[j].idx] = ctr; } for (auto j = 0; j < N; j++) sa[j].r2 = sa[j].idx + i < N ? crnk[sa[j].idx + i] : 0; rsort(); } vector<int> res(N); for (int i = 0; i < N; i++) res[i] = sa[i].idx; if (MODE & LCP) { function<int(int, int)> getch = [&] (int idx, int col) { col += idx; return col < N ? s[col] : MIN_VAL - 1; }; lcp.assign(N, 0); vector<int> where(N); for (int i = 0; i < N; i++) where[res[i]] = i; int cur = 0; for (int i = 0; i < N; i++) { int t = where[i]; if (t < N-1) while (getch(i, cur) == getch(res[t+1], cur)) cur++; lcp[t] = cur; if (cur > 0) cur--; } } return res; } #if __cplusplus == 201703L // CPP17 only things void bind(opt_ref<vector<int>> lcp0) { if (lcp0) lcp.swap(*lcp0); } #endif };
#line 2 "template.hpp" #include <bits/stdc++.h> #define DEBUG 1 using namespace std; // Defines #define fs first #define sn second #define pb push_back #define eb emplace_back #define mpr make_pair #define mtp make_tuple #define all(x) (x).begin(), (x).end() // Basic type definitions #if __cplusplus == 201703L // CPP17 only things template <typename T> using opt_ref = optional<reference_wrapper<T>>; // for some templates #endif using ll = long long; using ull = unsigned long long; using ld = long double; using pii = pair<int, int>; using pll = pair<long long, long long>; #ifdef __GNUG__ // PBDS order statistic tree #include <ext/pb_ds/assoc_container.hpp> // Common file #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; template <typename T, class comp = less<T>> using os_tree = tree<T, null_type, comp, rb_tree_tag, tree_order_statistics_node_update>; template <typename K, typename V, class comp = less<K>> using treemap = tree<K, V, comp, rb_tree_tag, tree_order_statistics_node_update>; // HashSet #include <ext/pb_ds/assoc_container.hpp> template <typename T, class Hash> using hashset = gp_hash_table<T, null_type, Hash>; template <typename K, typename V, class Hash> using hashmap = gp_hash_table<K, V, Hash>; const ll RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count(); struct chash { ll operator()(ll x) const { return x ^ RANDOM; } }; #endif // More utilities int SZ(string &v) { return v.length(); } template <typename C> int SZ(C &v) { return v.size(); } template <typename C> void UNIQUE(vector<C> &v) { sort(v.begin(), v.end()); v.resize(unique(v.begin(), v.end()) - v.begin()); } template <typename T, typename U> void maxa(T &a, U b) { a = max(a, b); } template <typename T, typename U> void mina(T &a, U b) { a = min(a, b); } const ll INF = 0x3f3f3f3f, LLINF = 0x3f3f3f3f3f3f3f3f; #line 3 "string/suffix_array.hpp" const int SA_ONLY = 0, LCP = 1 << 0; struct suf { int idx, r1, r2; bool operator<(const suf &o) const { return r1 == o.r1 ? r2 < o.r2 : r1 < o.r1; } }; template <const int _MN, const int MIN_VAL, const int MAX_VAL, const int MODE> struct SuffixArray { static const int MN = _MN+1, MV = MN+1 > MAX_VAL-MIN_VAL+2 ? MN+1 : MAX_VAL-MIN_VAL+2; suf sa[MN]; int N, crnk[MN]; vector<int> lcp; void rsort_once(function<int(suf&)> key_fun) { static int cnt[MV]; static suf tmp[MN]; fill(cnt, cnt+MV, 0); for (int i = 0; i < N; i++) cnt[key_fun(sa[i])]++; partial_sum(cnt, cnt+MV, cnt); for (int i = N-1; i >= 0; i--) tmp[--cnt[key_fun(sa[i])]] = sa[i]; copy(tmp, tmp+N, sa); } void rsort() { rsort_once([&] (const suf &s) { return s.r2; }); rsort_once([&] (const suf &s) { return s.r1; }); } template <typename Container> vector<int> solve(int N0, const Container &s) { N = N0; for (auto i = 0; i < N; i++) sa[i] = {i, s[i] - MIN_VAL + 1, i + 1 < N ? s[i + 1] - MIN_VAL + 1 : 0}; rsort(); for (int i = 2; i <= N; i *= 2) { int ctr = 0; suf pre{-1, -1, -1}; for (auto j = 0; j < N; j++) { if (sa[j].r1 != pre.r1 || sa[j].r2 != pre.r2) { ctr++; pre = sa[j]; } sa[j].r1 = ctr; crnk[sa[j].idx] = ctr; } for (auto j = 0; j < N; j++) sa[j].r2 = sa[j].idx + i < N ? crnk[sa[j].idx + i] : 0; rsort(); } vector<int> res(N); for (int i = 0; i < N; i++) res[i] = sa[i].idx; if (MODE & LCP) { function<int(int, int)> getch = [&] (int idx, int col) { col += idx; return col < N ? s[col] : MIN_VAL - 1; }; lcp.assign(N, 0); vector<int> where(N); for (int i = 0; i < N; i++) where[res[i]] = i; int cur = 0; for (int i = 0; i < N; i++) { int t = where[i]; if (t < N-1) while (getch(i, cur) == getch(res[t+1], cur)) cur++; lcp[t] = cur; if (cur > 0) cur--; } } return res; } #if __cplusplus == 201703L // CPP17 only things void bind(opt_ref<vector<int>> lcp0) { if (lcp0) lcp.swap(*lcp0); } #endif };