CF--Compress Words--KMP匹配

E. Compress Words

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Amugae has a sentence consisting of nn 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 nn (1≤n≤1051≤n≤105), the number of the words in Amugae's sentence.

The second line contains nn 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 106106.

Output

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

Examples

input

Copy

5
I want to order pizza

output

Copy

Iwantorderpizza

input

Copy

5
sample please ease in out

output

Copy

sampleaseinout

每次我们用新的串和答案串匹配，答案串的匹配位置是max(0,(int)ans.size()-(int)s.size())，这样可以降低时间复杂度。答案串是S，新串是T。

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=1000000+66;
const ll mod=1e9+7;
int n;
string s[maxn];
string ans;
int nexts[maxn];
void getnexts(string t)
{
    int len=t.size();
    int i=0;
    int j=-1;
    nexts[0]=-1;
    while(i<len)
    {
        if(j==-1||t[i]==t[j])
        {
            i++;
            ++j;
            if(t[i]!=t[j])
                nexts[i]=j;
            else
                nexts[i]=nexts[j];
        }
        else
        {
            j=nexts[j];
        }
    }
}
int kmp(string &s,string &t,int pos)//s是答案串
{
    int i=pos;//
    int j=0;
    int sl=s.size();
    int tl=t.size();
    while(i<sl)
    {
        if(j==-1||s[i]==t[j])
        {
            ++i;
            ++j;
        }
        else
        {
            j=nexts[j];
        }
    }
    return j;
}
void add(string s)
{
    getnexts(s);
    int pos=kmp(ans,s,max(0,(int)ans.size()-(int)s.size()));
    for(int i=pos; i<s.size(); i++)
    {
        ans.push_back(s[i]);
    }
}
int main()
{
    scanf("%d",&n);
    for(int i=1; i<=n; i++)
    {
        cin>>s[i];
    }
    ans=s[1];
    for(int i=2; i<=n; i++)
    {
        add(s[i]);
    }
    cout<<ans;
}