hdu2896病毒侵袭(ac自动机）

链接

ac自动机的模板题

说2个注意的地方 一是题目说明包含所有ASCII字符，可以开到0-127 包含空格

题目会输入多个源串，在加完当前的val值时，不应清0，可以开个标记数组。

 #include <iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<stdlib.h>
 #include<vector>
 #include<cmath>
 #include<queue>
 #include<set>
 using namespace std;
 #define N 100010
 #define M 510
 #define LL long long
 #define INF 0xfffffff
 const double eps = 1e-;
 const double pi = acos(-1.0);
 const double inf = ~0u>>;
 const int child_num = ;
 int g;
 int o[M];
 char s[N];
 bool f[M];
 class ACAutomo
 {
     private:
     int ch[N][child_num];
     int val[N];
     int fail[N];
     int Q[N];
     int id[];
     int sz;
     public:
     void init()
     {
         fail[] = ;
         for(int i = ; i < child_num ; i++)
         id[i] = i;
     }
     void reset()
     {
         memset(ch[],,sizeof(ch[]));
         sz = ;
     }
     void insert(char *a,int key)
     {
         int p =  ;
         for( ; *a ; a++)
         {
             int d = id[*a];
             if(ch[p][d]==)
             {
                 memset(ch[sz],,sizeof(ch[sz]));
                 val[p] = ;
                 ch[p][d] = sz++;
             }
             p = ch[p][d];
         }
         val[p]=key;
     }
     void construct()
     {
         int i,head=,tail = ;
         for(i =  ;i < child_num ; i++)
         {
             if(ch[][i])
             {
                 Q[tail++] = ch[][i];
                 fail[ch[][i]] = ;
             }
         }
         while(head!=tail)
         {
             int u = Q[head++];
             for(i = ; i < child_num ; i++)
             {
                 if(ch[u][i])
                 {
                     Q[tail++] = ch[u][i];
                     fail[ch[u][i]] = ch[fail[u]][i];
                 }
                 else
                 ch[u][i] = ch[fail[u]][i];
             }
         }
     }
     void work(char *s)
     {
         int i,k = strlen(s);
         memset(f,,sizeof(f));
         int p = ;
         for(i =  ;i < k ; i++)
         {
             int d = id[s[i]];
             p = ch[p][d];
             int tmp = p;
             while(tmp!=&&(val[tmp]!=||f[val[tmp]]))
             {
                 if(!f[val[tmp]])
                 o[g++] = val[tmp];
                 f[val[tmp]] = ;
                 tmp = fail[tmp];
             }
         }
     }
 }ac;
 int main()
 {
     int n,m,i;
     char vir[];
     ac.init();
     while(scanf("%d%*c",&n)!=EOF)
     {
         ac.reset();
         for(i = ; i <= n; i++)
         {
             gets(vir);
             ac.insert(vir,i);
         }
         scanf("%d%*c",&m);
         int ans = ;
         ac.construct();
         for(i = ; i <= m ;i++)
         {
             gets(s); g =  ;
             ac.work(s);
             if(g==) continue;
             printf("web %d:",i);
             sort(o,o+g);
             for(int j =  ;j < g ; j++)
             printf(" %d",o[j]);
             puts("");
             ans++;
         }
         printf("total: %d\n",ans);
     }
     return ;
 }