제출 #780929

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
780929		boris_mihov	Advertisement 2 (JOI23_ho_t2)	C++17	100 / 100	649 ms	56964 KiB

Main

#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <stack>
#include <set>

typedef long long llong;
const int MAXN = 500000 + 10;
const int INF  = 1e9;

struct Person
{
    int x, e;
    friend bool operator > (const Person &a, const Person &b)
    {
        return a.e > b.e;
    }
};

int n;
Person p[MAXN];
std::set <std::pair <int,int>> left, right;

void solve()
{
    int ans = 0;
    std::sort(p + 1, p + 1 + n, std::greater <Person> ());
    
    for (int i = 1 ; i <= n ; ++i)
    {
        bool thereIs = false;
        
        auto it = left.lower_bound({p[i].e - p[i].x, 0});
        if (it != left.end() && it->second >= p[i].x)
        {
            thereIs = true;
        }

        it = right.lower_bound({p[i].x + p[i].e, 0});
        if (it != right.end() && it->second <= p[i].x)
        {
            thereIs = true;
        }
        
        if (!thereIs)
        {
            ans++;
            left.insert({p[i].e - p[i].x, p[i].x});
            right.insert({p[i].x + p[i].e, p[i].x});
        }
    }

    std::cout << ans << '\n';
}   

void input()
{
    std::cin >> n;
    for (int i = 1 ; i <= n ; ++i)
    {
        std::cin >> p[i].x >> p[i].e;
    }
}

void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int main()
{
    fastIOI();
    input();
    solve();

    return 0;
}

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