제출 #915451

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
915451		HorizonWest	Advertisement 2 (JOI23_ho_t2)	C++17	100 / 100	749 ms	57132 KiB

Main

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

#define endl '\n'
#define db double
#define ll __int128
#define int long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;

const int Max = 1e6 + 7, Inf = 1e9 + 7;

void print(bool x) { cout << (x ? "YES" : "NO") << endl; }

string tostring (__int128 x)
{
    string ans = "";
    while(x > 0)
    {
        ans += (x % 10 + '0');
        x /= 10;
    }
    reverse(all(ans));
    return ans;
}

void solve()
{
    int n; cin >> n;
    vector <pair<int, int>> v(n); 
    priority_queue <pair<int, int>> pq;
    for(auto& u : v) cin >> u.fs >> u.sd; 
    sort(all(v));

    for(int i = 0; i < n; i++)
        pq.push({ v[i].sd, i });

    map <int, int> mp; int ans = 0;
    
    while (!pq.empty())
    {
        int x = pq.top().sd; pq.pop();
        if(mp[x]) continue;
        mp[x] = 1; ans ++;

        for(int i = x+1; i < n; i++)
        {
            if(mp[i]) break;
            if(abs(v[x].fs - v[i].fs) > v[x].sd - v[i].sd) break;
            mp[i] = 1;
        }

        for(int i = x-1; i >= 0; i--)
        {
            if(mp[i]) break;
            if(abs(v[x].fs - v[i].fs) > v[x].sd - v[i].sd) break;
            mp[i] = 1;
        }
    }
    
    cout << ans << endl;
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int Q = 1; //cin >> Q;

    while (Q--)
    {
        solve();
    }

    return 0;
}

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