This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub knshnb/competitive_library
#define PROBLEM "https://judge.yosupo.jp/problem/zalgorithm" #include <bits/stdc++.h> // clang-format off using Int = long long; #define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++) #define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__) struct SetupIO { SetupIO() { std::cin.tie(nullptr), std::ios::sync_with_stdio(false), std::cout << std::fixed << std::setprecision(13); } } setup_io; #ifndef _MY_DEBUG #define dump(...) #endif // clang-format on /** * author: knshnb * created: Sun Apr 5 20:03:46 JST 2020 **/ #define CALL_FROM_TEST #include "../../src/String/RollingHash.hpp" #undef CALL_FROM_TEST signed main() { std::string s; std::cin >> s; Int n = s.size(); MultiRollingHash rh(s); REP(i, n) { auto check = [&](Int mid) -> bool { return rh.get(0, mid) == rh.get(i, i + mid); }; Int ok = 0, ng = n - i + 1; while (std::abs(ok - ng) > 1) { Int mid = (ok + ng) / 2; (check(mid) ? ok : ng) = mid; } std::cout << ok << " "; } std::cout << std::endl; }
#line 1 "test/yosupo/zalgorithm_rolling_hash.test.cpp" #define PROBLEM "https://judge.yosupo.jp/problem/zalgorithm" #include <bits/stdc++.h> // clang-format off using Int = long long; #define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++) #define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__) struct SetupIO { SetupIO() { std::cin.tie(nullptr), std::ios::sync_with_stdio(false), std::cout << std::fixed << std::setprecision(13); } } setup_io; #ifndef _MY_DEBUG #define dump(...) #endif // clang-format on /** * author: knshnb * created: Sun Apr 5 20:03:46 JST 2020 **/ #define CALL_FROM_TEST #line 1 "src/String/RollingHash.hpp" /// @docs src/String/RollingHash.md template <class T> struct RollingHash { std::vector<int> hash, pows; int base, mod; RollingHash(const T &a, int base_, int mod_ = 1000000009) : hash(a.size() + 1), pows(a.size() + 1, 1), base(base_), mod(mod_) { for (int i = 0; i < a.size(); i++) { pows[i + 1] = (long long)pows[i] * base % mod; hash[i + 1] = ((long long)hash[i] * base % mod + a[i]) % mod; if (hash[i + 1] < 0) hash[i + 1] += mod; } } // 現在の文字列のサイズ int size() { return hash.size() - 1; } // [l, r) int get(int l, int r) { assert(l <= r); int ret = hash[r] + mod - (long long)hash[l] * pows[r - l] % mod; if (ret >= mod) ret -= mod; return ret; } void concat(const T &b) { int n = hash.size() - 1, m = b.size(); pows.resize(n + m + 1); hash.resize(n + m + 1); for (int i = 0; i < m; i++) { pows[n + i + 1] = (long long)pows[n + i] * base % mod; hash[n + i + 1] = (long long)hash[n + i] * base % mod + b[i]; if (hash[n + i + 1] >= mod) hash[n + i + 1] -= mod; } } void pop_back() { hash.pop_back(); pows.pop_back(); } }; template <int HashNum> std::array<int, HashNum> make_rand_array() { std::array<int, HashNum> res; std::mt19937 rnd(std::chrono::steady_clock::now().time_since_epoch().count()); for (int i = 0; i < HashNum; i++) res[i] = rnd() % 1000000; return res; } template <class T, int HashNum = 4> struct MultiRollingHash { using multihash_t = std::array<int, HashNum>; static std::array<int, HashNum> bases; std::vector<RollingHash<T>> rhs; MultiRollingHash(const T &a) { for (int i = 0; i < HashNum; i++) { rhs.push_back(RollingHash<T>(a, bases[i])); } } multihash_t get(int l, int r) { multihash_t ret; for (int i = 0; i < HashNum; i++) ret[i] = rhs[i].get(l, r); return ret; } int size() { return rhs[0].size(); } void concat(const T &b) { for (auto &rh : rhs) rh.concat(b); } void pop_back() { for (auto &rh : rhs) rh.pop_back(); } }; template <class T, int HashNum> std::array<int, HashNum> MultiRollingHash<T, HashNum>::bases = make_rand_array<HashNum>(); #line 19 "test/yosupo/zalgorithm_rolling_hash.test.cpp" #undef CALL_FROM_TEST signed main() { std::string s; std::cin >> s; Int n = s.size(); MultiRollingHash rh(s); REP(i, n) { auto check = [&](Int mid) -> bool { return rh.get(0, mid) == rh.get(i, i + mid); }; Int ok = 0, ng = n - i + 1; while (std::abs(ok - ng) > 1) { Int mid = (ok + ng) / 2; (check(mid) ? ok : ng) = mid; } std::cout << ok << " "; } std::cout << std::endl; }