hdoj1841Find the Shortest Common Superstring【扩展KMP模板】

Find the Shortest Common Superstring

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)
Total Submission(s): 1602    Accepted Submission(s): 428

Problem Description

The shortest common superstring of 2 strings S ₁  and S ₂  is a string S with the minimum number of characters which contains both S ₁  and S ₂  as a sequence of consecutive characters. For instance, the shortest common superstring of “alba” and “bacau” is “albacau”.
Given two strings composed of lowercase English characters, find the length of their shortest common superstring.  

 

Input

The first line of input contains an integer number T, representing the number of test cases to follow. Each test case consists of 2 lines. The first of these lines contains the string S ₁  and the second line contains the string S ₂. Both of these strings contain at least 1 and at most 1.000.000 characters.

 

Output

For each of the T test cases, in the order given in the input, print one line containing the length of the shortest common superstring.

 

Sample Input

  
  

   
   2
alba
bacau
resita
mures
  
  

 

Sample Output

  
  

   
   7
8
  
  

 

Author

Mugurel Ionut Andreica

 

#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
const int MAX=1000010;
int next[MAX];
int extend[MAX];
int MIN(int a,int b){
	return a<b?a:b;
}
void getNext(char *T){
	int i,lenT=strlen(T);
	next[0]=lenT;
	for(i=0;i<lenT-1&&T[i]==T[i+1];++i);
	next[1]=i;
	int a=1;
	for(int k=2;k<lenT;++k){
		int p=a+next[a]-1,L=next[k-a];
		if((k+L-1)>=p){
			int j=(p-k+1)>0?(p-k+1):0;
			while(k+j<lenT&&T[j]==T[k+j])j++;
			next[k]=j;a=k;
		}
		else {
			next[k]=L;
		}
	}
}
int getExtend(char *S,char *T){
	memset(next,0,sizeof(next));
	getNext(T);
	int lenS=strlen(S),lenT=strlen(T);
	int minLen=MIN(lenS,lenT);
	int a=0;
	while(a<minLen&&S[a]==T[a])a++;
	if(a==minLen)return lenS+lenT-minLen;
	extend[0]=a;a=0;
	for(int k=1;k<=lenS;++k){
		int p=a+extend[a]-1,L=next[k-a];
		if(p==lenS-1)return lenT+a;
		if((k+L-1)>=p){
			int j=(p-k+1)>0?(p-k+1):0;
			while(k+j<lenS&&j<lenT&&S[k+j]==T[j])j++;
			extend[k]=j;a=k;
			if(j==lenT)return lenS;
		}
		else extend[k]=L;
	}
	return lenS+lenT;
}
char str[1000010];
char s[1000010];
int main()
{
	int t;
	scanf("%d",&t);
	getchar();
	while(t--){
		gets(str);
		gets(s);
		printf("%d\n",MIN(getExtend(s,str),getExtend(str,s)));
	}
	return 0;
}