Number Sequence

Number Sequence

Time Limit : 10000/5000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 5   Accepted Submission(s) : 4

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 <iostream>
#include <cstdio>
using namespace std;
int a[1000000];
int b[10000];
int n , m ;
int next[10010];
void get_next()
{
	next[0] = 0;
	next[1] = 0;
	int j = 0;
	for(int i = 1; i < m; i ++)
	{
		j = next[i];
		while(j && b[i] != b[j]) j = next[j];
		next[i + 1] = b[i] == b[j] ? j + 1:0;
	}
}

void kmp()
{
	int j = 0;
	for(int i = 0; i < n; i ++)
	{
		while(j && a[i]!= b[j]) j = next[j];
		if(a[i] == b[j]) j ++;
		if(j == m){
			printf("%d\n",i-m+2);
			return ;
		} 
	}
	printf("-1\n");
	return ;
}
int main()
{
	int t;
	scanf("%d",&t);
	while(t --)
	{
		scanf("%d %d",&n , &m);
		for(int i = 0; i < n; i ++)
		{
			scanf("%d",&a[i]);
		}
		for(int i = 0; i < m; i ++)
		{
			scanf("%d",&b[i]);
		}
		get_next();
		kmp();
	}
	return 0;
}