HDU 2846 (AC自动机+多文本匹配)

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include "cstdio"
#include "cstring"
#include "string"
#include "iostream"
#include "queue"
#include "vector"
#include "algorithm"
#include "map"
using namespace std;
#define maxn 26
int ans[100005],mt[100005];
string P[10005];
struct Trie
{
    Trie *next[maxn],*fail;
    int cnt;
}*root;
Trie *newnode()
{
    Trie *ret=new Trie;
    memset(ret->next,0,sizeof(ret->next));
    ret->fail=0;
    ret->cnt=0;
    return ret;
}
void init() {root=newnode();}
void Insert(string str,int index)
{
    Trie *pos=root;
    for(int i=0;i<str.size();i++)
    {
        int c=str[i]-‘a‘;
        if(!pos->next[c]) pos->next[c]=newnode();
        pos=pos->next[c];
    }
    pos->cnt=index;
}
void getfail()
{
    queue<Trie *> Q;
    for(int c=0;c<maxn;c++)
    {
        if(root->next[c])
        {
            root->next[c]->fail=root;
            Q.push(root->next[c]);
        }
        else root->next[c]=root;
    }
    while(!Q.empty())
    {
        Trie *x=Q.front();Q.pop();
        for(int c=0;c<maxn;c++)
        {
            if(x->next[c])
            {
                x->next[c]->fail=x->fail->next[c];
                Q.push(x->next[c]);
            }
            else x->next[c]=x->fail->next[c];
        }
    }
}
void Find(string str)
{
    map<int,int> Hash;
    Trie *pos=root,*last;
    for(int i=0;i<str.size();i++)
    {
        int c=str[i]-‘a‘;last;
        if(c<0||c>maxn) {pos=root;continue;}
        if(pos->next[c])
        {
            pos=pos->next[c];
            last=pos;
            while(last!=root)
            {
                if(!Hash.count(last->cnt))
                {
                    ans[last->cnt]++;
                    Hash[last->cnt]++;
                }
                last=last->fail;
            }
        }
    }
}
int main()
{
    //freopen("in.txt","r",stdin);
    ios::sync_with_stdio(false);
    int n,m,s;
    string tmp;
    while(cin>>n)
    {
        map<string,int> ms;
        memset(ans,0,sizeof(ans));
        memset(mt,0,sizeof(mt));
        init();
        for(int i=1;i<=n;i++) cin>>P[i];
        cin>>s;
        for(int i=1;i<=s;i++)
        {
            cin>>tmp;
            if(!ms.count(tmp))
            {
                Insert(tmp,i);
                ms[tmp]=i;
                mt[i]=i;
            }
            else mt[i]=ms[tmp];
        }
        getfail();
        for(int i=1;i<=n;i++) Find(P[i]);
        for(int i=1;i<=s;i++) cout<<ans[mt[i]]<<endl;
    }
}