HDU2222（Keywords Search，AC自动机)

传送门

Keywords Search

Time Limit: 1000MS

Memory Limit: 32768KB

64bit IO Format: %I64d & %I64u

Description

In the modern time, Search engine came into the life of everybody like Google, Baidu, etc.
Wiskey also wants to bring this feature to his image retrieval system.
Every image have a long description, when users type some keywords to find the image, the system will match the keywords with description of image and show the image which the most keywords be matched.
To simplify the problem, giving you a description of image, and some keywords, you should tell me how many keywords will be match.

 

Input

First line will contain one integer means how many cases will follow by.
Each case will contain two integers N means the number of keywords and N keywords follow. (N <= 10000)
Each keyword will only contains characters 'a'-'z', and the length will be not longer than 50.
The last line is the description, and the length will be not longer than 1000000.

 

Output

Print how many keywords are contained in the description.

 

Sample Input

1 5 she he say shr her yasherhs

 

Sample Output

3

 

写的第一道AC自动机。。同样是裸题，但是。。。

我TM的交了35次TTTTTTTTTTTTTTTTTT_______TTTTTTTTTTTTTTTTTTT

....恩。。。在match函数里。。

int id = st[i]-'a',cur=ch[cur][id]; 与 int id = st[i]-'a';cur=ch[cur][id];

一个字符的区别。。艹

#include <set>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int SONS = 26;
const int MAXN = 500100;
#define For(i,n) for(int i=1;i<=n;i++)
#define For0(i,n) for(int i=0;i<n;i++)
#define Rep(i,l,r) for(int i=l;i<=r;i++)
int T,ans,n;
char goal[MAXN*2];

struct trie{
    int sz,ch[MAXN][SONS],v[MAXN],next[MAXN],Q[MAXN];
    void clr(){sz=0;memset(ch[0],0,sizeof(ch[0]));}
    void insert(char *st){
        int len=strlen(st),cur=0;
        For0(i,len){
            int id=st[i]-'a';
            if(!ch[cur][id]) {
                ch[cur][id]=++sz;
                v[sz]=0;memset(ch[sz],0,sizeof(ch[sz]));
            }
            cur=ch[cur][id];
        }
        v[cur]++;
    }
    void BuildNext(){
        int l=0,r=0;
        For0(i,SONS)
          if(ch[0][i]) {
              Q[++r]=ch[0][i];
              next[Q[r]]=0;
          }
        while(l<r){
            int cur=Q[++l];
            For0(i,SONS)
              if(!ch[cur][i]) ch[cur][i]=ch[next[cur]][i];
              else{
                  Q[++r]=ch[cur][i];
                  next[ch[cur][i]]=ch[next[cur]][i];
              }
        }
    }
    void match() {
        int cur = 0,len=strlen(goal);
        For0(i,len){
            int id = goal[i]-'a';cur = ch[cur][id];
            int now = cur;
            while(now) {
                ans += v[now];v[now] = 0;
                now = next[now];
            }
        }
    }
}ac;

int main(){
    scanf("%d",&T);
    For(i,T){
        scanf("%d",&n);
        ac.clr();
        while(n--){
            scanf("%s",&goal);
            ac.insert(goal);
        }
        ac.BuildNext();
        scanf("%s",&goal);
        ac.match();
        printf("%d
",ans);ans=0;
    }
    return 0;
}