oj.uz

Submission #672326

# Submission time Handle Problem Language Result Execution time Memory
672326 2022-12-15T14:20:54 Z FedShat Two Antennas (JOI19_antennas) C++17
100 / 100
 1408 ms 41092 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr ll INFLL = numeric_limits<ll>::max() / 2;

template<class T>
istream &operator>>(istream &is, vector<T> &a) {
    for (auto &i : a) {
        is >> i;
    }
    return is;
}

struct SegTree {
    struct Node {
        int mx = -INF, ans = -2 * INF, push = INF;
    };

    vector<Node> tree;
    vector<int> hx, ans;
    int n;

    SegTree(int n) : n(n) {
        hx.resize(n, -INF);
        ans.resize(n, -2 * INF);
        tree.resize(4 * n);
    }

    void push(int v, int l, int r) {// min=
        if (l + 1 < r) {
            tree[2 * v + 1].push = min(tree[v].push, tree[2 * v + 1].push);
            tree[2 * v + 2].push = min(tree[v].push, tree[2 * v + 2].push);
        }
        tree[v].ans = max(tree[v].ans, tree[v].mx - tree[v].push);
        tree[v].push = INF;
    }

    Node pull(const Node &vl, const Node &vr) {
        Node ans;
        ans.mx = max(vl.mx, vr.mx);
        ans.ans = max({vl.ans, vr.ans});
        return ans;
    }

    void update_seg(int v, int l, int r, int li, int ri, int x) {// min= x
        push(v, l, r);
        if (li >= r || l >= ri) {
            return;
        }
        if (li <= l && r <= ri) {
            tree[v].push = x;
            push(v, l, r);
            return;
        }
        int m = (l + r) / 2;
        update_seg(2 * v + 1, l, m, li, ri, x);
        update_seg(2 * v + 2, m, r, li, ri, x);
        tree[v] = pull(tree[2 * v + 1], tree[2 * v + 2]);
    }

    void update_seg(int li, int ri, int x) {
        li = max(li, 0);
        ri = min(ri + 1, n);
        // for (int i = li; i < ri; ++i) {
        //     ans[i] = max(ans[i], hx[i] - x);
        // }
        update_seg(0, 0, n, li, ri, x);
    }

    void update_point(int v, int l, int r, int i, int x) {
        push(v, l, r);
        if (l + 1 == r) {
            tree[v].mx = x;
            return;
        }
        int m = (l + r) / 2;
        {
            push(2 * v + 1, l, m);
            push(2 * v + 2, m, r);
        }
        if (i < m) {
            update_point(2 * v + 1, l, m, i, x);
        } else {
            update_point(2 * v + 2, m, r, i, x);
        }
        tree[v] = pull(tree[2 * v + 1], tree[2 * v + 2]);
    }

    void update_point(int i, int x) {
        // hx[i] = x;
        update_point(0, 0, n, i, x);
    }

    int get(int v, int l, int r, int li, int ri) {
        push(v, l, r);
        if (li >= r || l >= ri) {
            return -2 * INF;
        }
        if (li <= l && r <= ri) {
            return tree[v].ans;
        }
        int m = (l + r) / 2;
        return max(get(2 * v + 1, l, m, li, ri), get(2 * v + 2, m, r, li, ri));
    }

    int get(int li, int ri) {
        // int res = -2 * INF;
        // for (int i = li; i < ri; ++i) {
        //     res = max(res, ans[i]);
        // }
        // return res;
        return get(0, 0, n, li, ri);
    }
};

struct Event {
    int x;
    int t;// -1 is opened, +1 is closed, 0 is new point, 2 is query
    int i;
    int l;// for query

    bool operator<(const Event &p) const {
        return x < p.x || (x == p.x && t < p.t);
    }
};

int main() {
    cin.tie(0)->sync_with_stdio(0);
#ifdef __APPLE__
    freopen("input.txt", "r", stdin);
#endif
    int n;
    cin >> n;
    vector<array<int, 3>> hab(n);
    for (int i = 0; i < n; ++i) {
        cin >> hab[i][0] >> hab[i][1] >> hab[i][2];
    }
    int q;
    cin >> q;
    vector<pair<int, int>> lr(q);
    for (int i = 0; i < q; ++i) {
        cin >> lr[i].first >> lr[i].second;
        --lr[i].first;
        --lr[i].second;
    }
    vector<int> ans(q, -2 * INF);
    auto solve = [&]() {
        vector<Event> e;
        for (int i = 0; i < n; ++i) {
            e.push_back({i, 0, i, -1});
            e.push_back({i + hab[i][1], -1, i, -1});
            e.push_back({i + hab[i][2], +1, i, -1});
        }
        for (int i = 0; i < q; ++i) {
            e.push_back({lr[i].second, 2, i, lr[i].first});
        }
        sort(e.begin(), e.end());
        SegTree st(n);
        for (auto [x, t, i, l] : e) {
            // cout << x << " " << t << " " << i << " " << l << "\n";
            if (t == -1) {
                st.update_point(i, hab[i][0]);
            } else if (t == 1) {
                st.update_point(i, -INF);
            } else if (t == 0) {
                st.update_seg(x - hab[i][2], x - hab[i][1], hab[i][0]);
            } else {
                ans[i] = max(ans[i], st.get(l, x + 1));
            }
        }
    };
    solve();
    for (auto &[l, r] : lr) {
        l = n - l - 1;
        r = n - r - 1;
        swap(l, r);
    }
    reverse(hab.begin(), hab.end());
    solve();
    for (auto i : ans) {
        cout << max(-1, i) << "\n";
    }
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 284 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 284 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 128 ms 8568 KB Output is correct
26 Correct 21 ms 1300 KB Output is correct
27 Correct 188 ms 9908 KB Output is correct
28 Correct 197 ms 9924 KB Output is correct
29 Correct 127 ms 8536 KB Output is correct
30 Correct 134 ms 8176 KB Output is correct
31 Correct 150 ms 10044 KB Output is correct
32 Correct 199 ms 10004 KB Output is correct
33 Correct 170 ms 9784 KB Output is correct
34 Correct 91 ms 5052 KB Output is correct
35 Correct 192 ms 9992 KB Output is correct
36 Correct 191 ms 10052 KB Output is correct
37 Correct 113 ms 5532 KB Output is correct
38 Correct 207 ms 10016 KB Output is correct
39 Correct 30 ms 2108 KB Output is correct
40 Correct 196 ms 10048 KB Output is correct
41 Correct 140 ms 8464 KB Output is correct
42 Correct 185 ms 10024 KB Output is correct
43 Correct 71 ms 4268 KB Output is correct
44 Correct 188 ms 10028 KB Output is correct
45 Correct 35 ms 2276 KB Output is correct
46 Correct 198 ms 10024 KB Output is correct
47 Correct 66 ms 2848 KB Output is correct
48 Correct 196 ms 9996 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 701 ms 27380 KB Output is correct
2 Correct 835 ms 33068 KB Output is correct
3 Correct 529 ms 19940 KB Output is correct
4 Correct 800 ms 33080 KB Output is correct
5 Correct 348 ms 15932 KB Output is correct
6 Correct 784 ms 33140 KB Output is correct
7 Correct 659 ms 30772 KB Output is correct
8 Correct 882 ms 33072 KB Output is correct
9 Correct 96 ms 4832 KB Output is correct
10 Correct 803 ms 33072 KB Output is correct
11 Correct 471 ms 18660 KB Output is correct
12 Correct 761 ms 33004 KB Output is correct
13 Correct 712 ms 32980 KB Output is correct
14 Correct 669 ms 32912 KB Output is correct
15 Correct 689 ms 32892 KB Output is correct
16 Correct 647 ms 32944 KB Output is correct
17 Correct 726 ms 32944 KB Output is correct
18 Correct 678 ms 32908 KB Output is correct
19 Correct 659 ms 32876 KB Output is correct
20 Correct 695 ms 32972 KB Output is correct
21 Correct 637 ms 32928 KB Output is correct
22 Correct 664 ms 32900 KB Output is correct
23 Correct 662 ms 32952 KB Output is correct
24 Correct 665 ms 32916 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 284 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 128 ms 8568 KB Output is correct
26 Correct 21 ms 1300 KB Output is correct
27 Correct 188 ms 9908 KB Output is correct
28 Correct 197 ms 9924 KB Output is correct
29 Correct 127 ms 8536 KB Output is correct
30 Correct 134 ms 8176 KB Output is correct
31 Correct 150 ms 10044 KB Output is correct
32 Correct 199 ms 10004 KB Output is correct
33 Correct 170 ms 9784 KB Output is correct
34 Correct 91 ms 5052 KB Output is correct
35 Correct 192 ms 9992 KB Output is correct
36 Correct 191 ms 10052 KB Output is correct
37 Correct 113 ms 5532 KB Output is correct
38 Correct 207 ms 10016 KB Output is correct
39 Correct 30 ms 2108 KB Output is correct
40 Correct 196 ms 10048 KB Output is correct
41 Correct 140 ms 8464 KB Output is correct
42 Correct 185 ms 10024 KB Output is correct
43 Correct 71 ms 4268 KB Output is correct
44 Correct 188 ms 10028 KB Output is correct
45 Correct 35 ms 2276 KB Output is correct
46 Correct 198 ms 10024 KB Output is correct
47 Correct 66 ms 2848 KB Output is correct
48 Correct 196 ms 9996 KB Output is correct
49 Correct 701 ms 27380 KB Output is correct
50 Correct 835 ms 33068 KB Output is correct
51 Correct 529 ms 19940 KB Output is correct
52 Correct 800 ms 33080 KB Output is correct
53 Correct 348 ms 15932 KB Output is correct
54 Correct 784 ms 33140 KB Output is correct
55 Correct 659 ms 30772 KB Output is correct
56 Correct 882 ms 33072 KB Output is correct
57 Correct 96 ms 4832 KB Output is correct
58 Correct 803 ms 33072 KB Output is correct
59 Correct 471 ms 18660 KB Output is correct
60 Correct 761 ms 33004 KB Output is correct
61 Correct 712 ms 32980 KB Output is correct
62 Correct 669 ms 32912 KB Output is correct
63 Correct 689 ms 32892 KB Output is correct
64 Correct 647 ms 32944 KB Output is correct
65 Correct 726 ms 32944 KB Output is correct
66 Correct 678 ms 32908 KB Output is correct
67 Correct 659 ms 32876 KB Output is correct
68 Correct 695 ms 32972 KB Output is correct
69 Correct 637 ms 32928 KB Output is correct
70 Correct 664 ms 32900 KB Output is correct
71 Correct 662 ms 32952 KB Output is correct
72 Correct 665 ms 32916 KB Output is correct
73 Correct 906 ms 37352 KB Output is correct
74 Correct 892 ms 33640 KB Output is correct
75 Correct 971 ms 36112 KB Output is correct
76 Correct 1287 ms 41092 KB Output is correct
77 Correct 699 ms 21696 KB Output is correct
78 Correct 1154 ms 38392 KB Output is correct
79 Correct 1084 ms 38896 KB Output is correct
80 Correct 1408 ms 41092 KB Output is correct
81 Correct 383 ms 18516 KB Output is correct
82 Correct 1108 ms 36928 KB Output is correct
83 Correct 918 ms 34816 KB Output is correct
84 Correct 1370 ms 41092 KB Output is correct
85 Correct 1060 ms 37532 KB Output is correct
86 Correct 1018 ms 40992 KB Output is correct
87 Correct 711 ms 34004 KB Output is correct
88 Correct 982 ms 40976 KB Output is correct
89 Correct 929 ms 38912 KB Output is correct
90 Correct 995 ms 40988 KB Output is correct
91 Correct 776 ms 35560 KB Output is correct
92 Correct 988 ms 40960 KB Output is correct
93 Correct 721 ms 34256 KB Output is correct
94 Correct 986 ms 41044 KB Output is correct
95 Correct 745 ms 35092 KB Output is correct
96 Correct 1026 ms 41032 KB Output is correct