LuoGu P3808 Aho Corasick Automaton

字符串经典算法

#include<bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
struct Aho_Corasick_Automaton {
    int ch[N][26], f[N], val[N], sz, rt,v[N];
    int newnode() { memset(ch[sz], -1, sizeof(ch[sz])), val[sz] = 0; return sz++; }
    void init() { sz = 0, rt = newnode(); }
    inline int idx(char c) { return c - 'a'; };
    void insert(const char* s) {
        int u = 0;
        for (int i = 0; s[i]; i++) {
            int c = idx(s[i]);
            if (ch[u][c] == -1) ch[u][c] = newnode();
            u = ch[u][c];
        }
        val[u]++;
    }
    void build() {
        queue<int> q;
        f[rt] = rt;
        for (int c = 0; c < 26; c++) {
            if (~ch[rt][c])f[ch[rt][c]] = rt, q.push(ch[rt][c]);
            else ch[rt][c] = rt;
        }
        while (!q.empty()){
            int u = q.front();
            q.pop();
            // val[u] |= val[f[u]];
            for (int c = 0; c < 26; c++){
                if (~ch[u][c])
                    f[ch[u][c]] = ch[f[u]][c], q.push(ch[u][c]);
                else
                    ch[u][c] = ch[f[u]][c];
            }
        }
    }
    //返回主串中有多少模式串
    int query(const char* s)
    {
        int u = rt;
        int res = 0;
        for (int i = 0; s[i]; i++)
        {
            int c = idx(s[i]);
            u = ch[u][c];
            int tmp = u;
            while (tmp != rt&&v[tmp]==0)
            {
                res += val[tmp];
                val[tmp] = 0;
                v[tmp]=1;
                tmp = f[tmp];
            }
        }
        return res;
    }
} aca;
char s[N];
int main() {
    aca.init();
    int n; cin >> n; for (int i = 1; i <= n; ++i)scanf("%s", s), aca.insert(s);
    aca.build();
    scanf("%s", s);
    cout << aca.query(s) << endl;
}