CodeForces - 471D

D. MUH and Cube Walls

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got hold of lots of wooden cubes somewhere. They started making cube towers by placing the cubes one on top of the other. They defined multiple towers standing in a line as a wall. A wall can consist of towers of different heights.

Horace was the first to finish making his wall. He called his wall an elephant. The wall consists of w towers. The bears also finished making their wall but they didn't give it a name. Their wall consists of n towers. Horace looked at the bears' tower and wondered: in how many parts of the wall can he "see an elephant"? He can "see an elephant" on a segment of w contiguous towers if the heights of the towers on the segment match as a sequence the heights of the towers in Horace's wall. In order to see as many elephants as possible, Horace can raise and lower his wall. He even can lower the wall below the ground level (see the pictures to the samples for clarification).

Your task is to count the number of segments where Horace can "see an elephant".

Input

The first line contains two integers n and w (1 ≤ n, w ≤ 2·105) — the number of towers in the bears' and the elephant's walls correspondingly. The second line contains n integers ai (1 ≤ ai ≤ 109) — the heights of the towers in the bears' wall. The third line contains w integers bi (1 ≤ bi ≤ 109) — the heights of the towers in the elephant's wall.

Output

Print the number of segments in the bears' wall where Horace can "see an elephant".

Examples

input

Copy

13 5
2 4 5 5 4 3 2 2 2 3 3 2 1
3 4 4 3 2

output

Copy

2

Note

The picture to the left shows Horace's wall from the sample, the picture to the right shows the bears' wall. The segments where Horace can "see an elephant" are in gray.

这是一道KMP模板题，但又有所不同，匹配的是差值相同的连续串。设原串a,b,c,d模式串是 e,f,g,h.

匹配的条件是a-e=b-f=c-g=d-h,即a-b=e-f, b-c=f-g,  c-d=g-h.所以完全匹配的是两个串相邻数的差值即可，我把差值分别存起来，作为原串和模式串，其余的就是kmp模板了。*******就是当匹配类型是int 型而不是一般的char时，当str[]={0,0,0,0,0},mo[]={0, 0}答案是4但程序output为1，所以，我把里面的0全换为-1了。

#include<bits/stdc++.h>
const int maxn=200005;
using namespace std;
int str[maxn];
int mo[maxn];
int a[maxn];
int b[maxn];
int Next[maxn];
int n,m;
void getNext()
{
    int i=0;
    int j=-1;
    int len=m-1;
    while(i<len)
    {
        if(j==-1||mo[i]==mo[j])
        {
            i++;
            j++;
            Next[i]=j;
        }
        else j=Next[j];
    }
}
int kmp()
{
    int i=0;
    int j=0;
    int ans=0;
    int l1=n-1;
    int l2=m-1;
    while(i<l1)
    {
        if(j==-1||(mo[j]==str[i]))
        {
            i++;
            j++;
        }
        else j=Next[j];
        if(j==l2) ans++;
    }
    return ans;
}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        memset(str,0,sizeof(str));
        memset(mo,0,sizeof(mo));
        for(int i=0;i<n;i++)
        scanf("%d",&a[i]);
        for(int i=1;i<n;i++)
        {
           str[i-1]=a[i]-a[i-1];
           if(str[i-1]==0) str[i-1]=-1;
        }
        for(int i=0;i<m;i++)
        scanf("%d",&b[i]);
        for(int i=0;i<m;i++)
        {
           mo[i-1]=b[i]-b[i-1];
           if(mo[i-1]==0) mo[i-1]=-1;
        }
        if(m==1)
        {
           printf("%d\n",n);
           continue;
        }
        Next[0]=-1;
        getNext();
        printf("%d\n",kmp());

    }
}