3942: [Usaco2015 Feb]Censoring
3942: [Usaco2015 Feb]Censoring
Time Limit: 10 Sec Memory Limit: 128 MB
Submit: 964 Solved: 480
[Submit][Status][Discuss]
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^6 characters. From this, he would like to remove occurrences of a substring T to censor the inappropriate content. To do this, Farmer John finds the first occurrence of T in S and deletes it. He then repeats the process again, deleting the first occurrence of T again, continuing until there are no more occurrences of T in S. Note that the deletion of one occurrence might create a new occurrence of T that didn't exist before.
Please help FJ determine the final contents of S after censoring is complete
有一个S串和一个T串,长度均小于1,000,000,设当前串为U串,然后从前往后枚举S串一个字符一个字符往U串里添加,若U串后缀为T,则去掉这个后缀继续流程。
Input
The first line will contain S. The second line will contain T. The length of T will be at most that of S, and all characters of S and T will be lower-case alphabet characters (in the range a..z).
Output
The string S after all deletions are complete. It is guaranteed that S will not become empty during the deletion process.
Sample Input
whatthemomooofun
moo
Sample Output
whatthefun
HINT
Source
KMP
建一个栈表示未被匹配的字符
每次只要看一看新加入的字符是否能接栈顶继续匹配,不行的话不断查找nex数组知道可以为止,
每次匹配长度达到c串长度时栈的深度-c串长度
#include<iostream>
#include<cstdio>
#define M 4000000
using namespace std;
int la[M],i,m,n,j,k,a[M][2],nex[M],b[M],top,t;
char d[M],c[M];
int main()
{
scanf("%s%s",d+1,c+1);
for(n=1;1;n++) if(d[n]<'a' || d[n]>'z') break;
for(m=1;1;m++) if(c[m]<'a' || c[m]>'z') break;
n-=1; c[m]='&'; m-=1; kmp(c);
for(int i=2,j=0; i<=m;i++)
{
while(j && (c[i]!=c[j+1])) j=nex[j];
if(c[j+1]==c[i]) j+=1;
nex[i]=j;
}
for(i=1;i<=n;i++)
{
t=a[top][0];
if(c[a[top][0]+1]==d[i]) t=a[top][0];
else while(t && d[i]!=c[t+1]) t=nex[t];
if(c[t+1]!=d[i]) t=-1;
top+=1;
a[top][0]=t+1; a[top][1]=i;
if(a[top][0]==m) top-=m;
}
for(i=1;i<=top;i++) printf("%c",d[a[i][1]]);
}
最新文章
- 【完全开源】知乎日报UWP版:增加Live磁贴、Badge、以及Toast通知
- device tree 生成device node 到 platform_device
- Populating Tabular Data Block Manually Using Cursor in Oracle Forms
- 兼容FF 加入收藏夹和设为首页
- 删除undotbs后,数据库无法启动
- winform 批量导入本地sql文件,批量导入mdb(access)文件到sqlserver
- C#中方法的参数修饰符
- [BZOJ 1576] [Usaco2009 Jan] 安全路经Travel 【树链剖分】
- asp.net数据库操作类(一)
- 三大框架之hibernate的反转
- LeetCode 106. Construct Binary Tree from Inorder and Postorder Traversal (用中序和后序树遍历来建立二叉树)
- Java消息队列--ActiveMq 初体验
- python之匿名函数lambda
- Unity3D Adam Demo的学习与研究
- 什么是 MIME TYPE?
- The zero inflated negative binomial distribution
- ASP.NET Web API + Elasticsearch 6.x 快速做个全文搜索
- phpVirtualBox – 用浏览器操作虚拟机
- [Vue warn]: Invalid prop: custom validator check failed for prop ";xxx";.问题
- hexo安装总结