[模板]洛谷T3808 AC自动机(简单版)

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cstdlib>

#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<map>
#include<set>

#define inf 2147483647
#define ri register int
#define ll long long

using namespace std;

inline void read(int &x){
    x=0;
    char t=getchar();
    bool f=0;
    
    while(t<'0' || t>'9'){
        if(t=='-')f=1;
        t=getchar();
    }
    
    while(t>='0' && t<='9'){
        x=(x<<3)+(x<<1)+t-'0';
        t=getchar();
    }
    
    if(f)x=-x;
}

inline int idx(char t){
    return t-'a';
}

struct que{
    int q[1000005];
    int head,tail;
    
    inline void clear(){
        head=tail=0;
    }
    
    inline bool emp(){
        return head==tail;
    }
    
    inline void push(int x){
        q[tail]=x;
        tail++;
        if(tail==1000005)tail=0;
    }
    
    inline void pop(){
        head++;
        if(head==1000005)head=0;
    }
    
    inline int top(){
        return q[head];
    }
};

struct node{
    int ch[26];
    int val;
    int next;
    int last;
    
    inline void make(){
        memset(ch,0,sizeof(ch));
        val=next=last=0;
    }
};

inline void insert();
inline void bfs();
void work(int);

node trie[1000005];
int pn=1;

que q;

char S[1000005];
int lens;
char T[1000005];
int lent;

int n,poi=0,c,ans=0;

int main(){
    trie[0].make();
    
    read(n);
    
    for(ri i=1;i<=n;i++){
        scanf("%s",S+1);
        lens=strlen(S+1);
        insert();
    }
    
    bfs();
    
    scanf("%s",T+1);
    lent=strlen(T+1);
    
    for(ri i=1;i<=lent;i++){
        c=idx(T[i]);
        
        while(poi && !trie[poi].ch[c])poi=trie[poi].next;
        poi=trie[poi].ch[c];
        
        work(poi);
    }
    
    printf("%d
",ans);
    
    return 0;
}

inline void insert(){
    int u=0,c;
    
    for(ri i=1;i<=lens;i++){
        c=idx(S[i]);
        
        if(!trie[u].ch[c]){
            trie[pn].make();
            trie[u].ch[c]=pn;
            pn++;
        }
        
        u=trie[u].ch[c];
    }
    
    trie[u].val++;
}

inline void bfs(){
    int u,v;
    
    q.clear();
    
    for(ri i=0;i<26;i++)
        if(trie[0].ch[i])
            q.push(trie[0].ch[i]);
    
    while(!q.emp()){
        u=q.top();
        q.pop();
        
        for(ri i=0;i<26;i++){
            v=trie[u].ch[i];
            
            if(!v){
                trie[u].ch[i]=trie[trie[u].next].ch[i];
                continue;
            }
            
            q.push(v);
            trie[v].next=trie[trie[u].next].ch[i];
            if(trie[trie[v].next].val)
                trie[v].last=trie[v].next;
            else
                trie[v].last=trie[trie[v].next].last;
        }
    }
}

void work(int now){
    if(now){
        ans+=trie[now].val;
        trie[now].val=0;
        
        work(trie[now].last);
    }
}