【模板】AC自动机

学习链接

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
#define maxn 10000005
using namespace std;

int ans[maxn];

struct Trie{
    int next[500010][26], fail[500010], end[500010];
    int root, L;
    int newnode()
    {
        for(int i=0;i<26;i++)
            next[L][i] = -1;
        end[L] = 0;
        return L++;
    }
    void Init()
    {
        L = 0;
        root = newnode();
    }
    void insert(char buf[]){
        int len = (int)strlen(buf);
        int now = root;
        for(int i=0;i<len;i++)
        {
            if(next[now][buf[i]-'a']==-1)
                next[now][buf[i]-'a'] = newnode();
            now = next[now][buf[i]-'a'];
        }
        end[now]++;
    }
    void build(){
        queue<int> Q;
        fail[root] = root;
        for(int i=0;i<26;i++)
            if(next[root][i]==-1)
                next[root][i] = root;
            else{
                fail[next[root][i]] = root;
                Q.push(next[root][i]);
            }
        while(!Q.empty()){
            int now = Q.front();
            Q.pop();
            for(int i=0;i<26;i++)
                if(next[now][i]==-1)
                    next[now][i] = next[fail[now]][i];
                else{
                    fail[next[now][i]] = next[fail[now]][i];
                    Q.push(next[now][i]);
                }
        }
    }
    int query(char buf[])
    {
        int len = (int)strlen(buf);
        int now = root;
        int res = 0;
        for(int i=0;i<len;i++)
        {
            now = next[now][buf[i]-'a'];
            int temp = now;
            while(temp!=root){
                res+=end[temp];
                end[temp] = 0;
                temp = fail[temp];
            }
        }
        return res;
    }
};

char buf[1000010];
Trie ac;

int main()
{
    int n, T;
    scanf("%d", &T);
    while(T--)
    {
        scanf("%d",&n);
        ac.Init();
        while(n--){
        	scanf("%s", buf);
        	ac.insert(buf);
        }
		ac.build();
		scanf("%s",buf);
		printf("%d\n", ac.query(buf));
    }
    
    
    return 0;
}