oj.uz

Submission #936749

# Submission time Handle Problem Language Result Execution time Memory
936749 2024-03-02T16:39:22 Z kitlix Advertisement 2 (JOI23_ho_t2) C++17
100 / 100
 951 ms 73572 KB 
#include <bits/stdc++.h>
#define int long long

using namespace std;

const int INF = 1e18;

struct NodeMax {
    long long seg_max;

    static NodeMax merge(NodeMax a, NodeMax b) { return {max(a.seg_max, b.seg_max)}; }

    static NodeMax zero_el() { return {-INF}; }
};

template <class Node>
struct SegTree {
    vector<Node> t;

    int n, h = 1;

    SegTree(const int& sz) : SegTree(vector<Node>(sz, Node::zero_el())) {}

    SegTree(vector<Node> in) {
        n = in.size();
        while (1 << h < n)
            h += 1;
        t.resize(1 << (h + 1), Node::zero_el());
        for (int i = (1 << h); i < (1 << h) + n; ++i)
            t[i] = in[i - (1 << h)];
        for (int i = (1 << h) - 1; i > 0; --i)
            t[i] = Node::merge(t[i << 1], t[(i << 1) | 1]);
    }

    void upd(int v, int v_l, int v_r, int i, Node val) {
        if (i < v_l || i >= v_r)
            return;
        if (v_l + 1 == v_r) {
            t[v] = val;
            return;
        }
        int v_m = (v_l + v_r) / 2;
        upd((v << 1), v_l, v_m, i, val);
        upd(((v << 1) | 1), v_m, v_r, i, val);
        t[v] = Node::merge(t[v << 1], t[(v << 1) | 1]);
    }

    void upd(int i, Node val) { upd(1, 0, (1 << h), i, val); }

    Node get(int v, int v_l, int v_r, int l, int r) {
        if (v_l >= r || v_r <= l)
            return Node::zero_el();
        if (l <= v_l && v_r <= r)
            return t[v];
        int v_m = (v_l + v_r) / 2;
        return Node::merge(get((v << 1), v_l, v_m, l, r), get(((v << 1) | 1), v_m, v_r, l, r));
    }

    Node get(int l, int r) { return get(1, 0, (1 << h), l, r); }

    Node get_by_id(int i) { return t[(1 << h) + i - 1]; };
};

signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int n;
    cin >> n;
    vector<pair<int, int>> a(n);
    vector<int> xs;
    for (auto& [ei, xi] : a) {
        cin >> xi >> ei;
        xs.push_back(xi);
    }
    sort(xs.begin(), xs.end());
    xs.resize(unique(xs.begin(), xs.end()) - xs.begin());
    map<int, int> xcomp;
    for (int i = 0; i < xs.size(); ++i)
        xcomp[xs[i]] = i;
    for (auto& [ei, xi] : a)
        xi = xcomp[xi];
    sort(a.begin(), a.end(), greater<>());
    SegTree<NodeMax> preft(xs.size()), sufft(xs.size());
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        int prefmx = preft.get(0, a[i].second + 1).seg_max;
        if (prefmx >= a[i].first + xs[a[i].second])
            continue;
        int suffmx = sufft.get(a[i].second, xs.size()).seg_max;
        if (suffmx >= a[i].first - xs[a[i].second])
            continue;
        ans += 1;
        preft.upd(a[i].second, {a[i].first + xs[a[i].second]});
        sufft.upd(a[i].second, {a[i].first - xs[a[i].second]});
    }
    cout << ans;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:77:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |     for (int i = 0; i < xs.size(); ++i)
      |                     ~~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 129 ms 17980 KB Output is correct
3 Correct 148 ms 17668 KB Output is correct
4 Correct 186 ms 20672 KB Output is correct
5 Correct 61 ms 16840 KB Output is correct
6 Correct 868 ms 69624 KB Output is correct
7 Correct 474 ms 45172 KB Output is correct
8 Correct 209 ms 22464 KB Output is correct
9 Correct 99 ms 21956 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory 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 1 ms 596 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 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 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct

Subtask #3
36.0 / 36.0

# Verdict Execution time Memory 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 1 ms 596 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 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 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 360 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 468 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 129 ms 17980 KB Output is correct
3 Correct 148 ms 17668 KB Output is correct
4 Correct 186 ms 20672 KB Output is correct
5 Correct 61 ms 16840 KB Output is correct
6 Correct 868 ms 69624 KB Output is correct
7 Correct 474 ms 45172 KB Output is correct
8 Correct 209 ms 22464 KB Output is correct
9 Correct 99 ms 21956 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 1 ms 596 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 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 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 360 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 441 ms 54528 KB Output is correct
37 Correct 602 ms 65024 KB Output is correct
38 Correct 772 ms 73572 KB Output is correct
39 Correct 599 ms 57372 KB Output is correct
40 Correct 731 ms 72592 KB Output is correct
41 Correct 587 ms 64680 KB Output is correct
42 Correct 543 ms 64744 KB Output is correct
43 Correct 778 ms 72568 KB Output is correct
44 Correct 769 ms 73552 KB Output is correct
45 Correct 951 ms 69720 KB Output is correct