string/Zalgo.cpp

• View this file on GitHub
• Last update: 2021-09-12 23:44:25+09:00

Depends on

• template/template.cpp

Code

#pragma once
#include "../template/template.cpp"

template <class T>
vector<ll> zalgo(T v) {
    vector<ll> res(v.size());
    ll c = 0;
    REP(i, (ll)v.size()) {
        if (i + res[i - c] < c + res[c])
            res[i] = res[i - c];
        else {
            ll j = max(0ll, c + res[c] - i);
            while (i + j < (ll)v.size() && v[j] == v[i + j]) ++j;
            res[i] = j;
            c = i;
        }
    }
    res[0] = v.size();
    return res;
}

#line 2 "template/template.cpp"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define REV(i, n) for (int i = n - 1; i > 0; i--)
#define all(v) v.begin(), v.end()
#define PL pair<ll, ll>
#define PI pair<int, int>
#define pi acos(-1)
#define len(s) (int)s.size()
#define compress(v) \
    sort(all(v));   \
    v.erase(unique(all(v)), v.end());
#define comid(v, x) lower_bound(all(v), x) - v.begin()

template<class T>
using prique=priority_queue<T,vector<T>,greater<>>;

template <class T, class U>
inline bool chmin(T &a, U b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T, class U>
inline bool chmax(T &a, U b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
constexpr ll inf = 3e18;
#line 3 "string/Zalgo.cpp"

template <class T>
vector<ll> zalgo(T v) {
    vector<ll> res(v.size());
    ll c = 0;
    REP(i, (ll)v.size()) {
        if (i + res[i - c] < c + res[c])
            res[i] = res[i - c];
        else {
            ll j = max(0ll, c + res[c] - i);
            while (i + j < (ll)v.size() && v[j] == v[i + j]) ++j;
            res[i] = j;
            c = i;
        }
    }
    res[0] = v.size();
    return res;
}

Back to top page