SCU 4438 Censor(字符串哈希)

最新推荐文章于 2020-02-01 21:30:49 发布

原创最新推荐文章于 2020-02-01 21:30:49 发布 · 899 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

哈希

本文介绍了一个用于文本中敏感词过滤的高效算法实现。该算法通过构建哈希表和滑动窗口的方法来快速定位并移除文本中的敏感词汇。适用于大量文本的实时审查场景。

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

    abc
    aaabcbc
    b
    bbb
    abc
    ab

Sample Output

ab

#include<iostream>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<map>
#include<queue>
#include<vector>
#include<deque>
#include<stack>
using namespace std;
#define ull unsigned long long 
const int maxn=5000005;
ull h[maxn],hash[maxn],base=123;
char t1[maxn],t2[maxn];
struct node
{
	char t;
	ull x;
}c[maxn];
int main()
{
	h[0]=1;
	for(int i=1;i<maxn;i++)h[i]=h[i-1]*base;
	while(~scanf("%s%s",t1+1,t2+1))
	{
		int L1=strlen(t1+1),L2=strlen(t2+1);
		//printf("%d %d\n",L1,L2);
		if(L2<L1)printf("%s\n",t2+1);
		else
		{
			ull tt=0;
			for(int i=1;i<=L1;i++)tt=tt*base+t1[i];
			int tol=1;
			for(int i=1;i<=L2;i++)
			{
				node e;e.t=t2[i];
				if(tol==1)
				{
					e.x=t2[i];c[tol++]=e;
				}
				else
				{
					e.x=c[tol-1].x*base+t2[i];
					c[tol++]=e;
				}
				if(tol>L1)
				{
					if(c[tol-1].x-h[L1]*c[tol-L1-1].x==tt)
					{
						tol-=L1;
					}
				}
			}
			for(int i=1;i<tol;i++)printf("%c",c[i].t);
			printf("\n");
		}
	}
	return 0;
}