Submission #885428

#	Time	Username	Problem	Language	Result	Execution time	Memory
885428		juliany2	Advertisement 2 (JOI23_ho_t2)	C++17	59 / 100	2077 ms	1372 KiB

Main

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) (x).begin(), (x).end()

int main() {
    cin.tie(0)->sync_with_stdio(false);

    int n;
    cin >> n;

    vector<array<int, 2>> a(n);
    for (auto &[x, e] : a)
        cin >> x >> e;

    sort(all(a));
    a.erase(unique(all(a)), a.end());

    n = a.size();

    int ans = n;

    for (int i = 0; i < n; i++) {
        bool cov = 0;
        for (int j = 0; j < n; j++) {
            if (i != j && a[j][1] - a[i][1] >= abs(a[j][0] - a[i][0]))
                cov = 1;
        }

        if (cov)
            ans--;
    }

    bool all = 1;
    for (int i = 0; i < n; i++)
        if (a[i][1] != a[0][1])
            all = 0;

    if (all)
        cout << n << '\n';
    else
        cout << ans << '\n';

    return 0;
}

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