「CF1200E」Compress Words【三哈希】

E. Compress Words

time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output

Amugae has a sentence consisting of $n$ words. He want to compress this sentence into one word. Amugae doesn’t like repetitions, so when he merges two words into one word, he removes the longest prefix of the second word that coincides with a suffix of the first word. For example, he merges “sample” and “please” into “samplease”.

Amugae will merge his sentence left to right (i.e. first merge the first two words, then merge the result with the third word and so on). Write a program that prints the compressed word after the merging process ends.

Input

The first line contains an integer $n$ $(1\le n\le 10^5)$, the number of the words in Amugae’s sentence.

The second line contains $n$ words separated by single space. Each words is non-empty and consists of uppercase and lowercase English letters and digits (‘A’, ‘B’, …, ‘Z’, ‘a’, ‘b’, …, ‘z’, ‘0’, ‘1’, …, ‘9’). The total length of the words does not exceed $10^6$.

Output

In the only line output the compressed word after the merging process ends as described in the problem.

Examples

5
I want to order pizza

Iwantorderpizza

5
sample please ease in out

sampleaseinout

题意

• 就是给你n个字符串，开始你有一个空串，然后从左至右，每次将当前字符串与手中的串合并，合并指将手中串与当前串的最长公共后缀与前缀合并在一起，求最后手中的串

题解

• 当然$KMP$是可搞的吧，当前字符串放到手中字符串前面跑$KMP$
• 其实这一题可以$hash$搞，三哈希比较稳，单哈希好像被卡了

#include<bits/stdc++.h>

using namespace std;
const int maxn=1e6+10;

struct Hash{
    int base[4],mod[4];
    int tot,hash[4][maxn],pw[4][maxn]; //字符串长度,hash:记从1~i的hash值，pw:记录base^i
    Hash() {
        tot=0;
        for(int i=1;i<=3;i++) pw[i][0]=1;
        base[1]=233;base[2]=19260817;base[3]=20030714;
        mod[1]=1e9+7;mod[2]=1e9+9;mod[3]=998244353;
    }

    void init() {
        tot=0;
    }
    void insert(int c) {
        tot++;
        for(int i=1;i<=3;i++) hash[i][tot]=(1LL*hash[i][tot-1]*base[i]+c)%mod[i];
        for(int i=1;i<=3;i++) pw[i][tot]=(1LL*pw[i][tot-1]*base[i])%mod[i];
    }
    //字符串[l,r]hash值,type为第几个hash
    int query(int l,int r,int type) { 
        return (hash[type][r]-(1LL*hash[type][l-1]*pw[type][r-l+1]%mod[type])+mod[type])%mod[type];
    }
    //判断字符串u的[lu,ru]内的字符串和字符串v的[lv,rv]内的字符串是否相同
    friend bool same(Hash &u,int lu,int ru,Hash &v,int lv,int rv) { 
        if(ru-lu!=rv-lv) return false;
        for(int i=1;i<=3;i++) if(u.query(lu,ru,i)!=v.query(lv,rv,i)) return false;
        return true;
    }

}h1,h2;

char s[maxn];
char ans[maxn];
int len=0,n;

int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++) {
        scanf("%s",s+1);
        int m=strlen(s+1);
        if(i==1) {
            for(int j=1;j<=m;j++) {h1.insert(s[j]);ans[j]=s[j];}
            len=m;
        }else{
            int id=0;h2.init();
            for(int j=1;j<=m;j++) {
                h2.insert(s[j]);
                if(same(h1,max(1,h1.tot-j+1),h1.tot,h2,1,h2.tot)) id=j;
            }
            for(int j=id+1;j<=m;j++)  {
                h1.insert(s[j]);
                ans[++len]=s[j];
            }
        }
    }
    for(int i=1;i<=len;i++) printf("%c",ans[i]);
}