AC自动机

HDU 2222 模板题

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
const int Maxn=1001000;
int n,Kase,sz;
char str[Maxn];
int son[Maxn][30],Fail[Maxn],Word[Maxn];
bool vis[Maxn];
queue<int> Q;
inline void Init()
{
    memset(son,0,sizeof(son));
    sz=1; for (int i=1;i<=26;i++) son[0][i]=1;
    memset(Fail,0,sizeof(Fail));
    memset(Word,0,sizeof(Word));
    memset(vis,false,sizeof(vis));
}
inline void Insert(char * S)
{
    int len=strlen(S+1),pos=1;
    for (int i=1;i<=len;i++)
    {
        int t=S[i]-'a'+1;
        if (son[pos][t]) pos=son[pos][t]; else pos=son[pos][t]=++sz;
    }
    Word[pos]++;
}
inline void Make()
{
    Q.push(1); Fail[1]=0;
    while (!Q.empty())
    {
        int u=Q.front(); Q.pop();
        for (int i=1;i<=26;i++)
            if (son[u][i])
            {
                int k=Fail[u];
                while (!son[k][i]) k=Fail[k];
                Fail[son[u][i]]=son[k][i];
                Q.push(son[u][i]);
            }
    }
}
inline int Solve()
{
    int len=strlen(str+1),pos=1,Ans=0;
    for (int i=1;i<=len;i++)
    {
        vis[pos]=true;
        int t=str[i]-'a'+1;
        while (!son[pos][t]) pos=Fail[pos];
        pos=son[pos][t];
        if (!vis[pos])
            for (int j=pos;j;j=Fail[j])
            {
                Ans+=Word[j];
                Word[j]=0;
            }
    }
    return Ans;
}
int main()
{
    scanf("%d",&Kase);
    for (int kase=1;kase<=Kase;kase++)
    {
        scanf("%d",&n);  Init();
        for (int i=1;i<=n;i++)
        {
            scanf("%s",str+1);
            Insert(str);
        }
        Make();
        scanf("%s",str+1);
        printf("%d
",Solve());
    }
    return 0;
}