HDU 5880 Family View (AC自动机)

题意：

模拟敏感词和谐器，T 组数据，每组数据 N 个子串，一个母串，输出和谐的母串

思路：

母串带空格，用gets就行，用子串的长度做标记，匹配时若匹配到，和谐掉’标记数‘个数个字符就行。

代码：

#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string.h>
#include <queue>
using namespace std;
struct Trie
{
    int next[1000100][26],fail[1000100],end[1000100];
    int root,L;
    int newnode()
    {
        for(int i = 0; i < 26; i++)
            next[L][i] = -1;
        end[L++] = -1;
        return L-1;
    }
    void init()
    {
        L = 0;
        root = newnode();
    }
    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'];
        }
        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]);
                }
        }
    }
    void query(char buf[])
    {
        int len = strlen(buf);
        int now = root;
        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 now = root;
            int temp = now;
            while( temp != root )
            {
                if(end[temp] != -1){
                    for(int j = 1;j <= end[temp];j++)
                        buf[i-j+1] = '*';
                }
                temp = fail[temp];
            }
        }
        puts(buf);
        return ;
    }
};
char buf[1000100];char str[1000100];
Trie ac;
int main()
{
    ios::sync_with_stdio(false);
    int n,T;
    scanf("%d",&T);
    while( T-- )
    {
        scanf("%d",&n);
        ac.init();
        gets(str);
        for(int i = 0; i < n; i++)
        {
            gets(str);
            ac.insert(str);
        }

        ac.build();
        gets(buf);
        ac.query(buf);
    }
    return 0;
}

Description

Steam is a digital distribution platform developed by Valve Corporation offering digital rights management (DRM), multiplayer gaming and social networking services. A family view can help you to prevent your children access to some content which are not suitable for them. 

Take an MMORPG game as an example, given a sentence T, and a list of forbidden words {P}, your job is to use '*' to subsititute all the characters, which is a part of the substring matched with at least one forbidden word in the list (case-insensitive). 

For example, T is: "I love Beijing's Tiananmen, the sun rises over Tiananmen. Our great leader Chairman Mao, he leades us marching on." 

And {P} is: {"tiananmen", "eat"} 

The result should be: "I love Beijing's *********, the sun rises over *********. Our gr*** leader Chairman Mao, he leades us marching on."

Input

The first line contains the number of test cases. For each test case: 
The first line contains an integer  , represneting the size of the forbidden words list  . Each line of the next   lines contains a forbidden words   where   only contains lowercase letters. 

The last line contains a string  .

Output

For each case output the sentence in a line.

Sample Input

1
3
trump
ri
o
Donald John Trump (born June 14, 1946) is an American businessman, television personality, author, politician, and the Republican Party nominee for President of the United States in the 2016 election. He is chairman of The Trump Organization, which is the principal holding company for his real estate ventures and other business interests.

Sample Output

D*nald J*hn ***** (b*rn June 14, 1946) is an Ame**can businessman, televisi*n pers*nality, auth*r, p*litician, and the Republican Party n*minee f*r President *f the United States in the 2016 electi*n. He is chairman *f The ***** *rganizati*n, which is the p**ncipal h*lding c*mpany f*r his real estate ventures and *ther business interests.