Censor

frog is now a editor to censor so-called sensitive words (敏感词).

She has a long text p

. Her job is relatively simple -- just to find the first occurence of sensitive word w

and remove it.

frog repeats over and over again. Help her do the tedious work.

Input

The input consists of multiple tests. For each test:

The first line contains 1

string w. The second line contains 1 string p

(1≤length of w,p≤5⋅106

, w,p

consists of only lowercase letter)

Output

For each test, write 1

string which denotes the censored text.

Sample Input

    abcaaabcbcbbbbabcab

Sample Output

    aab分析：每次删第一个模板串，删掉后重复这个操作，问最后剩下的串；　　　kmp可以找到模板串，关键是删掉后怎么回溯；　　　直接记录答案数组，删掉模板串相当于下标-len，这样就能轻松回溯；　　　比赛时居然傻傻地记录最长已删长度，然后回溯，真是太蠢了。。。代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <bitset>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <cassert>
#include <ctime>
#define rep(i,m,n) for(i=m;i<=n;i++)
#define mod 1000000009
#define inf 0x3f3f3f3f
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define pi acos(-1.0)
#define pii pair<int,int>
#define sys system("pause")
const int maxn=5e6+10;
const int N=2e5+10;
using namespace std;
ll gcd(ll p,ll q){return q==0?p:gcd(q,p%q);}
ll qpow(ll p,ll q){ll f=1;while(q){if(q&1)f=f*p%mod;p=p*p%mod;q>>=1;}return f;}
int n,m,k,t,dp[maxn],nxt[maxn];
char a[maxn],b[maxn],ret[maxn];
int main()
{int i,j;while(~scanf("%s%s",a,b)){int len=strlen(a);nxt[0]=j=-1;i=0;while(a[i]){while(!(j==-1||a[i]==a[j]))j=nxt[j];nxt[++i]=++j;}i=j=k=0;while(b[i]){ret[++k]=b[i];while(!(j==-1||b[i]==a[j]))j=nxt[j];++i,++j;dp[k]=j;if(j==len){k-=len;j=dp[k];}}ret[++k]=0;printf("%s\n",ret+1);}return 0;
}

转载于:https://www.cnblogs.com/dyzll/p/6791347.html

SCU Censor相关推荐

Censor SCU - 4438 (hash 哈希做法)
Censor SCU - 4438 题意:给你两串字符串w和p.在p中不停删除w,直到p中没有w.输出此时剩余的字符串. 解题思路: 字符串问题考虑hash做法.先求出字符串w的哈希值.然后遍历字符串 ...
【哈希-字符串匹配+模拟栈】SCU - 4438: Censor（哈希详解哈哈哈）
写在前:由于哈希没有好好听讲,也没有下来看.这是排位我开的第一道题,直接string暴力T了.昨天其实就看了哈希,太浮躁,于是本来很简单的哈希愣是没看懂.(于是放弃去看爱5了23333333)今天补上 ...
Censor SCU - 4438 (KMP)
题目来源: https://vjudge.net/contest/297070#problem/C http://acm.scu.edu.cn/soj/problem.action?id=4438 C ...
ACM: SCU 4438 Censor - KMP
SCU 4438 Censor Time Limit:0MS Memory Limit:0KB 64bit IO Format:%lld & %llu Practice Des ...
SCU - 4438 Censor
Censor frog is now a editor to censor so-called sensitive words (敏感词). She has a long text pp. Her j ...
SCU - 4438 Censor
Censor frog is now a editor to censor so-called sensitive words (敏感词). She has a long text p . Her j ...
SCU - 4438 Censor （KMP）
Censor frog is now a editor to censor so-called sensitive words (敏感词). She has a long text pp. Her j ...
SCU - 4438——Censor（哈希）
题目链接:http://acm.scu.edu.cn/soj/problem.action?id=4438 题意:给出一个串a和串b,串b中如果有a串则删除,删除后b剩下的串再连到一起,再找串a,反复 ...
C - Censor SCU - 4438
Censor frog is now a editor to censor so-called sensitive words (敏感词). She has a long text p. Her jo ...

SCU Censor