AC自动机 HDOJ 5384 Danganronpa

题目传送门

 /*
     题意：多个文本串，多个模式串在每个文本串出现的次数
     AC自动机：这就是一道模板题，杭电有道类似的题目
 */
 /************************************************
 * Author        :Running_Time
 * Created Time  :2015-8-14 14:14:32
 * File Name     :AC.cpp
  ************************************************/

 #include <cstdio>
 #include <algorithm>
 #include <iostream>
 #include <sstream>
 #include <cstring>
 #include <cmath>
 #include <string>
 #include <vector>
 #include <queue>
 #include <deque>
 #include <stack>
 #include <list>
 #include <map>
 #include <set>
 #include <bitset>
 #include <cstdlib>
 #include <ctime>
 using namespace std;

 #define lson l, mid, rt << 1
 #define rson mid + 1, r, rt << 1 | 1
 typedef long long ll;
 const int MAXN = 1e5 + ;
 const int MAXNODE = 6e5 + ;
 const int INF = 0x3f3f3f3f;
 const int SIGMA_SIZE = ;
 const int MOD = 1e9 + ;
 ll res;
 struct AC   {
     int ch[MAXNODE][SIGMA_SIZE], f[MAXNODE], sz;
     ll val[MAXNODE];
     void init(void)   {
         memset (ch[], , sizeof (ch[]));
         sz = ; val[] = ;
     }
     int idx(char c) {
         return c - 'a';
     }
     void insert(string s) {
         int u = ;  int len = s.size ();
         for (int i=; i<len; ++i)   {
             int c = idx (s[i]);
             if (!ch[u][c])  {
                 memset (ch[sz], , sizeof (ch[sz]));
                 val[sz] = ;
                 ch[u][c] = sz++;
             }
             u = ch[u][c];
         }
         val[u]++;
     }
     void build(void)    {
         queue<int> Q;   f[] = ;
         for (int i=; i<SIGMA_SIZE; ++i)    {
             int u = ch[][i];
             if (u)  {
                 f[u] = ;   Q.push (u);
             }
         }
         while (!Q.empty ()) {
             int r = Q.front (); Q.pop ();
             for (int i=; i<SIGMA_SIZE; ++i)  {
                 int u = ch[r][i];
                 if (!u) {
                     ch[r][i] = ch[f[r]][i];    continue;
                 }
                 Q.push (u);
                 f[u] = ch[f[r]][i];
                 val[u] += val[f[u]];
             }
         }
     }
     ll query(string s)  {
         int len = s.size ();
         ll ret = ; int j = ;
         for (int i=; i<len; ++i)   {
             int c = idx (s[i]);
             j = ch[j][c];
             ret += val[j];
         }
         return ret;
     }
 }ac;
 string t[MAXN], p;

 int main(void)    {     //HDOJ 5384 Danganronpa
     int T;  scanf ("%d", &T);
     while (T--) {
         int n, m;   scanf ("%d%d", &n, &m);
         ac.init ();
         for (int i=; i<=n; ++i)    cin >> t[i];
         for (int i=; i<=m; ++i)    {
             cin >> p;    ac.insert (p);
         }
         ac.build ();
         for (int i=; i<=n; ++i)    {
             printf ("%I64d\n", ac.query (t[i]));
         }
     }

     return ;
 }