제출 #916485

#제출 시각아이디문제언어결과실행 시간메모리
916485Darren0724Advertisement 2 (JOI23_ho_t2)C++17
100 / 100
639 ms51712 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define all(x) x.begin(),x.end()
#define abcorz ios_base::sync_with_stdio(false);cin.tie(0);
int32_t main(){
    abcorz;
    int n;cin>>n;
    vector<int> x(n),e(n);
    map<int,int> m;
    for(int i=0;i<n;i++){
        cin>>x[i]>>e[i];
        m[e[i]-x[i]]=max(m[e[i]-x[i]],e[i]+x[i]);
    }
    vector<int> r;
    for(auto [a,b]:m){
        while(r.size()&&r.back()<=b){
            r.pop_back();
        }
        r.push_back(b);
    }
    cout<<r.size()<<endl;


    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...