String/KMP/Kmp.h

• View this file on GitHub
• Last update: 2025-06-11 15:37:14+07:00

Depends on

• template.h

Required by

• String/KMP/test_kmp.cpp

Code

#include "../../template.h"

vector<int> lps(const string &s) {
    int n = s.size();
    vector<int> pi(n);
    for (int i = 1; i < n; i++) {
        int j = pi[i-1];
        while (j > 0 && s[i] != s[j]) {
            j = pi[j - 1];
        }
        if (s[i] == s[j]) j++;
        pi[i] = j;
    }
    return pi;
}

vector<int> __KMP(const string &s, const string &t) {
    int n = s.size(), m = t.size();
    if (n == 0) return {};
    vector<int> pi = lps(s);
    int j = 0;
    vector<int> ans(m);
    for (int i = 0; i < m; i++) {
        while (j > 0 && t[i] != s[j]) {
            j = pi[j - 1];
        }
        if (t[i] == s[j]) j++;
        ans[i] = j;
        if (j == n) {
            j = pi[j - 1];
        }
    }
    return ans;
}

#line 2 "template.h"

#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define MOD (ll)(1e9+7)
#define all(x) (x).begin(),(x).end()
#define unique(x) x.erase(unique(all(x)), x.end())
#define INF32 ((1ull<<31)-1)
#define INF64 ((1ull<<63)-1)
#define inf (ll)1e18

#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second

const int mod = 998244353;

void solve();

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    // cin.exceptions(cin.failbit);
    // int t; cin >> t;
    // while(t--)
        solve();
    cerr << "\nTime run: " << 1000 * clock() / CLOCKS_PER_SEC << "ms" << '\n';
    return 0;
}
#line 2 "String/KMP/Kmp.h"

vector<int> lps(const string &s) {
    int n = s.size();
    vector<int> pi(n);
    for (int i = 1; i < n; i++) {
        int j = pi[i-1];
        while (j > 0 && s[i] != s[j]) {
            j = pi[j - 1];
        }
        if (s[i] == s[j]) j++;
        pi[i] = j;
    }
    return pi;
}

vector<int> __KMP(const string &s, const string &t) {
    int n = s.size(), m = t.size();
    if (n == 0) return {};
    vector<int> pi = lps(s);
    int j = 0;
    vector<int> ans(m);
    for (int i = 0; i < m; i++) {
        while (j > 0 && t[i] != s[j]) {
            j = pi[j - 1];
        }
        if (t[i] == s[j]) j++;
        ans[i] = j;
        if (j == n) {
            j = pi[j - 1];
        }
    }
    return ans;
}

Back to top page