fork download
copy 
  1. #include <bits/stdc++.h>
  2. #define int long long
  3. using namespace std;
  4. int n,d,ans=0,x[100005],st[400005];
  5. pair <int,int> p[100005];
  6. void UPDATE(int id, int l, int r, int i, int v)
  7. {
  8.     if (l>i || r<i) return;
  9.     else if (l==r)
  10.     {
  11.         st[id]=v;
  12.         return;
  13.     }
  14.     int mid=(l+r)/2;
  15.     if (i<=mid) UPDATE(id*2,l,mid,i,v);
  16.     else UPDATE(id*2+1,mid+1,r,i,v);
  17.     st[id]=max(st[id*2],st[id*2+1]);
  18. }
  19. int GET(int id, int l, int r, int u, int v)
  20. {
  21.     if (l>v || r<u) return 0;
  22.     if (l>=u && r<=v) return st[id];
  23.     int mid=(l+r)/2;
  24.     return max(GET(id*2,l,mid,u,v),GET(id*2+1,mid+1,r,u,v));
  25. }
  26. void UPDATE(int i, int v)
  27. {
  28.     UPDATE(1,1,n,i,v);
  29. }
  30. int GET(int l, int r)
  31. {
  32.     return GET(1,1,n,l,r);
  33. }
  34. signed main()
  35. {
  36.     ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
  37.     cin>>n>>d;
  38.     for (int i=1;i<=n;i++) cin>>p[i].first>>p[i].second;
  39.     sort(p+1,p+n+1);
  40.     for (int i=1;i<=n;i++) x[i]=p[i].first,UPDATE(i,p[i].second);
  41.     for (int i=1;i<=n;i++)
  42.     {
  43.         int l=lower_bound(x+1,x+i,p[i].first-d)-x,r=upper_bound(x+i+1,x+n+1,p[i].first+d)-x-1;
  44.         if (GET(l,i-1)>=2*p[i].second && GET(i+1,r)>=2*p[i].second) ans++;
  45.     }
  46.     cout<<ans<<'\n';
  47.     return 0;
  48. }
  49.  
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
0
https://ideone.com/4aKWeE
language:
C++14 (gcc 8.3)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!