제출 #1241583

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1241583		M_SH_O	Advertisement 2 (JOI23_ho_t2)	C++20	100 / 100	348 ms	39648 KiB

Main

/*#pragma GCC optimize("O3")
#pragma GCC optimization("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")*/
#include <bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/

#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define INF 1000000000000000007
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>

using namespace std;
//using namespace __gnu_pbds;

mt19937 rng(time(0));
ll randll(ll l, ll r) {
    return uniform_int_distribution<ll>(l, r)(rng);
}

int main(){
    speed;
    srand(time(0));

    ll n;
    cin >> n;

    vpll a(n);
    set<pll> s;
    for (int i =0 ; i < n; i ++) {
        cin >> a[i].fr >> a[i].se;
        s.insert(a[i]);
    }
    vbool us(n, 1);
    a.clear();
    for (auto i : s) {
        a.pb(i);
    }
    sort(a);
    n = a.size();
    ll minl = INF;

    for (int i = n-1; i >= 0; i --) {

        ll k = a[i].fr-a[i].se;
        //cout << maxl << ' ' << k << endl;
        if (k >= minl) us[i] = 0;
        minl = min(minl, k);
    }
    /*for (int i = 0; i < n; i ++) {
        //res += us[i];
        cout << us[i] << ' ';
    }
    cout<< endl;*/
    ll maxl = -INF;
    for (int i = 0; i < n; i ++) {
        ll k = a[i].fr+a[i].se;
        if (maxl >= k) us[i] = 0;
        maxl = max(maxl, k);
    }

    ll res = 0;
    for (int i = 0; i < n; i ++) {
        res += us[i];
        //cout << us[i] << ' ';
    }
   // cout<< endl;

    cout << res << endl;

}

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