Advertisement
DontCallMeNuttoPleas

Key

Mar 25th, 2020
105
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.79 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. long long a[1010][1010];
  5.  
  6. int main(){
  7.     int n,m,x,y,R;
  8.     scanf("%d%d",&n,&m);
  9.     while(n--){
  10.         scanf("%d%d",&x,&y);
  11.         a[x][y]++;
  12.     }
  13.     for(int i=0;i<=1000;i++){
  14.         for(int j=0;j<=1000;j++){
  15.             if(i==0&&j==0) continue;
  16.             else if(i==0) a[i][j]=a[i][j]+a[i][j-1];
  17.             else if(j==0) a[i][j]=a[i][j]+a[i-1][j];
  18.             else a[i][j]=a[i][j]+a[i-1][j]+a[i][j-1]-a[i-1][j-1];
  19.         }
  20.     }
  21.     while(m--){
  22.         scanf("%d%d%d",&x,&y,&R);
  23.         int u=x-R,d=x+R;
  24.         int l=y-R,r=y+R;
  25.         if(u<0) u=0;
  26.         if(l<0) l=0;
  27.         if(d>1000) d=1000;
  28.         if(r>1000) r=1000;
  29.         if(l==0&&u==0) printf("%lld\n",a[d][r]);
  30.         else if(l==0) printf("%lld\n",a[d][r]-a[u-1][r]);
  31.         else if(u==0) printf("%lld\n",a[d][r]-a[d][l-1]);
  32.         else printf("%lld\n",a[d][r]+a[u-1][l-1]-a[u-1][r]-a[d][l-1]);
  33.     }
  34. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement