kmp hdu_1711

Number Sequence

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

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 <fstream>
#include <string.h>
using namespace std;
const int maxm=1000006;
const int maxn=10006;
int j,n,m;
int a[maxm];int b[maxn];
int PrefixFunc[maxn];
void CptPfFunc(int Pattern[], int PrefixFunc[] )
{
        int LOLP = 0;
        PrefixFunc[1]=0;
        for(int NOCM=2;NOCM<m+1;NOCM++)
        {
                while(LOLP>0&&(Pattern[LOLP]!=Pattern[NOCM-1]))
                        LOLP = PrefixFunc[LOLP];
                if( Pattern[LOLP]==Pattern[NOCM-1])
                        LOLP++;
                PrefixFunc[NOCM]=LOLP;
        }
      
}
int KMPstrMatching(int Target[],int Pattern[])
{
        memset(PrefixFunc,-1,sizeof(PrefixFunc));
        CptPfFunc(Pattern,PrefixFunc);
        int NOCM=0;
        for(int i=0;i<n;i++)
        {
                while( NOCM>0&&Pattern[NOCM]!=Target[i])
                        NOCM = PrefixFunc[NOCM];
                if( Pattern[NOCM] == Target[i] )
                        NOCM++;
                if(NOCM==m)
                {
                        return i-m+1+1;
                }
        }
        return -1;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        cin>>n>>m;
        for(j=0;j<n;j++)
            cin>>a[j];
        for(j=0;j<m;j++)
            cin>>b[j];
           cout<<KMPstrMatching(a,b)<<endl;
    }
    return 0;
}