Submission #1153945

#	Time	Username	Problem	Language	Result	Execution time	Memory
1153945		tsengang	Advertisement 2 (JOI23_ho_t2)	C++17	100 / 100	263 ms	16060 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define ertunt return
const int MOD = 998244353;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
int main() {
    ll n;
    cin >> n;
    ll x[n],e[n];
    pair<ll,ll> a[n];
    for(ll i = 0; i < n; i++){
        cin >> x[i] >> e[i];
        a[i].ff = x[i] - e[i];
        a[i].ss = -e[i] - x[i];
    }
    sort(a,a+n);
    ll ans = 0;
    ll cur = -1e9;
    for(ll i = 0; i < n; i++){
        a[i].ss = -a[i].ss;
        if(a[i].ss > cur){
            ans++;
            cur = a[i].ss;
        }
    }
    cout << ans;
}

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