代码
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <string>
#include <queue>
#include <map>
#include <bitset>
#include <vector>
#include <stack>
void fre() { system("clear"), freopen("A.txt", "r", stdin); freopen("Ans.txt","w",stdout); }
void Fre() { system("clear"), freopen("A.txt", "r", stdin);}
#define ios ios::sync_with_stdio(false)
#define Pi acos(-1)
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define db double
#define Pir pair<int, int>
#define m_p make_pair
#define INF 0x3f3f3f3f
#define esp 1e-7
#define mod (ll)(1e9 + 7)
#define for_(i, s, e) for(int i = (ll)(s); i <= (ll)(e); i ++)
#define rep_(i, e, s) for(int i = (ll)(e); i >= (ll)(s); i --)
#define sc scanf
#define pr printf
#define sd(a) scanf("%d", &a)
#define ss(a) scanf("%s", a)
using namespace std;
const int mxn = 1000005;
const int mxm = 10000;
int nxt[mxm];
void Get_nxt(int t[], int m)
{
int k = -1, j = 0;
nxt[0] = -1;
while(j < m)
{
if(k == -1 || t[k] == t[j])
{
k ++, j ++;
if(t[k] == t[j])
nxt[j] = nxt[k];
else
nxt[j] = k;
}
else
k = nxt[k];
}
}
int kmp(int s[], int n, int t[], int m)
{
Get_nxt(t, m);
int i = 0, j = 0;
while(i < n && j < m)
{
if(j == -1 || s[i] == t[j])
i ++, j ++;
else
j = nxt[j];
}
if(j == m)
return i - m + 1;
return -1;
}
int main()
{
int T, n, m;
int s[mxn], t[mxm];
sd(T);
while(T --)
{
sc("%d %d", &n, &m);
for_(i, 0, n - 1) sd(s[i]);
for_(i, 0, m - 1) sd(t[i]);
int ans = kmp(s, n, t, m);
pr("%d\n", ans);
}
return 0;
}