noya2_Library

This documentation is automatically generated by online-judge-tools/verification-helper

View the Project on GitHub noya2ruler/noya2_Library

:heavy_check_mark: test/string/RunEnumerate.test.cpp

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/runenumerate"

#include"../../template/template.hpp"
#include"../../string/run_enumerate.hpp"

int main(){
    string s; in(s);
    auto ans = run_enumerate(s);
    out(ans.size());
    for (auto [t, l, r] : ans){
        out(t,l,r);
    }
}
#line 1 "test/string/RunEnumerate.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/runenumerate"

#line 2 "template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "template/utils.hpp"

#line 6 "template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "string/run_enumerate.hpp"

#line 5 "string/run_enumerate.hpp"
#include <ranges>
#line 10 "string/run_enumerate.hpp"

#line 2 "string/z_algorithm.hpp"

#line 8 "string/z_algorithm.hpp"

// atcoder/string

namespace noya2 {

// Reference:
// D. Gusfield,
// Algorithms on Strings, Trees, and Sequences: Computer Science and
// Computational Biology
template <class T> std::vector<int> z_algorithm(const std::vector<T>& s) {
    int n = int(s.size());
    if (n == 0) return {};
    std::vector<int> z(n);
    z[0] = 0;
    for (int i = 1, j = 0; i < n; i++) {
        int& k = z[i];
        k = (j + z[j] <= i) ? 0 : std::min(j + z[j] - i, z[i - j]);
        while (i + k < n && s[k] == s[i + k]) k++;
        if (j + z[j] < i + z[i]) j = i;
    }
    z[0] = n;
    return z;
}

std::vector<int> z_algorithm(const std::string& s) {
    int n = int(s.size());
    std::vector<int> s2(n);
    for (int i = 0; i < n; i++) {
        s2[i] = s[i];
    }
    return z_algorithm(s2);
}

} // namespace noya2
#line 12 "string/run_enumerate.hpp"

namespace noya2 {

std::vector<std::tuple<int,int,int>> run_enumerate(std::string s){
    std::unordered_map<uint64_t,int> periods;
    auto update = [&](int t, int l, int r){
        uint64_t h = ((uint64_t)(l) << 32) | r;
        if (!periods.contains(h) || periods[h] > t){
            periods[h] = t;
        }
    };
    auto dfs = [&](auto sfs, int l, int r) -> void {
        if (r - l == 1) return ;
        int m = (l + r) / 2;
        std::string sl(s.begin() + l, s.begin() + m);
        std::string sr(s.begin() + m, s.begin() + r);
        std::string rev = sl; std::ranges::reverse(rev);
        // L
        {
            auto zl = z_algorithm(rev);
            auto zr = z_algorithm(sr + sl);
            // [i, m) is period
            for (int i = l; i < m; i++){
                int lextend = (i == l ? 0 : zl[m - i]);
                int rextend = zr[r - m + i - l];
                if (rextend == m - i){
                    rextend += zr[m - i];
                    if (rextend > r - m){
                        rextend = r - m;
                    }
                }
                if (lextend + rextend >= m - i){
                    if (i - lextend == l && l > 0) continue;
                    if (m + rextend == r && r < (int)(s.size())) continue;
                    update(m - i, i - lextend, m + rextend);
                }
            }
        }
        std::ranges::reverse_copy(sr, std::back_inserter(rev));
        // R
        {
            // [m, i) is period
            auto zl = z_algorithm(rev);
            auto zr = z_algorithm(sr);
            for (int i = m+1; i <= r; i++){
                int lextend = zl[m - l + r - i];
                if (lextend == i - m){
                    lextend += zl[i - m];
                    if (lextend > m - l){
                        lextend = m - l;
                    }
                }
                int rextend = (i == r ? 0 : zr[i - m]);
                if (lextend + rextend >= i - m){
                    if (m - lextend == l && l > 0) continue;
                    if (i + rextend == r && r < (int)(s.size())) continue;
                    update(i - m, m - lextend, i + rextend);
                }
            }
        }
        sfs(sfs, l, m);
        sfs(sfs, m, r);
    };
    dfs(dfs,0,s.size());
    std::vector<std::tuple<int,int,int>> ret; ret.reserve(periods.size());
    for (auto [lr, t] : periods){
        int r = lr & UINT32_MAX;
        int l = lr >> 32;
        ret.emplace_back(t, l, r);
    }
    std::ranges::sort(ret);
    return ret;
}

} // namespace noya2
#line 5 "test/string/RunEnumerate.test.cpp"

int main(){
    string s; in(s);
    auto ans = run_enumerate(s);
    out(ans.size());
    for (auto [t, l, r] : ans){
        out(t,l,r);
    }
}
Back to top page