verify/library_checker/string/z_algorithm.test.cpp

View this file on GitHub
Last update: 2024-11-09 01:34:39+09:00
Problem: https://judge.yosupo.jp/problem/zalgorithm

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/zalgorithm"
#include "../../../src/template/template.hpp"
#include "../../../src/string/z_algorithm.hpp"
int main(void) {
    string s;
    cin >> s;
    int n = s.size();
    vector<int> z = z_algorithm(s);
    rep(i, 0, n) {
        cout << z[i] << " \n"[i + 1 == n];
    }
}

#line 1 "verify/library_checker/string/z_algorithm.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/zalgorithm"
#line 2 "src/template/template.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<long long, long long>;
#define rep(i, a, b) for(long long i = (a); i < (b); ++i)
#define rrep(i, a, b) for(long long i = (a); i >= (b); --i)
constexpr long long inf = 4e18;
struct SetupIO {
    SetupIO() {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout << fixed << setprecision(30);
    }
} setup_io;
#line 3 "src/string/z_algorithm.hpp"
template <typename T>
vector<int> z_algorithm(const vector<T>& s) {
    const int n = (int)s.size();
    if(n == 0) return {};
    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 : min(j + z[j] - i, z[i - j]);
        while(i + k < n and s[k] == s[i + k]) ++k;
        if(j + z[j] < i + z[i]) j = i;
    }
    z[0] = n;
    return z;
}
vector<int> z_algorithm(const string& s) {
    const int n = (int)s.size();
    vector<int> s2(n);
    for(int i = 0; i < n; ++i) {
        s2[i] = s[i];
    }
    return z_algorithm(s2);
}
#line 4 "verify/library_checker/string/z_algorithm.test.cpp"
int main(void) {
    string s;
    cin >> s;
    int n = s.size();
    vector<int> z = z_algorithm(s);
    rep(i, 0, n) {
        cout << z[i] << " \n"[i + 1 == n];
    }
}