NC 14694 KMP

题意

传送门 NC 14694

题解

将不同数列元素分别写至等式两端，则有 $(a_{i+1}-a_i)\%k=(b_i-b_{i+1})\%k$，差分取模后，转化为单串匹配问题，$KMP$ 求解即可。

#include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define maxn 200005
int t, n, m, k, a[maxn], b[maxn], nxt[maxn];

int kmp()
{
    int res = 0, i = 0, j = -1;
    nxt[i] = j;
    while (i < m)
    {
        while (j >= 0 && b[i] != b[j])
            j = nxt[j];
        ++i, ++j;
        nxt[i] = j;
    }
    i = 0, j = 0;
    while (i < n)
    {
        while (j >= 0 && a[i] != b[j])
            j = nxt[j];
        ++i, ++j;
        if (j == m)
        {
            ++res;
            j = nxt[j];
        }
    }
    return res;
}

int main()
{
    scanf("%d", &t);
    while (t--)
    {
        scanf("%d%d%d", &n, &m, &k);
        int pre, crt;
        --n, --m;
        scanf("%d", &pre);
        for (int i = 0; i < n; i++)
        {
            scanf("%d", &crt);
            a[i] = ((crt - pre) % k + k) % k, pre = crt;
        }
        scanf("%d", &pre);
        for (int i = 0; i < m; i++)
        {
            scanf("%d", &crt);
            b[i] = ((pre - crt) % k + k) % k, pre = crt;
        }
        printf("%d\n", kmp());
    }
    return 0;
}