Submission #769062

#	Time	Username	Problem	Language	Result	Execution time	Memory
769062		danikoynov	Advertisement 2 (JOI23_ho_t2)	C++14	59 / 100	2052 ms	3052 KiB

Main

#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxn = 5e5 + 10;

struct point
{
    int x, y;
}p[maxn];

bool cmp(const point &p1, const point &p2)
{
    return p1.y > p2.y;
}

int n;
void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i ++)
    {
        cin >> p[i].x >> p[i].y;
    }

    sort(p + 1, p + n + 1, cmp);
    int ans = 0;
    for (int i = 1; i <= n; i ++)
    {
        bool covered = false;
        for (int j = 1; j < i; j ++)
        {
            if (abs(p[i].x - p[j].x) <= p[j].y - p[i].y)
            {
                covered = true;
                break;
            }
        }
        if (!covered)
            ans ++;
    }

    cout << ans << endl;
}

int main()
{
    solve();
    return 0;
}

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