HDU5880（AC自动机）

多模字符串匹配模板

#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string.h>
#include <queue>
using namespace std;
int ans[1000010],cnt[1000010];
struct Trie
{
    int next[1000010][26],fail[1000010],End[1000010];
    int root,L,pos;
    int newnode()
    {
        for(int i = 0; i < 26; i++) next[L][i] = -1;
        End[L++] = 0;
        return L-1;
    }
    void init()
    {
        L = 0,pos=0;
        root = newnode();
        memset(ans,0,sizeof(ans));
    }
    void Insert(char buf[])
    {
        int len = strlen(buf);
        int now = root;
        for(int i = 0; i < len; i++)
        {
            if(next[now][buf[i]-'a'] == -1)
                next[now][buf[i]-'a'] = newnode();
            now = next[now][buf[i]-'a'];
        }
        if(End[now]==0)
        {
            pos++;
            End[now]=pos;
            cnt[pos]=len;
        }
        else
        {
            if(cnt[End[now]]<len)
                cnt[End[now]]=len;
        }
    }
    void build()
    {
        queue<int>Q;
        fail[root] = root;
        for(int i = 0; i < 26; i++)
            if(next[root][i] == -1) next[root][i] = root;
            else
            {
                fail[next[root][i]] = root;
                Q.push(next[root][i]);
            }
        while( !Q.empty() )
        {
            int now = Q.front();
            Q.pop();
            for(int i = 0; i < 26; i++)
                if(next[now][i] == -1)
                    next[now][i] = next[fail[now]][i];
                else
                {
                    fail[next[now][i]]=next[fail[now]][i];
                    Q.push(next[now][i]);
                }
        }
    }
    int query(char buf[])
    {
        int len = strlen(buf);
        int now = root;
        int res = 0;
        for(int i = 0; i < len; i++)
        {
            if(buf[i]>='a'&&buf[i]<='z')
                now = next[now][buf[i]-'a'];
            else if(buf[i]>='A'&&buf[i]<='Z')
                now = next[now][buf[i]-'A'];
            else continue;
            int temp = now;
            while( temp != root )
            {
                ans[i+1]--;
                ans[i+1-cnt[End[temp]]]++;
                res += End[temp];
                //End[temp] = 0;
                temp = fail[temp];
            }
        }
        return res;
    }
    void debug()
    {
        for(int i = 0; i < L; i++)
        {
            printf("id = %3d,fail = %3d,End = %3d,chi = [",i,fail[i],End[i]);
            for(int j = 0; j < 26; j++)
                printf("%2d",next[i][j]);
            printf("]\n");
        }
    }
};
char buf[1000010];
Trie ac;
int main()
{
    int T;scanf("%d",&T);
    while( T-- )
    {
        int n;scanf("%d",&n);ac.init();
        for(int i = 0; i < n; i++)
        {
            scanf("%s",buf);
            ac.Insert(buf);
        }
        ac.build();
        getchar();
        gets(buf);
        ac.query(buf);
        int len=strlen(buf);int sum=0;
        for(int i=0;i<len;i++)
        {
            sum+=ans[i];
            if(sum>0)
                printf("*");
            else
                printf("%c",buf[i]);
        }
        puts("");
    }
    return 0;
}