hdu 2222 ac自动机模版

来源：互联网发布：万圣节面具淘宝编辑：程序博客网时间：2024/05/22 08:26
#include<stdio.h>
#include<string.h>
structnode 
{ 
    intnum; 
    node *next[26],*fail;
    node()
    {
        num=0;
        fail=NULL;
        for(inti=0;i<26;i++) 
            next[i]=NULL;
    }
}*q[1000010]; 
charss[1010],s[55]; 
voidinsert(char s[],node *root) 
{ 
    intlen=strlen(s);
    node *p=root;
    for(inti=0;i<len;i++) 
    {
        if(p->next[s[i]-'a']==NULL)
            p->next[s[i]-'a']=newnode(); 
        p=p->next[s[i]-'a'];
    }
    p->num++;
} 
voidacmove(node *root) 
{ 
    inthead=0,tail=1; 
    root->fail=NULL;
    q[0]=root;
    while(head!=tail)
    {
        node *now=q[head++];
        node *p=NULL;
        for(inti=0;i<26;i++) 
        {
            if(now->next[i]!=NULL)
            {
                if(now==root) now->next[i]->fail=root;
                else
                {
                    p=now->fail;
                    while(p!=NULL)
                    {
                        if(p->next[i]!=NULL)
                        {
                            now->next[i]->fail=p->next[i];
                            break;
                        }
                        p=p->fail;
                    }
                    if(p==NULL)
                        now->next[i]->fail=root;
                }
                q[tail++]=now->next[i];
            }
        }
    }
} 
int find(node *root) 
{ 
    inti=0,numb=0,len=strlen(ss);
    node *p=root;
    while(ss[i])
    {
        while(p->next[ss[i]-'a']==NULL&&p!=root)
            p=p->fail;
        p=p->next[ss[i]-'a'];
        p=(p==NULL)?root:p;
        node *now=p;
        while(now!=root&&now->num!=0)
        {
            numb+=now->num;
            now->num=0;
            now=now->fail;
        }
        i++;
    }
    returnnumb; 
} 
int main() 
{ 
    intn; 
    node *root;
    scanf("%d",&n);
    while(n--)
    {
        intN; 
        root=NULL;
        root=newnode(); 
        scanf("%d",&N);
        for(inti=0;i<N;i++) 
        {
            scanf("%s",s);
            insert(s,root);
        }
        acmove(root);
        scanf("%s",ss);
        intw=find(root); 
        printf("%dn",w);
    }
    return0; 
}