This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<pair<int,int> > a(n);
    for(int i=0; i<n; i++){
        cin >> a[i].second >> a[i].first;
    }
    sort(a.begin(), a.end());
    reverse(a.begin(), a.end());
    set<pair<int,int> > given;
    int ans=0;
    for(int i=0; i<n; i++){
        auto [e, x]=a[i];
        auto r=given.upper_bound({x, e});
        if(r!=given.end()){
            auto [x2, e2]=*r;
            if(e2-e >= x2-x) continue;
        }
        if(r!=given.begin()){
            auto [x2, e2] =*prev(r);
            if(e2-e >= x-x2) continue;
        }
        ans++;
        given.insert({x, e});
    }
    cout << ans << "\n";
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |