Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- long long a[1010][1010];
- int main(){
- int n,m,x,y,R;
- scanf("%d%d",&n,&m);
- while(n--){
- scanf("%d%d",&x,&y);
- a[x][y]++;
- }
- for(int i=0;i<=1000;i++){
- for(int j=0;j<=1000;j++){
- if(i==0&&j==0) continue;
- else if(i==0) a[i][j]=a[i][j]+a[i][j-1];
- else if(j==0) a[i][j]=a[i][j]+a[i-1][j];
- else a[i][j]=a[i][j]+a[i-1][j]+a[i][j-1]-a[i-1][j-1];
- }
- }
- while(m--){
- scanf("%d%d%d",&x,&y,&R);
- int u=x-R,d=x+R;
- int l=y-R,r=y+R;
- if(u<0) u=0;
- if(l<0) l=0;
- if(d>1000) d=1000;
- if(r>1000) r=1000;
- if(l==0&&u==0) printf("%lld\n",a[d][r]);
- else if(l==0) printf("%lld\n",a[d][r]-a[u-1][r]);
- else if(u==0) printf("%lld\n",a[d][r]-a[d][l-1]);
- else printf("%lld\n",a[d][r]+a[u-1][l-1]-a[u-1][r]-a[d][l-1]);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement