string/test/z_algorithm.test.cpp

• View this file on GitHub
• Last update: 2021-01-01 16:52:32+09:00
• Problem: https://judge.yosupo.jp/problem/zalgorithm

Depends on

• string/z_algorithm.hpp

Code

#include "../z_algorithm.hpp"
#include <cstdio>
#include <iostream>
#include <string>
#define PROBLEM "https://judge.yosupo.jp/problem/zalgorithm"

int main() {
    std::string S;
    std::cin >> S;
    for (auto x : z_algorithm(S)) printf("%d ", x);
}

#line 2 "string/z_algorithm.hpp"
#include <string>
#include <vector>

// CUT begin
// Z algorithm (length of longest common prefix for s[0:N] & s[i:N] for each i)
// Input: std::vector<T> / std::string of length N
// Output: std::vector<int> of size N
// Complexity: O(N)
// Sample:
// - `teletelepathy` -> [13, 0, 0, 0, 4, 0, 0, 0, 0, 0, 1, 0, 0]
// Reference: <http://snuke.hatenablog.com/entry/2014/12/03/214243>
template <typename T> std::vector<int> z_algorithm(const std::vector<T> &s) {
    const int N = s.size();
    if (N == 0) return {};
    std::vector<int> ans(N);
    ans[0] = N;
    int i = 1, j = 0;
    while (i < N) {
        while (i + j < N and s[j] == s[i + j]) ++j;
        ans[i] = j;
        if (!j) {
            ++i;
            continue;
        }
        int k = 1;
        while (i + k < N and k + ans[k] < j) ans[i + k] = ans[k], ++k;
        i += k;
        j -= k;
    }
    return ans;
}

std::vector<int> z_algorithm(const std::string &s) {
    const int N = int(s.size());
    std::vector<int> v(N);
    for (int i = 0; i < N; i++) v[i] = s[i];
    return z_algorithm(v);
}
#line 2 "string/test/z_algorithm.test.cpp"
#include <cstdio>
#include <iostream>
#line 5 "string/test/z_algorithm.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/zalgorithm"

int main() {
    std::string S;
    std::cin >> S;
    for (auto x : z_algorithm(S)) printf("%d ", x);
}

Back to top page