HDU 5800 Family View

Family View

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1500    Accepted Submission(s): 279

Problem 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 n , represneting the size of the forbidden words list P . Each line of the next n lines contains a forbidden words Pi (1≤|Pi|≤1000000,∑|Pi|≤1000000) where Pi only contains lowercase letters.

The last line contains a string T (|T|≤1000000) .

 

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.
  
  

 

Source

2016 ACM/ICPC Asia Regional Qingdao Online

 

Recommend

wange2014   |   We have carefully selected several similar problems for you:   5932  5931  5930  5928  5925 

 

文本匹配的ac自动机，有点扫描线的意思。将出现过的文本串变成*号。记录下串的长度，找到初始的位置，类似扫描线，直接标记下就行了。

#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string.h>
#include <queue>
using namespace std;
int vis[1000005];
int d[1000005];
struct Trie
{
    int next[1000005][26],fail[1000005],end[1000005];
    int root,L;
    int newnode()
    {
        for(int i = 0; i < 26; i++)
            next[L][i] = -1;
        end[L++] = 0;
        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]=1;
        d[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;
        int q;
        for(int i = 0; i < len; i++)
        {
            if(buf[i]>='a' &&buf[i]<='z')
                q=buf[i]-'a';
            else if(buf[i]>='A' &&buf[i]<='Z')
                q=buf[i]-'A';
            else
                continue;
            now = next[now][q];
            int temp = now;
            while( temp != root )
            {
                if(end[temp])
                {
                    vis[i+1]--;   //结束的位置
                    vis[i-d[temp]+1]+=1;   //初始位置。  //利用区间内的a[l]++  a[r+1]-- 这个原理将这个串的所有长度都标记为正数
                    break;
                }
                temp = fail[temp];
            }
        }
    }
    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 < 128; j++)
                printf("%2d",next[i][j]);
            printf("]\n");
        }
    }
}  ac;
char s[1000005];
char s1[1000005];
int main()
{
    int n;
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        memset(vis,0,sizeof(vis));
        ac.init();
        for(int i=0; i<n; i++)
        {
            scanf("%s",s1);
            ac.insert(s1);
        }
        getchar();
        ac.build();
        gets(s);
        int x=strlen(s);
        ac.query(s);
        int res=0;
        for(int i=0; i<x; i++)
        {
            res+=vis[i];
            if(res>0)
                printf("*");
            else
                printf("%c",s[i]);
        }
        printf("\n");
    }
    return 0;
}