Bzoj3940 [Usaco2015 Feb]Censoring

Time Limit: 10 Sec  Memory Limit: 128 MB
Submit: 391  Solved: 183

Description

Farmer John has purchased a subscription to Good Hooveskeeping magazine for his cows, so they have plenty 

of material to read while waiting around in the barn during milking sessions. Unfortunately, the latest 

issue contains a rather inappropriate article on how to cook the perfect steak, which FJ would rather his 

cows not see (clearly, the magazine is in need of better editorial oversight).

FJ has taken all of the text from the magazine to create the string S of length at most 10^5 characters. 

He has a list of censored words t_1 ... t_N that he wishes to delete from S. To do so Farmer John finds 

the earliest occurrence of a censored word in S (having the earliest start index) and removes that instance 

of the word from S. He then repeats the process again, deleting the earliest occurrence of a censored word 

from S, repeating until there are no more occurrences of censored words in S. Note that the deletion of one 

censored word might create a new occurrence of a censored word that didn't exist before.

Farmer John notes that the censored words have the property that no censored word appears as a substring of 

another censored word. In particular this means the censored word with earliest index in S is uniquely 

defined.Please help FJ determine the final contents of S after censoring is complete.

FJ把杂志上所有的文章摘抄了下来并把它变成了一个长度不超过10^5的字符串S。他有一个包含n个单词的列表，列表里的n个单词

记为t_1...t_N。他希望从S中删除这些单词。 

FJ每次在S中找到最早出现的列表中的单词(最早出现指该单词的开始位置最小)，然后从S中删除这个单词。他重复这个操作直到S中

没有列表里的单词为止。注意删除一个单词后可能会导致S中出现另一个列表中的单词 

FJ注意到列表中的单词不会出现一个单词是另一个单词子串的情况，这意味着每个列表中的单词在S中出现的开始位置是互不相同的 

请帮助FJ完成这些操作并输出最后的S

 

Input

The first line will contain S. The second line will contain N, the number of censored words. The next N lines contain the strings t_1 ... t_N. Each string will contain lower-case alphabet characters (in the range a..z), and the combined lengths of all these strings will be at most 10^5.

第一行包含一个字符串S 

第二行包含一个整数N 

接下来的N行，每行包含一个字符串，第i行的字符串是t_i

 

Output

The string S after all deletions are complete. It is guaranteed that S will not become empty during the deletion process.

一行，输出操作后的S

 

 

 

Sample Input

begintheescapexecutionatthebreakofdawn
2
escape
execution

Sample Output

beginthatthebreakofdawn

HINT

 

Source

Gold

 

字符串 AC自动机

把待匹配的串建成AC自动机，记录每个串的长度。

用原串在AC自动机上转移，记录每一个位置所在的结点，并把该位置的字符压入栈中，如果在位置x匹配到一个串i，就回溯到x-len[i]位置的那个结点，同时弹对应层数的栈

 

/*by SilverN*/
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;
const int mxn=200010;
int len[mxn];
int st[mxn],top=0;
struct ACa{
    int t[mxn][26],fail[mxn],end[mxn];
    int pre[mxn],pos[mxn];
    int S,cnt;
    void init(){S=cnt=1;return;}
    void insert(char *s,int id){
        int now=S;
        int len=strlen(s);
        for(int i=0;i<len;i++){
            if(!t[now][s[i]-'a'])t[now][s[i]-'a']=++cnt;
            pre[t[now][s[i]-'a']]=now;
            now=t[now][s[i]-'a'];
        }
        end[now]=id;
        return;
    }
    void Build(){
        queue<int>q;
        for(int i=0;i<26;i++){
            if(t[S][i]) {fail[t[S][i]]=S,q.push(t[S][i]);}
            else t[S][i]=S;
        }
        while(!q.empty()){
            int u=q.front();q.pop();
            for(int i=0;i<26;i++){
                if(t[u][i]){
                    fail[t[u][i]]=t[fail[u]][i];
                    q.push(t[u][i]);
                }
                else {
                    t[u][i]=t[fail[u]][i];
//                  pre[t[u][i]]=u;
//                  printf("pre of %d is %d\n",t[u][i],pre[t[u][i]]);
                }
            }
        }
    }
    void debug(char *s){
        int now=S;int len=strlen(s);
        for(int i=0;i<len;i++){
            now=t[now][s[i]-'a'];
            printf("%d ",now);
        }
        printf("fin\n");
        return;
    }
    void solve(char *s){
        int Len=strlen(s);
        int now=S;
        int i,j;
        for(i=0;i<Len;i++){
            pos[i]=now;
            st[++top]=i;
            now=t[now][s[i]-'a'];
//          printf("now:%d end:%d\n",now,end[now]);
            if(end[now]){
                int id=end[now];
                top-=len[id]-1;
                now=pos[st[top]];
                top--;
/*              for(j=1;j<len[id];j++){
                    now=pre[now];
                    top--;
                }
                top--;*/
//              printf("st:%d  now:%d\n",st[top],now);
            }
        }
        for(i=1;i<=top;i++){
            printf("%c",s[st[i]]);
        }
        printf("\n");
        return;
    }
}ac;
char s[mxn];
int n;
char c[mxn];
int main(){
    int i,j;
    scanf("%s",s);
    scanf("%d",&n);
    ac.init();
    for(i=1;i<=n;i++){
        scanf("%s",c);
//      printf("%s  ",c);
        len[i]=strlen(c);
//      printf("len:%d\n",len[i]);
        ac.insert(c,i);
    }
//  scanf("%s",c);
//  ac.debug(c);
    ac.Build();
    ac.solve(s);
    return 0;
}