Submission #1241307

#	Time	Username	Problem	Language	Result	Execution time	Memory
1241307		Geforgs	Advertisement 2 (JOI23_ho_t2)	C++20	100 / 100	302 ms	39620 KiB

Main

#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <unordered_map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
#define ll long long
#define ld long double
#define inf (ll)(2*1e18)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define pb push_back
#define endl "\n"
using namespace std;

void solve(){
    ll n, i, last=-inf, e=0, cnt=0;
    cin>>n;
    vector<pair<ll, ll>> a(n);
    set<pair<ll, ll>> s;
    vector<bool> give(n, true);
    for(i=0;i<n;++i){
        cin>>a[i].first>>a[i].second;
        s.insert(a[i]);
    }
    a.clear();
    for(auto el: s){
        a.pb(el);
    }
    for(i=0;i<a.size();++i){
        e -= a[i].first - last;
        if(e >= a[i].second){
            give[i] = false;
        }else{
            e = a[i].second;
        }
        last = a[i].first;
    }
    last = inf;
    e = 0;
    for(i=a.size()-1;i>=0;--i){
        e -= last - a[i].first;
        if(e >= a[i].second){
            give[i] = false;
        }else{
            e = a[i].second;
        }
        last = a[i].first;
        if(give[i]) ++cnt;
    }
    cout<<cnt<<endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    srand(time(nullptr));
    ll t=1;
//    cin>>t;
    for(;t>0;--t){
        solve();
    }
    return 0;
}

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