oj.uz

답안 #951087

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
951087 2024-03-21T06:17:15 Z peterandvoi Advertisement 2 (JOI23_ho_t2) C++17
100 / 100
 572 ms 49296 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef ngu
#include "debug.h"
#else
#define debug(...) 42
#endif

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    #ifdef ngu
    freopen("test.inp", "r", stdin);
    freopen("test.out", "w", stdout);
    #endif
    int n;
    cin >> n;
    vector<int> x(n), e(n);
    for (int i = 0; i < n; ++i) {
        cin >> x[i] >> e[i];
    }
    auto vx = x;
    auto ve = e;
    sort(vx.begin(), vx.end());
    vx.erase(unique(vx.begin(), vx.end()), vx.end());
    sort(ve.begin(), ve.end());
    ve.erase(unique(ve.begin(), ve.end()), ve.end());
    for (int i = 0; i < n; ++i) {
        x[i] = lower_bound(vx.begin(), vx.end(), x[i]) - vx.begin();
        e[i] = lower_bound(ve.begin(), ve.end(), e[i]) - ve.begin();
    }
    vector<vector<int>> g((int) ve.size());
    for (int i = 0; i < n; ++i) {
        g[e[i]].emplace_back(i);
    }
    int m = (int) vx.size();
    const int INF = (int) 1e9;
    vector<int> sum(m, -INF), dif(m, INF);
    set<int> s;
    auto cover = [&](int i) {
        if (!s.size()) {
            return false;
        }
        int X = vx[x[i]];
        int E = ve[e[i]];
        auto it = s.lower_bound(x[i]);
        if (it != s.end()) {
            int r = *it;
            if (dif[r] <= X - E) {
                return true;
            }
        }
        if (it != s.begin()) {
            int l = *prev(it);
            if (X + E <= sum[l]) {
                return true;
            }
        }
        return false;
    };
    auto ins = [&](int i) {
        int X = vx[x[i]];
        int E = ve[e[i]];
        dif[x[i]] = min(dif[x[i]], X - E);
        sum[x[i]] = max(sum[x[i]], X + E);
        s.erase(x[i]);
        if (s.size()) {
            auto it = s.lower_bound(x[i]);
            if (it != s.end()) {
                sum[*it] = max(sum[*it], sum[x[i]]);
            }
            if (it != s.begin()) {
                int l = *prev(it);
                dif[l] = min(dif[l], dif[x[i]]);
            }
        }
        s.insert(x[i]);
    };
    int res = 0;
    for (int i = (int) g.size() - 1; ~i; --i) {
        for (int j : g[i]) {
            if (!cover(j)) {
                res++;
                ins(j);
            }
        }
    }
    cout << res;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 104 ms 11552 KB Output is correct
3 Correct 117 ms 11436 KB Output is correct
4 Correct 169 ms 18640 KB Output is correct
5 Correct 61 ms 13888 KB Output is correct
6 Correct 525 ms 44248 KB Output is correct
7 Correct 364 ms 31616 KB Output is correct
8 Correct 186 ms 20108 KB Output is correct
9 Correct 94 ms 20176 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 456 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 456 KB Output is correct
9 Correct 0 ms 452 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #3
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 456 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 456 KB Output is correct
9 Correct 0 ms 452 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 484 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 488 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 104 ms 11552 KB Output is correct
3 Correct 117 ms 11436 KB Output is correct
4 Correct 169 ms 18640 KB Output is correct
5 Correct 61 ms 13888 KB Output is correct
6 Correct 525 ms 44248 KB Output is correct
7 Correct 364 ms 31616 KB Output is correct
8 Correct 186 ms 20108 KB Output is correct
9 Correct 94 ms 20176 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 456 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 456 KB Output is correct
18 Correct 0 ms 452 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 484 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 488 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 252 ms 32600 KB Output is correct
37 Correct 341 ms 41812 KB Output is correct
38 Correct 419 ms 49152 KB Output is correct
39 Correct 375 ms 34632 KB Output is correct
40 Correct 416 ms 49152 KB Output is correct
41 Correct 437 ms 48208 KB Output is correct
42 Correct 388 ms 48468 KB Output is correct
43 Correct 425 ms 47856 KB Output is correct
44 Correct 385 ms 49296 KB Output is correct
45 Correct 572 ms 43552 KB Output is correct