oj.uz

Submission #604227

# Submission time Handle Problem Language Result Execution time Memory
604227 2022-07-24T22:09:45 Z elkernos Two Antennas (JOI19_antennas) C++17
100 / 100
 860 ms 39456 KB 
#include <bits/stdc++.h>

using namespace std;

struct ant {
    int h, a, b;
    void read() { cin >> h >> a >> b; }
};

const int oo = 1e9 + 213;

struct T {
    int d = -1, c = 0, lazy = oo;
    void merge(T l, T r)
    {
        assert(lazy == oo && l.lazy == oo && r.lazy == oo);
        d = max(l.d, r.d);
        c = max(l.c, r.c);
    }
};

const int nax = 2e5 + 213;

struct tree {
#define lc 2 * v
#define rc 2 * v + 1
#define m (l + r) / 2
    vector<T> t = vector<T>(4 * nax);
    void push(int v, int l, int r)
    {
        if(t[v].lazy == oo) {
            return;
        }
        if(l != r) {
            for(int to : {lc, rc}) {
                t[to].lazy = min(t[to].lazy, t[v].lazy);
            }
        }
        t[v].d = max(t[v].d, t[v].c - t[v].lazy);
        t[v].lazy = oo;
    }
    void setC(int v, int l, int r, int p, int x)
    {
        push(v, l, r);
        if(p < l || p > r) {
            return;
        }
        if(p <= l && r <= p) {
            t[v].c = x;
            return;
        }
        setC(lc, l, m, p, x);
        setC(rc, m + 1, r, p, x);
        t[v].merge(t[lc], t[rc]);
    }
    void putLazy(int v, int l, int r, int ql, int qr, int x)
    {
        push(v, l, r);
        if(qr < l || ql > r) {
            return;
        }
        if(ql <= l && r <= qr) {
            t[v].lazy = x;
            push(v, l, r);
            return;
        }
        putLazy(lc, l, m, ql, qr, x);
        putLazy(rc, m + 1, r, ql, qr, x);
        t[v].merge(t[lc], t[rc]);
    }
    int query(int v, int l, int r, int ql, int qr)
    {
        push(v, l, r);
        if(qr < l || ql > r) {
            return -1;
        }
        if(ql <= l && r <= qr) {
            return t[v].d;
        }
        int ret = -1;
        ret = max(ret, query(lc, l, m, ql, qr));
        ret = max(ret, query(rc, m + 1, r, ql, qr));
        t[v].merge(t[lc], t[rc]);
        return ret;
    }
};

int32_t main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n;
    cin >> n;
    vector<ant> in(n + 1);
    for(int i = 1; i <= n; i++) {
        in[i].read();
    }
    int q;
    cin >> q;
    vector<int> ql(q + 1), qr(q + 1), ans(q + 1, -1);
    for(int i = 1; i <= q; i++) {
        cin >> ql[i] >> qr[i];
    }
    auto solve = [&]() {
        vector<vector<int>> qs(n + 1), st(n + 1), en(n + 1);
        tree seg;
        for(int i = 1; i <= q; i++) {
            qs[qr[i]].emplace_back(i);
        }
        for(int i = 1; i <= n; i++) {
            if(i + in[i].a <= n) {
                st[i + in[i].a].emplace_back(i);
            }
            if(i + in[i].b <= n) {
                en[i + in[i].b].emplace_back(i);
            }
            for(int j : st[i]) {
                seg.setC(1, 1, n, j, in[j].h);
            }
            if(i - in[i].a >= 1) {
                seg.putLazy(1, 1, n, max(1, i - in[i].b), i - in[i].a, in[i].h);
            }
            for(int j : qs[i]) {
                ans[j] = max(ans[j], seg.query(1, 1, n, ql[j], qr[j]));
            }
            for(int j : en[i]) {
                seg.setC(1, 1, n, j, 0);
            }
        }
    };
    solve();
    reverse(1 + in.begin(), in.end());
    for(int i = 1; i <= q; i++) {
        ql[i] = n - ql[i] + 1;
        qr[i] = n - qr[i] + 1;
        swap(ql[i], qr[i]);
    }
    solve();
    for(int i = 1; i <= q; i++) {
        cout << ans[i] << '\n';
    }
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 9768 KB Output is correct
2 Correct 9 ms 9712 KB Output is correct
3 Correct 9 ms 9768 KB Output is correct
4 Correct 11 ms 9768 KB Output is correct
5 Correct 11 ms 9748 KB Output is correct
6 Correct 9 ms 9768 KB Output is correct
7 Correct 11 ms 9768 KB Output is correct
8 Correct 11 ms 9728 KB Output is correct
9 Correct 12 ms 9732 KB Output is correct
10 Correct 9 ms 9768 KB Output is correct
11 Correct 9 ms 9684 KB Output is correct
12 Correct 9 ms 9768 KB Output is correct
13 Correct 9 ms 9768 KB Output is correct
14 Correct 9 ms 9728 KB Output is correct
15 Correct 9 ms 9728 KB Output is correct
16 Correct 9 ms 9768 KB Output is correct
17 Correct 12 ms 9808 KB Output is correct
18 Correct 9 ms 9768 KB Output is correct
19 Correct 9 ms 9768 KB Output is correct
20 Correct 9 ms 9768 KB Output is correct
21 Correct 9 ms 9756 KB Output is correct
22 Correct 9 ms 9716 KB Output is correct
23 Correct 9 ms 9696 KB Output is correct
24 Correct 9 ms 9768 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 9768 KB Output is correct
2 Correct 9 ms 9712 KB Output is correct
3 Correct 9 ms 9768 KB Output is correct
4 Correct 11 ms 9768 KB Output is correct
5 Correct 11 ms 9748 KB Output is correct
6 Correct 9 ms 9768 KB Output is correct
7 Correct 11 ms 9768 KB Output is correct
8 Correct 11 ms 9728 KB Output is correct
9 Correct 12 ms 9732 KB Output is correct
10 Correct 9 ms 9768 KB Output is correct
11 Correct 9 ms 9684 KB Output is correct
12 Correct 9 ms 9768 KB Output is correct
13 Correct 9 ms 9768 KB Output is correct
14 Correct 9 ms 9728 KB Output is correct
15 Correct 9 ms 9728 KB Output is correct
16 Correct 9 ms 9768 KB Output is correct
17 Correct 12 ms 9808 KB Output is correct
18 Correct 9 ms 9768 KB Output is correct
19 Correct 9 ms 9768 KB Output is correct
20 Correct 9 ms 9768 KB Output is correct
21 Correct 9 ms 9756 KB Output is correct
22 Correct 9 ms 9716 KB Output is correct
23 Correct 9 ms 9696 KB Output is correct
24 Correct 9 ms 9768 KB Output is correct
25 Correct 114 ms 13808 KB Output is correct
26 Correct 30 ms 10528 KB Output is correct
27 Correct 182 ms 16628 KB Output is correct
28 Correct 171 ms 16652 KB Output is correct
29 Correct 115 ms 14988 KB Output is correct
30 Correct 134 ms 14792 KB Output is correct
31 Correct 156 ms 16208 KB Output is correct
32 Correct 170 ms 16676 KB Output is correct
33 Correct 163 ms 16416 KB Output is correct
34 Correct 89 ms 13376 KB Output is correct
35 Correct 162 ms 16840 KB Output is correct
36 Correct 179 ms 16688 KB Output is correct
37 Correct 101 ms 13584 KB Output is correct
38 Correct 166 ms 15760 KB Output is correct
39 Correct 32 ms 10836 KB Output is correct
40 Correct 169 ms 15736 KB Output is correct
41 Correct 137 ms 14560 KB Output is correct
42 Correct 170 ms 15772 KB Output is correct
43 Correct 63 ms 12044 KB Output is correct
44 Correct 198 ms 15788 KB Output is correct
45 Correct 41 ms 11004 KB Output is correct
46 Correct 169 ms 15768 KB Output is correct
47 Correct 51 ms 11592 KB Output is correct
48 Correct 174 ms 15768 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 369 ms 27640 KB Output is correct
2 Correct 446 ms 31092 KB Output is correct
3 Correct 325 ms 25168 KB Output is correct
4 Correct 457 ms 31124 KB Output is correct
5 Correct 179 ms 20320 KB Output is correct
6 Correct 413 ms 31164 KB Output is correct
7 Correct 358 ms 28444 KB Output is correct
8 Correct 433 ms 31052 KB Output is correct
9 Correct 53 ms 13568 KB Output is correct
10 Correct 401 ms 31232 KB Output is correct
11 Correct 314 ms 23640 KB Output is correct
12 Correct 406 ms 31072 KB Output is correct
13 Correct 258 ms 30132 KB Output is correct
14 Correct 259 ms 29800 KB Output is correct
15 Correct 264 ms 29080 KB Output is correct
16 Correct 228 ms 29188 KB Output is correct
17 Correct 268 ms 30284 KB Output is correct
18 Correct 276 ms 29288 KB Output is correct
19 Correct 254 ms 29416 KB Output is correct
20 Correct 290 ms 29520 KB Output is correct
21 Correct 246 ms 30020 KB Output is correct
22 Correct 256 ms 29608 KB Output is correct
23 Correct 277 ms 29792 KB Output is correct
24 Correct 234 ms 28840 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 9768 KB Output is correct
2 Correct 9 ms 9712 KB Output is correct
3 Correct 9 ms 9768 KB Output is correct
4 Correct 11 ms 9768 KB Output is correct
5 Correct 11 ms 9748 KB Output is correct
6 Correct 9 ms 9768 KB Output is correct
7 Correct 11 ms 9768 KB Output is correct
8 Correct 11 ms 9728 KB Output is correct
9 Correct 12 ms 9732 KB Output is correct
10 Correct 9 ms 9768 KB Output is correct
11 Correct 9 ms 9684 KB Output is correct
12 Correct 9 ms 9768 KB Output is correct
13 Correct 9 ms 9768 KB Output is correct
14 Correct 9 ms 9728 KB Output is correct
15 Correct 9 ms 9728 KB Output is correct
16 Correct 9 ms 9768 KB Output is correct
17 Correct 12 ms 9808 KB Output is correct
18 Correct 9 ms 9768 KB Output is correct
19 Correct 9 ms 9768 KB Output is correct
20 Correct 9 ms 9768 KB Output is correct
21 Correct 9 ms 9756 KB Output is correct
22 Correct 9 ms 9716 KB Output is correct
23 Correct 9 ms 9696 KB Output is correct
24 Correct 9 ms 9768 KB Output is correct
25 Correct 114 ms 13808 KB Output is correct
26 Correct 30 ms 10528 KB Output is correct
27 Correct 182 ms 16628 KB Output is correct
28 Correct 171 ms 16652 KB Output is correct
29 Correct 115 ms 14988 KB Output is correct
30 Correct 134 ms 14792 KB Output is correct
31 Correct 156 ms 16208 KB Output is correct
32 Correct 170 ms 16676 KB Output is correct
33 Correct 163 ms 16416 KB Output is correct
34 Correct 89 ms 13376 KB Output is correct
35 Correct 162 ms 16840 KB Output is correct
36 Correct 179 ms 16688 KB Output is correct
37 Correct 101 ms 13584 KB Output is correct
38 Correct 166 ms 15760 KB Output is correct
39 Correct 32 ms 10836 KB Output is correct
40 Correct 169 ms 15736 KB Output is correct
41 Correct 137 ms 14560 KB Output is correct
42 Correct 170 ms 15772 KB Output is correct
43 Correct 63 ms 12044 KB Output is correct
44 Correct 198 ms 15788 KB Output is correct
45 Correct 41 ms 11004 KB Output is correct
46 Correct 169 ms 15768 KB Output is correct
47 Correct 51 ms 11592 KB Output is correct
48 Correct 174 ms 15768 KB Output is correct
49 Correct 369 ms 27640 KB Output is correct
50 Correct 446 ms 31092 KB Output is correct
51 Correct 325 ms 25168 KB Output is correct
52 Correct 457 ms 31124 KB Output is correct
53 Correct 179 ms 20320 KB Output is correct
54 Correct 413 ms 31164 KB Output is correct
55 Correct 358 ms 28444 KB Output is correct
56 Correct 433 ms 31052 KB Output is correct
57 Correct 53 ms 13568 KB Output is correct
58 Correct 401 ms 31232 KB Output is correct
59 Correct 314 ms 23640 KB Output is correct
60 Correct 406 ms 31072 KB Output is correct
61 Correct 258 ms 30132 KB Output is correct
62 Correct 259 ms 29800 KB Output is correct
63 Correct 264 ms 29080 KB Output is correct
64 Correct 228 ms 29188 KB Output is correct
65 Correct 268 ms 30284 KB Output is correct
66 Correct 276 ms 29288 KB Output is correct
67 Correct 254 ms 29416 KB Output is correct
68 Correct 290 ms 29520 KB Output is correct
69 Correct 246 ms 30020 KB Output is correct
70 Correct 256 ms 29608 KB Output is correct
71 Correct 277 ms 29792 KB Output is correct
72 Correct 234 ms 28840 KB Output is correct
73 Correct 791 ms 35604 KB Output is correct
74 Correct 449 ms 31812 KB Output is correct
75 Correct 630 ms 32740 KB Output is correct
76 Correct 860 ms 39456 KB Output is correct
77 Correct 457 ms 25796 KB Output is correct
78 Correct 673 ms 36952 KB Output is correct
79 Correct 724 ms 36448 KB Output is correct
80 Correct 858 ms 39288 KB Output is correct
81 Correct 344 ms 20020 KB Output is correct
82 Correct 649 ms 35448 KB Output is correct
83 Correct 612 ms 31048 KB Output is correct
84 Correct 855 ms 39336 KB Output is correct
85 Correct 474 ms 34616 KB Output is correct
86 Correct 640 ms 36828 KB Output is correct
87 Correct 297 ms 30208 KB Output is correct
88 Correct 584 ms 35880 KB Output is correct
89 Correct 544 ms 35848 KB Output is correct
90 Correct 654 ms 36220 KB Output is correct
91 Correct 376 ms 32124 KB Output is correct
92 Correct 653 ms 36608 KB Output is correct
93 Correct 295 ms 31488 KB Output is correct
94 Correct 581 ms 36404 KB Output is correct
95 Correct 364 ms 31400 KB Output is correct
96 Correct 538 ms 34960 KB Output is correct