제출 #835081

#제출 시각아이디문제언어결과실행 시간메모리
835081jasminAdvertisement 2 (JOI23_ho_t2)C++17
100 / 100
294 ms45728 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...