hdu-1711 Number Sequence

  Number Sequence

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 15145    Accepted Submission(s): 6640

Problem Description

Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] = b[1], a[K + 1] = b[2], ...... , a[K + M - 1] = b[M]. If there are more than one K exist, output the smallest one.

 

Input

The first line of input is a number T which indicate the number of cases. Each case contains three lines. The first line is two numbers N and M (1 <= M <= 10000, 1 <= N <= 1000000). The second line contains N integers which indicate a[1], a[2], ...... , a[N]. The third line contains M integers which indicate b[1], b[2], ...... , b[M]. All integers are in the range of [-1000000, 1000000].

 

Output

For each test case, you should output one line which only contain K described above. If no such K exists, output -1 instead.

 

Sample Input

  
  

   
   2
13 5
1 2 1 2 3 1 2 3 1 3 2 1 2
1 2 3 1 3
13 5
1 2 1 2 3 1 2 3 1 3 2 1 2
1 2 3 2 1
  
  

 

Sample Output

  
  

   
   6
-1
  
  

 

# include<stdio.h>
# include<string.h>
# define max 1000000 + 100
using namespace std;
int s1[max], s2[max];//7次Wrong Answer就是因为将int定义成了char类型，就是过不去，一定要注意了。 
int p[max]; int m,n; 

void get()
{
	int i = 0;
	int j = -1;
	p[0] = -1;
	while(i < n)
	{
		if(s2[i] == s2[j] || j == -1)
		{
			i++;
			j++;
			p[i] = j;
		}
		else
		   j = p[j];
	}
}

void cmp()
{
	int i = 0, j = 0;
	while(i < m)
	{
		if(s1[i] == s2[j] || j == -1)
	    {
	    	i++;
	    	j++;
	    }
	    else
	        j = p[j];
	    if(j >= n)
	    {
	    	printf("%d\n",i - n + 1);
	    	return;
	    }
	}
	printf("-1\n");
}

int main()
{
	int z; 
	scanf("%d",&z);
	while(z--)
	{
		scanf("%d%d", &m, &n);
		for(int t = 0; t < m ; t++)
		 scanf("%d",&s1[t]);
		for(int t = 0; t < n ; t++)
		 scanf("%d",&s2[t]); 
		get(); cmp(); 
	}
	return 0;
}