1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<bitset>
#include<assert.h>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-8
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define mid (x+y>>1)
#define NM 150005
#define nm 200005
#define pi 3.1415926535897931
#define mp(x,y) make_pair(x,y)
using namespace std;
const int inf=1e9;
ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f*x;
}
int n,m,p,_x,_t;
int a[NM],b[NM],ans;
struct node{
int x,y,s,tag;
node*l,*r;
node(int x,int y,node*l=0,node*r=0):x(x),y(y),l(l),r(r),s(0){if(l)upd();else s=-x;}
void upd(){s=min(l->s,r->s);}
void push(){
if(tag){
l->s+=tag;l->tag+=tag;
r->s+=tag;r->tag+=tag;
tag=0;
}
}
void mod(){
if(_x<=x){s+=_t;tag+=_t;return;}
push();if(_x<=mid)l->mod();r->mod();upd();
}
}*root;
node*build(int x,int y){return x==y?new node(x,y):new node(x,y,build(x,mid),build(mid+1,y));}
void ins(int x){
_x=lower_bound(b+1,b+1+m,p-x)-b;
if(_x<=m)root->mod();
}
int main(){
n=read();m=read();p=read();
inc(i,1,m)b[i]=read();
inc(i,1,n)a[i]=read();
sort(b+1,b+1+m);
root=build(1,m);
inc(i,1,m)_t=1,ins(a[i]);
if(root->s>=0)ans++;
inc(i,m+1,n){
_t=1;ins(a[i]);
_t=-1;ins(a[i-m]);
if(root->s>=0)ans++;
}
printf("%d\n",ans);
return 0;
}
|
