This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub plasmatic1/templates
#define PROBLEM "https://judge.yosupo.jp/problem/zalgorithm" #include "../../template.hpp" #include "../test_utils.hpp" #include "../../string/hash_utils.hpp" const int MN = 5e5 + 1; int N; string s; ll hs[MN]; int main() { fast_io(); init_hash<RAND_BASE>(MN); cin >> s; N = s.length(); for (int i = 1; i <= N; i++) hs[i] = happend(hs[i-1], s[i-1]); for (int i = 1; i <= N; i++) { int l = 0, r = N-i+1, ans = 0; while (l <= r) { int mid = (l + r) / 2; if (hget(hs, i, i+mid-1) == hget(hs, 1, mid)) { l = mid+1; ans = mid; } else r = mid-1; } cout << ans << ' '; } cout << '\n'; return 0; }
#line 1 "tests/string/hash_utils.test.cpp" #define PROBLEM "https://judge.yosupo.jp/problem/zalgorithm" #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 "tests/test_utils.hpp" // I/O template <typename T> void print(T v) { cout << v << '\n'; } template <typename T, typename... Rest> void print(T v, Rest... vs) { cout << v << ' '; print(vs...); } void fast_io() { ios_base::sync_with_stdio(false); cin.tie(NULL); } // Reading operators template <typename T, typename U> istream& operator>>(istream& in, pair<T, U> &o) { return in >> o.first >> o.second; } // Read helpers int readi() { int x; cin >> x; return x; } ll readl() { ll x; cin >> x; return x; } template <typename T> vector<T> readv(int n) { vector<T> res(n); for (auto &x : res) cin >> x; return res; } // Functional stuff template <typename T> vector<pair<int, T>> enumerate(vector<T> v, int start = 0) { vector<pair<int, T>> res; for (auto &x : v) res.emplace_back(start++, x); return res; } #line 3 "string/hash_utils.hpp" // Hashing stuff const int FIXED_BASE = 0, RAND_BASE = 1 << 0; const ll MOD = 999999999999999989; ll BASE = 131; vector<ll> _hash_pows; template <int MODE> void init_hash(int MAX_N) { if (MODE & RAND_BASE) { mt19937 mt(RANDOM); BASE = uniform_int_distribution<ll>(MOD/2, MOD-2)(mt); } _hash_pows.resize(MAX_N + 1); _hash_pows[0] = 1LL; for (auto i = 1; i <= MAX_N; i++) _hash_pows[i] = __int128(_hash_pows[i - 1]) * BASE % MOD; } template <typename It> ll hget(It hs, int l, int r) { __int128 res = (hs[r] - __int128(hs[l - 1]) * _hash_pows[r - l + 1]) % MOD; if (res < 0) res += MOD; return res; } ll happend(ll hsh, int val) { return (__int128(hsh) * BASE + val) % MOD; } ll hconcat(ll hshLeft, ll hshRight, int szRight) { return (__int128(hshLeft) * _hash_pows[szRight] + hshRight) % MOD; } #line 5 "tests/string/hash_utils.test.cpp" const int MN = 5e5 + 1; int N; string s; ll hs[MN]; int main() { fast_io(); init_hash<RAND_BASE>(MN); cin >> s; N = s.length(); for (int i = 1; i <= N; i++) hs[i] = happend(hs[i-1], s[i-1]); for (int i = 1; i <= N; i++) { int l = 0, r = N-i+1, ans = 0; while (l <= r) { int mid = (l + r) / 2; if (hget(hs, i, i+mid-1) == hget(hs, 1, mid)) { l = mid+1; ans = mid; } else r = mid-1; } cout << ans << ' '; } cout << '\n'; return 0; }