[codeforces1200E]Compress Words

最新推荐文章于 2025-08-11 19:11:21 发布

原创最新推荐文章于 2025-08-11 19:11:21 发布 · 504 阅读

0 ·

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

------------------字符串同时被 2 个专栏收录

26 篇文章

订阅专栏

----------------------模拟

19 篇文章

订阅专栏

这是一道关于字符串压缩的问题，Amugae希望将一个由n个单词组成的句子压缩成一个单词，压缩规则是：每次合并两个相邻单词时，移除第二个单词的最长前缀，该前缀与第一个单词的后缀相同。题目要求编写程序输出压缩后的单词。给定n个单词，需要找出压缩过程结束后的单词长度。解决方案提到可以使用哈希技巧，通过暴力枚举后缀长度来求解，时间复杂度为所有单词长度之和。

time limit per test : 1 second
memory limit per test : 256 megabytes

分数：2000，但是我觉得这个题挺神的。

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≤n≤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
Input

5
I want to order pizza

Output

Iwantorderpizza

Input

5
sample please ease in out

Output

sampleaseinout

题意：
给定 $n$ 个字符串，相邻的字符串可以让前一个字符串的一个后缀作为后一个字符串的前缀这样按顺序从头到尾拼接。
询问最终串的最短长度。

题解：
哈希，每次暴力枚举后缀长度即可。
复杂度是 $∑Leni\sum Len_i$ 的

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll MOD=200009300333LL;
char s[1000004],a[1000004];
int n;
int main(){
    scanf("%d",&n);
    int lenS=0,lenA=0;
    ll hsa,hss,Gec;
    while(n--){
        scanf("%s",a+1);
        lenA=strlen(a+1);
        int rL=min(lenA,lenS);
        hsa=0;hss=0;
        Gec=1;
        int st=0;
        for(int i=1;i<=rL;i++){
            hsa=(((hsa*256)%MOD)+a[i])%MOD;
            hss=(hss+((Gec*s[lenS-i+1])%MOD))%MOD;
            Gec*=256;
            Gec%=MOD;
            if(hsa==hss)st=i;
        }

        for(int i=st+1;i<=lenA;i++){
            s[++lenS]=a[i];
        }
    }
    s[++lenS]='\0';
    puts(s+1);
    return 0;
}