2015 四川省赛 C Censor(哈希 | KMP)

题意:

N<=5×106,M<=5×106,,

分析:

,M,M,
,KMPnext,KMP,pre
M,pre
,hi,hm=hiMAGICmhimM

代码:
哈希

//
//  Created by TaoSama on 2015-10-01
//  Copyright (c) 2015 TaoSama. All rights reserved.
//
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 5e6 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;
const int H = 107;

char s[N], t[N];
int stk[N], top;

typedef long long LL;
LL h[N];

int main() {
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
//  freopen("out.txt","w",stdout);
#endif
    ios_base::sync_with_stdio(0);

    while(scanf("%s%s", t, s) == 2) {
        int n = strlen(s), m = strlen(t);
        LL power = 1, target = 0;
        for(int i = 0; i < m; ++i) {
            power = power * H % MOD;
            target = (target * H % MOD + t[i]) % MOD;
        }

        top = 0;
        for(int i = 0; i < n; ++i) {
            stk[++top] = s[i];
            h[top] = (h[top - 1] * H % MOD + stk[top]) % MOD;
            while(top >= m) {
                LL cur = (h[top] - power * h[top - m] % MOD + MOD) % MOD;
                if(cur == target) top -= m;
                else break;
            }
        }
        for(int i = 1; i <= top; ++i) putchar(stk[i]);
        puts("");
    }
    return 0;
}

KMP

//
//  Created by TaoSama on 2015-10-01
//  Copyright (c) 2015 TaoSama. All rights reserved.
//
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 5e6 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;

int n, m;
char s[N], t[N];
int nxt[N], pre[N];

void getNxt(char *s) {
    nxt[0] = -1;
    int i = 0, j = -1;
    while(i < m) {
        if(j == -1 || s[i] == s[j]) nxt[++i] = ++j;
        else j = nxt[j];
    }
}

char stk[N];
int top;
int h[N];

int main() {
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
//  freopen("out.txt","w",stdout);
#endif
    ios_base::sync_with_stdio(0);

    while(scanf("%s%s", t, s) == 2) {
        n = strlen(s), m = strlen(t);
        getNxt(t);

//        for(int i = 0; i < n; ++i) printf("%3c", s[i]); puts("");
//        for(int i = 0; i < n; ++i) printf("%3d", i); puts("");

        top = 0;
        for(int i = 0, j = 0; i < n; ++i) {
            stk[++top] = s[i];
            while(j > 0 && stk[top] != t[j]) j = nxt[j];
            if(stk[top] == t[j]) ++j;
            if(j == m) {
                top -= m;
                j = pre[top];
            }
            pre[top] = j;
        }
        for(int i = 1; i <= top; ++i) putchar(stk[i]);
        puts("");
    }
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值