light oj 1427(ac自动机)

 #include <bits/stdc++.h>

 using namespace std;

 const int N = *;
 const int M = ;

 map<string,int>Map;
 struct Trie
 {
     int next[N][M],fail[N],end[N];
     int root,L;
     int newnode()
     {
         for(int i = ; i < ; i++)
             next[L][i] = -;
         end[L++] = -;
         return L - ;
     }
     void init()
     {
         L = ;
         root = newnode();
     }
     void insert(string s,int id)
     {
         int len = s.size();
         int now = root;
         for(int i = ; i < len; i++)
         {
             if(next[now][s[i]-'a'] == -)
                 next[now][s[i] - 'a'] = newnode();
             now = next[now][s[i] - 'a'];
         }
         end[now] = id;
     }
     void build()
     {
         queue<int>Q;
         fail[root] = root;
         for(int i = ; i < ; i++)
         {
             if(next[root][i] == -)
                 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 = ; i < ; i++)
             {
                 if(next[now][i] == -)
                     next[now][i] = next[fail[now]][i];
                 else
                 {
                     fail[next[now][i]] = next[fail[now]][i];
                     Q.push(next[now][i]);
                 }
             }
         }
     }
     int num[];
     void query(char buf[],int n,int mm[])
     {
         for(int i = ; i <= n; i++)
             num[i] = ;
         int len = (int)strlen(buf);
         int now = root;
         for(int i = ; i < len; i++)
         {
             now = next[now][buf[i]-'a'];
             int temp = now;
             while( temp != root )
             {
                 if( end[temp] != -)
                     num[end[temp]]++;
                 temp = fail[temp];
             }
         }
         for(int i = ; i <= n; i++)
                 printf("%d\n",num[mm[i]]);
     }
 };

 char buf[];
 Trie ac;

 void solve()
 {
     ac.init();
     int n, l = ;
     scanf("%d",&n);
     scanf("%s",buf);
     Map.clear();
     int twice[];
     memset(twice,,sizeof(twice));
     for(int i = ; i <= n; i++)
     {
         string ss;
         cin>>ss;
         int c = Map[ss];
         if(c == )
         {
             Map[ss] = ++l;
             ac.insert(ss,l);
         }
         twice[i] = Map[ss];
         //int tmp = Map[ss];

     }
     ac.build();

     ac.query(buf,n,twice);
 }

 int main(void)
 {
     int t,cnt = ;
     scanf("%d",&t);
     while(t--)
     {
         printf("Case %d:\n",++cnt);
         solve();
     }

     return ;
 }