Submission #1135500

#	Time	Username	Problem	Language	Result	Execution time	Memory
1135500		Unforgettablepl	Advertisement 2 (JOI23_ho_t2)	C++20	100 / 100	100 ms	16344 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define int long long
typedef double ld;

const int INF = 1e10;


int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<pair<int,int>> arr(n);
    for(auto&[a,b]:arr)cin>>a>>b;
    stack<pair<int,int>> ans;
    auto isSubsetAofB = [&](pair<int,int> a,pair<int,int> b) {
        return abs(a.first-b.first)<=b.second-a.second;
    };
    sort(arr.begin(), arr.end());
    for(auto&x:arr) {
        while(!ans.empty() and isSubsetAofB(ans.top(),x))ans.pop();
        if(!ans.empty() and isSubsetAofB(x,ans.top()))continue;
        ans.emplace(x);
    }
    cout << ans.size() << '\n';
}

• Subtask 1: 10 / 10
• Subtask 2: 23 / 23
• Subtask 3: 36 / 36
• Subtask 4: 31 / 31