Codeforces round 244(div.2) D match&catch【字符串hash】

D. Match & Catch

time limit per test

1 second

memory limit per test

512 megabytes

input

standard input

output

standard output

Police headquarter is monitoring signal on different frequency levels. They have got two suspiciously encoded strings s₁ and s₂ from two different frequencies as signals. They are suspecting that these two strings are from two different criminals and they are planning to do some evil task.

Now they are trying to find a common substring of minimum length between these two strings. The substring must occur only once in the first string, and also it must occur only once in the second string.

Given two strings s₁ and s₂ consist of lowercase Latin letters, find the smallest (by length) common substring p of both s₁ and s₂, where pis a unique substring in s₁ and also in s₂. See notes for formal definition of substring and uniqueness.

Input

The first line of input contains s₁ and the second line contains s₂ (1 ≤ |s₁|, |s₂| ≤ 5000). Both strings consist of lowercase Latin letters.

Output

Print the length of the smallest common unique substring of s₁ and s₂. If there are no common unique substrings of s₁ and s₂ print -1.

Sample test(s)

input

apple
pepperoni

output

2

input

lover
driver

output

1

input

bidhan
roy

output

-1

input

testsetses
teeptes

output

3

Note

Imagine we have string a = a₁a₂a₃...a_|a|, where |a| is the length of string a, and a_i is the i^th letter of the string.

We will call string a_la_l + 1a_l + 2...a_r (1 ≤ l ≤ r ≤ |a|) the substring [l, r] of the string a.

The substring [l, r] is unique in a if and only if there is no pair l₁, r₁ such that l₁ ≠ l and the substring [l₁, r₁] is equal to the substring[l, r] in a.

题意是说，给定两个字符串，找到最小的相同串，同时这个串只能在两个串中出现一次。开始想可能是后缀数组，但是不太会，参考了一下别人的想法，发现字符串hash也可以做。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef unsigned __int64 ULL;
const int Maxn=6000;
const ULL seed=13331,length=10007;
struct node
{
	ULL val;
	int next;
	node(){};
	node(ULL v,int n) : val(v), next(n){};
};
ULL seedpow[Maxn] = {1ULL}, hash1[Maxn], hash2[Maxn];
node edge[Maxn<<1];
int head[length], cnt1[Maxn<<1], cnt2[Maxn<<1], sz;
char s[Maxn], t[Maxn]; 


void insert(ULL w,bool flag)
{
	int p=w%length;
	for(int i=head[p];i>=0;i=edge[i].next)
	{
		if(w!=edge[i].val) continue;
		if(flag==true) cnt1[i]++;
		else cnt2[i]++;
		return ;
	}
	cnt1[sz]=0;
	cnt2[sz]=0;
	if(flag) cnt1[sz]++;
	else cnt2[sz]++;
	edge[sz]=node(w,head[p]);
	head[p]=sz++;
	return ;
}




int main()
{
	scanf("%s%s",&s,&t);
	int ls=strlen(s);
	int lt=strlen(t);
	for(int i=1;i<=max(ls,lt);i++)
	{
		seedpow[i]=seedpow[i-1]*seed;
	}
	for(int i=1;i<=ls;i++)
	{
		hash1[i]=hash1[i-1]*seed+s[i-1];
	}
	for(int i=1;i<=lt;i++)
	{
		hash2[i]=hash2[i-1]*seed+t[i-1];
	}
	for(int l=1;l<=min(ls,lt);l++)
	{
		for(int i=0;i<length;i++) head[i]=-1;
		sz=0;
		for(int ed=l;ed<=ls;ed++)
		{
			insert(hash1[ed]-hash1[ed-l]*seedpow[l],true);
		}
		for(int ed=l;ed<=lt;ed++)
		{
			insert(hash2[ed]-hash2[ed-l]*seedpow[l],false);
		}
		for(int i=0;i<sz;i++)
		{
			if(cnt1[i]==1&&cnt2[i]==1) 
			{
				printf("%d\n",l);
				return 0;
			}
		}
	}
	printf("-1\n");
	return 0;
}