Number Sequence
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15727 Accepted Submission(s): 6917
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 <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <ctime>
using namespace std;
#pragma comment(linker,"/STACK:102400000,102400000") /// kuo zhan
#define clr(s,x) memset(s,x,sizeof(s))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define lowbit(x) (x&(-x))
#define PB push_back
#define For(i,a,b) for(int i=a;i<b;i++)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
typedef long long LL;
typedef unsigned int uint;
typedef unsigned long long ULL;
typedef vector<int> vint;
typedef vector<string> vstring;
void RI (int& x){
x = 0;
char c = getchar ();
while (c == ' '||c == '\n') c = getchar ();
bool flag = 1;
if (c == '-'){
flag = 0;
c = getchar ();
}
while (c >= '0' && c <= '9'){
x = x * 10 + c - '0';
c = getchar ();
}
if (!flag) x = -x;
}
void RII (int& x, int& y){RI (x), RI (y);}
void RIII (int& x, int& y, int& z){RI (x), RI (y), RI (z);}
const double PI = acos(-1.0);
const int maxn = 1e6 + 100;
const int maxm = 1e4 + 100;
const LL mod = 1e9 + 7;
const double eps = 1e-9;
const int INF = 0x7fffffff;
/************************************END DEFINE*********************************************/
int s[maxn];
int t[maxm];
int nxt[maxm];
int n,m,T;
void get_next(int lent){
int len = lent;
nxt[0] = 0;
nxt[1] = 0;
For(i,1,len){
int j = nxt[i];
while(j && t[i] != t[j])j = nxt[j];
nxt[i+1] = t[i] == t[j] ? j+1 : 0;
}
}
int kmp(int lens,int lent){
get_next(lent);
int j = 0;
For(i,0,n){
while(j && t[j] != s[i])j = nxt[j];
if(t[j] == s[i]) j++;
if(j == lent)return i-lent+2;
}
return -1;
}
int main()
{
RI(T);
while(T--){
RII(n,m);
For(i,0,n)RI(s[i]);
For(i,0,m)RI(t[i]);
int ans = kmp(n,m);
cout<<ans<<endl;
}
return 0;
}