模板—AC自动机

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 using namespace std;
 struct trie
 {
     int count;
     trie *next[],*fail;
 }*q[];
 int head,tail;
 char keyword[];
 char str[];

 trie *Newtrie()
 {
     int i;
     trie *temp=new trie;
     temp->count=;
     for(int i=;i<;i++)temp->next[i]=NULL;
     temp->fail=NULL;
     return temp;
 }
 void insert(trie *p,char s[])
 {
     int i=,index;
     trie *temp=p;
     while(s[i])
     {
         index=s[i]-'a';
         if(temp->next[index]==NULL)temp->next[index]=Newtrie();
         temp=temp->next[index];
         i++;
     }
     temp->count++;
 }
 void build_ac(trie *root)
 {
     int i=,index;
     q[++tail]=root;
     root->fail=NULL;
     while(head!=tail)
     {
         trie *temp=q[++head];
         trie *p=NULL;
         for(int i=;i<;i++)
         {
             if(temp->next[i]!=NULL)
             {
                 if(temp==root) temp->next[i]->fail=root;
                 else
                 {
                     p=temp->fail;
                     while(p!=NULL)
                     {
                         if(p->next[i]!=NULL)
                         {
                             temp->next[i]->fail=p->next[i];
                             break;
                         }
                         p=p->fail;
                     }
                     if(p==NULL) temp->next[i]->fail=root;
                 }
                 q[++tail]=temp->next[i];
             }
         }
     }
 }
 int ask(trie *root)
 {
     int i=,cnt=,index,len;
     len=strlen(str);
     trie *p=root;
     while(str[i])
     {
         index=str[i]-'a';
         while(p->next[index]==NULL && p!=root)p=p->fail;
         p=p->next[index];
         if(p==NULL)p=root;
         trie *temp=p;
         while(temp!=root && temp->count!=-)
         {
             cnt+=temp->count;
             temp->count=-;
             temp=temp->fail;
         }
         i++;
     }
     return cnt;
 }
 signed main()
 {
     int n,T;
     trie *p;
     cin>>T;
     while(T--)
     {
         p=Newtrie();
         cin>>n;
         for(int i=;i<=n;i++)
         {
             cin>>keyword;
             insert(p,keyword);
         }
         cin>>str;
         build_ac(p);
         cout<<ask(p)<<endl;
     }
 }