This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub plasmatic1/templates
#include "string/suffix_automaton.hpp"
#pragma once #include "../template.hpp" template <int MN> struct SAM { struct state { int len, link; map<char, int> to; }; state st[MN*2]; int last, sz = 0; void init() { for (auto i = 0; i < MN*2; i++) st[i] = {0, 0, map<char, int>()}; st[0] = {0, -1, map<char, int>()}; sz = 1; last = 0; } void extend(char c) { int cur = sz++, p = last; st[cur].len = st[last].len + 1; for (; p != -1 && !st[p].to.count(c); p = st[p].link) st[p].to[c] = cur; if (p == -1) st[cur].link = 0; else { int q = st[p].to[c]; if (st[p].len + 1 == st[q].len) st[cur].link = q; // transition is continuous, we can link directly to Q as the parent in the prefix trie else { // transition is discontinuous, we must split node q into p+1, int clone = sz++; st[clone] = st[q]; st[clone].len = st[p].len + 1; for (; p != -1 && st[p].to[c] == q; p = st[p].link) st[p].to[c] = clone; st[cur].link = st[q].link = clone; } } last = cur; } };
#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_automaton.hpp" template <int MN> struct SAM { struct state { int len, link; map<char, int> to; }; state st[MN*2]; int last, sz = 0; void init() { for (auto i = 0; i < MN*2; i++) st[i] = {0, 0, map<char, int>()}; st[0] = {0, -1, map<char, int>()}; sz = 1; last = 0; } void extend(char c) { int cur = sz++, p = last; st[cur].len = st[last].len + 1; for (; p != -1 && !st[p].to.count(c); p = st[p].link) st[p].to[c] = cur; if (p == -1) st[cur].link = 0; else { int q = st[p].to[c]; if (st[p].len + 1 == st[q].len) st[cur].link = q; // transition is continuous, we can link directly to Q as the parent in the prefix trie else { // transition is discontinuous, we must split node q into p+1, int clone = sz++; st[clone] = st[q]; st[clone].len = st[p].len + 1; for (; p != -1 && st[p].to[c] == q; p = st[p].link) st[p].to[c] = clone; st[cur].link = st[q].link = clone; } } last = cur; } };