HDU 5880 Family View

/*
HDU 5880 Family View
http://acm.hdu.edu.cn/showproblem.php?pid=5880
AC自动机
注意不要直接全把节点初始化，将其当做内存池来用，
用的时候再初始化，否则会MLE
*/
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
const int Nmax=1000010;
const int Totmax=1000010;
struct Aho
{
    struct State
    {
        int next[26];
        int cnt,fail,num;
    }state_table[Totmax];

    int size;
    int ans[Nmax];
    queue<int> Q;
    void init()
    {
        for(int i=0;i<Nmax;i++)
            ans[i]=0;
        while(Q.size())
            Q.pop();
        for(int j=0;j<26;j++)                
            state_table[0].next[j]=-1;
        state_table[0].fail=state_table[0].cnt=state_table[0].num=0;
        size=1;
    }

    void insert(char *s)
    {
        int n=strlen(s);
        int now=0;
        for(int i=0;i<n;i++)
        {
            char c=s[i];
            if(state_table[now].next[c-'a']==-1)
            {
                for(int j=0;j<26;j++)
                    state_table[size].next[j]=-1;
                state_table[size].cnt=state_table[size].fail=state_table[size].num=0;
                state_table[now].next[c-'a']=size++;
            }
            now=state_table[now].next[c-'a'];
        }
        state_table[now].cnt++;
        state_table[now].num=n;
    }

    void build()
    {
        Q.push(0);
        state_table[0].fail=0;
        while(Q.size())
        {
            int now=Q.front();
            Q.pop();
            for(int i=0;i<26;i++)
            {
                if(now==0)
                {
                    if(state_table[now].next[i]==-1)
                        state_table[now].next[i]=0;
                    else
                    {
                        state_table[ state_table[now].next[i] ].fail=0;
                        Q.push(state_table[now].next[i]);
                    }
                }
                else
                {
                    if(state_table[now].next[i]==-1)
                    {
                        state_table[now].next[i]=state_table[ state_table[now].fail ].next[i]; 
                    }    
                    else
                    {
                        state_table[ state_table[now].next[i] ].fail=state_table[ state_table[now].fail ].next[i];
                        Q.push(state_table[now].next[i]);
                    }
                }
                
            }
        }
    }

    void match(char *s)
    {
        int n=strlen(s);
        int now=0;
        for(int i=0;i<n;i++)
        {
            char c=s[i];
            if(c>='A' && c<='Z')
                now=state_table[now].next[c-'A'];
            else if(c>='a' && c<='z')
                now=state_table[now].next[c-'a'];
            else
                now=0;
            int x = now;
            while(x != 0)
            {
                if(state_table[x].cnt)
                {
                    int k=state_table[x].num;
                    int j=i;
                    while(k--)
                    {
                        s[j]='*';
                        j--;
                    }
                    break;
                }
                x = state_table[x].fail;
            }
 
        }
    }

     void solve(char *s)
     {
        int now = 0;
        int len = strlen(s);
        int index;
        for(int i = 0; i < len ; ++i)
        {
            if(s[i] >= 'A' && s[i] <= 'Z')
                index = s[i] - 'A';
            else if(s[i] >= 'a' && s[i] <= 'z')
                index = s[i] - 'a';
            else 
            {
                now=0;
                continue;
            }
            now =state_table[now].next[index];
            int x = now;
            while(x != 0)
            {
                if(state_table[x].cnt)
                {
                    ans[i + 1] -= 1;
                    ans[i - state_table[x].num + 1] += 1;
                    break;
                }
                x = state_table[x].fail;
            }
        }
    }

    void print(char *s)
    {
        long long res = 0;
        int len = strlen(s);
        for(int i = 0; i < len; ++i)
        {
            res += ans[i];
            if(res <= 0)
                printf("%c", s[i]);
            else printf("*");
        }
        puts("");
    }





}aho;
char s[Nmax];
int main()
{
    int t;
    //freopen("in.in","r",stdin);
    scanf("%d",&t);
    while(t--)
    {
        int n;
        aho.init();
        scanf("%d",&n);
        while(n--)
        {
            scanf("%s",s);
            aho.insert(s);
        }
        getchar();
        gets(s);
        //printf("%s
",s);
        aho.build();
        //aho.match(s);
        //printf("%s
",s); 
        
        aho.solve(s);
        aho.print(s);
        

    }
    return 0;
}