bzoj3942 [Usaco2015 Feb]Censoring hash-CSDN博客

本文链接：https://blog.csdn.net/jpwang8/article/details/80380079

本文介绍了一种使用字符串哈希和KMP算法实现的文本审查方法，该方法能够有效地从较长的文本中移除特定子串的所有实例，直到源文本中不再包含该子串。通过实际的代码示例展示了如何实现这一过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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，则去掉这个后缀继续流程。

Solution

刷道水题压压惊
直接上字符串hash或者kmp都行

Code

#include <stdio.h>
#include <string.h>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)

typedef long long LL;
const int MOD1=1000000007;
const int MOD2=1000000009;
const int N=2000000;

LL hash1[N],hash2[N];
LL pow1[N],pow2[N];

char str[N],ptr[N],ans[N];

int main(void) {
    scanf("%s",str+1); int n=strlen(str+1);
    scanf("%s",ptr+1); int m=strlen(ptr+1);
    LL h1=0,h2=0;
    rep(i,1,m) h1=(h1*27%MOD1+ptr[i]-'a')%MOD1;
    rep(i,1,m) h2=(h2*27%MOD2+ptr[i]-'a')%MOD2;
    pow1[0]=1; rep(i,1,n) pow1[i]=pow1[i-1]*27%MOD1;
    pow2[0]=1; rep(i,1,n) pow2[i]=pow2[i-1]*27%MOD2;

    int now=0;
    rep(i,1,n) {
        now++; ans[now]=str[i];
        hash1[now]=(hash1[now-1]*27%MOD1+str[i]-'a')%MOD1;
        hash2[now]=(hash2[now-1]*27%MOD2+str[i]-'a')%MOD2;
        if (now>=m) {
            LL u1=(hash1[now]-hash1[now-m]*pow1[m]%MOD1+MOD1)%MOD1;
            LL u2=(hash2[now]-hash2[now-m]*pow2[m]%MOD2+MOD2)%MOD2;
            if (u1==h1&&u2==h2) {
                now-=m;
            }
        }
    }
    rep(i,1,now) printf("%c", ans[i]);
    return 0;
}