Codeforces Round #578 Div. 2 E.Compress Words(KMP,Hash)

链接 ：https://codeforces.com/contest/1200/problem/E
解法一 : KMP
如无必要，勿增实体！！！我被一个语句坑了一个下午，int n = strlen(text)，因为每KMP里面都要计算一下，所以就增加了复杂度，然后一下午都在那里TLE，我还以为是板子错了，一直在网上找。结果就是这么一个小错误，，，

#include<iostream>
#include<cstring>
using namespace std;
const int MAXN = 1e6+5;
 
int fail[MAXN];
char S[MAXN], T[MAXN];
int slen;

void getFail(char s[],int len)
{ 
    int j=-1;
    fail[0]=-1;
    for(int i=1;i<len;++i)
    {
        while(j!=-1&&s[i]!=s[j+1])
            j=fail[j];         
        if(s[i]==s[j+1])
            j++;
        fail[i]=j; 
    }
}   
 
//返回T的前缀在S上的最大匹配点
int KMP(char text[],char pattern[])
{
    int m=strlen(pattern);
    getFail(pattern,m);
    int i = max(slen-m, 0);
    int j=-1;
    for(;i<slen;++i)
    {
        while(j!=-1&&text[i]!=pattern[j+1])
            j=fail[j];
        if(text[i]==pattern[j+1])
            j++;    
    }
    return j+1;
}
 
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    cin >> S;
    slen = strlen(S);
    for(int i = 2; i <= n; ++i)
    {
        cin >> T;
        int tlen = strlen(T);
        int pos = KMP(S, T);
        for(int j = pos; j < tlen; ++j)
        {
            S[slen] = T[j];
            slen++;
        }
    }
    cout << S << endl;
    return 0;
}

解法二：双哈希
cf中间怕被hack的话，进制数带个随机化就好了，但奇怪的是我用自然溢出竟然没有过，只有取模才能过，百思不得其解。先附上代码

#include<iostream>
#include<cstdlib>
#include<time.h>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const int MAXN = 1e6+10;
const int MOD1 = 900001;
const int MOD2 = 1000007;
 
char s[MAXN], ans[MAXN];
ll b1[MAXN], b2[MAXN];
ll base1, base2;
int slen;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    srand(time(0));
    base1 = rand() % MOD1;
    base2 = rand() % MOD2;
    b1[0] = b2[0] = 1;
    for(int i = 1; i < MAXN; ++i)
        b1[i] = b1[i-1] * base1 % MOD1;
    for(int i = 1; i < MAXN; ++i)
        b2[i] = b2[i-1] * base2 % MOD2;
    int n;
    cin >> n;
    for(int i = 1; i <= n; ++i)
    {
        cin >> s;
        int tlen = strlen(s);
        ll s1 = 0, s2 = 0;
        ll t1 = 0, t2 = 0;
        int cur = -1;
        for(int i = 0; i < min(slen, tlen); ++i)
        {
            t1 = (t1 * base1 + s[i]) % MOD1;
            t2 = (t2 * base2 + s[i]) % MOD2;
            s1 = (s1 + ans[slen-i-1] * b1[i]) % MOD1;
            s2 = (s2 + ans[slen-i-1] * b2[i]) % MOD2;
            if(t1 == s1 && t2 == s2){
                cur = i;
            }
        }
        for(int i = cur+1; i < tlen; ++i)
            ans[slen++] = s[i];
    }
    cout << ans << endl;
    return 0;
}