oj.uz

Submission #332890

# Submission time Handle Problem Language Result Execution time Memory
332890 2020-12-04T00:03:07 Z 12tqian Two Antennas (JOI19_antennas) C++17
100 / 100
 1267 ms 28180 KB 
#include <bits/stdc++.h>

const int INF = 1e9;

template <class T> struct LazySeg {
    int sz;
    std::vector<T> c; // stores max of c
    std::vector<T> d; // stores max of d
    std::vector<T> lazy; // stores what you subtract max with
    void init(int n) {
        sz = 1;
        while (sz < n) sz *= 2;
        c.assign(2 * sz, -INF);
        d.assign(2 * sz, -INF);
        lazy.assign(2 * sz, -INF);
    }   
    void pull(int ind) {
        c[ind] = std::max(c[2 * ind], c[2 * ind + 1]);
        d[ind] = std::max(d[2 * ind], d[2 * ind + 1]);
    }
    void push(int ind, int L, int R) {
        d[ind] = std::max(d[ind], c[ind] + lazy[ind]);
        if (L != R) {
            lazy[2 * ind] = std::max(lazy[2 * ind], lazy[ind]);
            lazy[2 * ind + 1] = std::max(lazy[2 * ind + 1], lazy[ind]);
        }
        lazy[ind] = -INF;
    }
    void set(int p, T val, int ind = 1, int L = 0, int R = -1) {
        if (R == -1) R += sz;   
        push(ind, L, R);
        if (p < L || R < p) return; 
        if (L == R) {
            c[ind] = val;
            // push(ind, L, R);    
            return;
        }
        int M = (L + R) / 2;
        set(p, val, 2 * ind, L, M);
        set(p, val, 2 * ind + 1, M + 1, R);
        pull(ind);
    }
    void set_max(int lo, int hi, T val, int ind = 1, int L = 0, int R = -1) {
        if (R == -1) R += sz;
        push(ind, L, R);
        if (R < lo || hi < L) return;
        if (lo <= L && R <= hi) {
            lazy[ind] = val;
            push(ind, L, R);
            return;
        }
        int M = (L + R) / 2;
        set_max(lo, hi, val, 2 * ind, L, M);
        set_max(lo, hi, val, 2 * ind + 1, M + 1, R);
        pull(ind);
    }
    T qmax(int t, int lo, int hi, int ind = 1, int L = 0, int R = -1) {
        if (R == -1) R += sz;
        push(ind, L, R);    
        if (R < lo || hi < L) return -INF;
        if (lo <= L && R <= hi) return (t == 0 ? c[ind] : d[ind]);
        int M = (L + R) / 2;
        return std::max(qmax(t, lo, hi, 2 * ind, L, M), qmax(t, lo, hi, 2 * ind + 1, M + 1, R));
    }
};

int main() {
    using namespace std;
    ios_base::sync_with_stdio(0);
    int n; cin >> n;
    vector<int> h(n), a(n), b(n);
    for (int i = 0; i < n; i++) 
        cin >> h[i] >> a[i] >> b[i];
    int q; cin >> q;
    vector<array<int, 2>> queries(q);
    for (int i = 0; i < q; i++)
        cin >> queries[i][0] >> queries[i][1], queries[i][0]--, queries[i][1]--;
    vector<int> ans(q, -1);
    LazySeg<int> seg;
    int tt = 0;
    auto solve = [&]() {
        tt++;
        seg.init(n);
        vector<vector<array<int, 2>>> events(n);
        for (int i = 0; i < n; i++) {
            if (i + a[i] < n)
                events[i + a[i]].push_back({1, i});
            if (i + b[i] < n)
                events[i + b[i]].push_back({3, i});
            events[i].push_back({2, i});
        }
        for (int i = 0; i < q; i++) 
            events[queries[i][1]].push_back({4, i});
        for (auto& v : events)
            sort(v.begin(), v.end());        
        for (int j = 0; j < n; j++) {
            for (auto& e : events[j]) {
                int id = e[1];
                if (e[0] == 1) {
                    seg.set(id, h[id]);
                } else if (e[0] == 2) {
                    int l = max(0, j - b[id]);
                    int r = j - a[id];
                    if (l <= r) {
                        seg.set_max(l, r, -h[id]);
                    }
                } else if (e[0] == 3) {
                    seg.set(id, -INF);
                } else if (e[0] == 4) {
                    int l = queries[id][0];
                    int r = queries[id][1];
                    ans[id] = max(ans[id], seg.qmax(1, l, r));
                }
            }
        }
    };
    solve();
    reverse(a.begin(), a.end());
    reverse(b.begin(), b.end());
    reverse(h.begin(), h.end());
    for (int i = 0; i < q; i++) {
        queries[i][0] = n - 1 - queries[i][0];
        queries[i][1] = n - 1 - queries[i][1];
        swap(queries[i][0], queries[i][1]);
    }
    solve();
    for (int i = 0; i < q; i++)
        cout << ans[i] << '\n';
    return 0;
}

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 2 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 36 ms 364 KB Output is correct
21 Correct 37 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 164 ms 4112 KB Output is correct
26 Correct 20 ms 1132 KB Output is correct
27 Correct 241 ms 5896 KB Output is correct
28 Correct 288 ms 6144 KB Output is correct
29 Correct 161 ms 4364 KB Output is correct
30 Correct 155 ms 5200 KB Output is correct
31 Correct 215 ms 5268 KB Output is correct
32 Correct 238 ms 6068 KB Output is correct
33 Correct 238 ms 5532 KB Output is correct
34 Correct 114 ms 3692 KB Output is correct
35 Correct 245 ms 5780 KB Output is correct
36 Correct 255 ms 6056 KB Output is correct
37 Correct 137 ms 3820 KB Output is correct
38 Correct 247 ms 5484 KB Output is correct
39 Correct 34 ms 1388 KB Output is correct
40 Correct 246 ms 5424 KB Output is correct
41 Correct 174 ms 4564 KB Output is correct
42 Correct 246 ms 5356 KB Output is correct
43 Correct 78 ms 2400 KB Output is correct
44 Correct 241 ms 5356 KB Output is correct
45 Correct 43 ms 1516 KB Output is correct
46 Correct 247 ms 5356 KB Output is correct
47 Correct 62 ms 2028 KB Output is correct
48 Correct 247 ms 5356 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 614 ms 19308 KB Output is correct
2 Correct 667 ms 20720 KB Output is correct
3 Correct 433 ms 16492 KB Output is correct
4 Correct 662 ms 20688 KB Output is correct
5 Correct 273 ms 10092 KB Output is correct
6 Correct 702 ms 20664 KB Output is correct
7 Correct 556 ms 18912 KB Output is correct
8 Correct 634 ms 20628 KB Output is correct
9 Correct 67 ms 3332 KB Output is correct
10 Correct 694 ms 20688 KB Output is correct
11 Correct 364 ms 12272 KB Output is correct
12 Correct 682 ms 20716 KB Output is correct
13 Correct 552 ms 22160 KB Output is correct
14 Correct 529 ms 22388 KB Output is correct
15 Correct 499 ms 22228 KB Output is correct
16 Correct 504 ms 22204 KB Output is correct
17 Correct 596 ms 22124 KB Output is correct
18 Correct 533 ms 22096 KB Output is correct
19 Correct 536 ms 22296 KB Output is correct
20 Correct 525 ms 22124 KB Output is correct
21 Correct 533 ms 22128 KB Output is correct
22 Correct 536 ms 22184 KB Output is correct
23 Correct 527 ms 22292 KB Output is correct
24 Correct 486 ms 22492 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 2 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 36 ms 364 KB Output is correct
21 Correct 37 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 164 ms 4112 KB Output is correct
26 Correct 20 ms 1132 KB Output is correct
27 Correct 241 ms 5896 KB Output is correct
28 Correct 288 ms 6144 KB Output is correct
29 Correct 161 ms 4364 KB Output is correct
30 Correct 155 ms 5200 KB Output is correct
31 Correct 215 ms 5268 KB Output is correct
32 Correct 238 ms 6068 KB Output is correct
33 Correct 238 ms 5532 KB Output is correct
34 Correct 114 ms 3692 KB Output is correct
35 Correct 245 ms 5780 KB Output is correct
36 Correct 255 ms 6056 KB Output is correct
37 Correct 137 ms 3820 KB Output is correct
38 Correct 247 ms 5484 KB Output is correct
39 Correct 34 ms 1388 KB Output is correct
40 Correct 246 ms 5424 KB Output is correct
41 Correct 174 ms 4564 KB Output is correct
42 Correct 246 ms 5356 KB Output is correct
43 Correct 78 ms 2400 KB Output is correct
44 Correct 241 ms 5356 KB Output is correct
45 Correct 43 ms 1516 KB Output is correct
46 Correct 247 ms 5356 KB Output is correct
47 Correct 62 ms 2028 KB Output is correct
48 Correct 247 ms 5356 KB Output is correct
49 Correct 614 ms 19308 KB Output is correct
50 Correct 667 ms 20720 KB Output is correct
51 Correct 433 ms 16492 KB Output is correct
52 Correct 662 ms 20688 KB Output is correct
53 Correct 273 ms 10092 KB Output is correct
54 Correct 702 ms 20664 KB Output is correct
55 Correct 556 ms 18912 KB Output is correct
56 Correct 634 ms 20628 KB Output is correct
57 Correct 67 ms 3332 KB Output is correct
58 Correct 694 ms 20688 KB Output is correct
59 Correct 364 ms 12272 KB Output is correct
60 Correct 682 ms 20716 KB Output is correct
61 Correct 552 ms 22160 KB Output is correct
62 Correct 529 ms 22388 KB Output is correct
63 Correct 499 ms 22228 KB Output is correct
64 Correct 504 ms 22204 KB Output is correct
65 Correct 596 ms 22124 KB Output is correct
66 Correct 533 ms 22096 KB Output is correct
67 Correct 536 ms 22296 KB Output is correct
68 Correct 525 ms 22124 KB Output is correct
69 Correct 533 ms 22128 KB Output is correct
70 Correct 536 ms 22184 KB Output is correct
71 Correct 527 ms 22292 KB Output is correct
72 Correct 486 ms 22492 KB Output is correct
73 Correct 990 ms 24940 KB Output is correct
74 Correct 704 ms 21452 KB Output is correct
75 Correct 953 ms 24328 KB Output is correct
76 Correct 1237 ms 27924 KB Output is correct
77 Correct 602 ms 15400 KB Output is correct
78 Correct 1081 ms 25724 KB Output is correct
79 Correct 1128 ms 26112 KB Output is correct
80 Correct 1267 ms 28180 KB Output is correct
81 Correct 419 ms 10240 KB Output is correct
82 Correct 966 ms 24468 KB Output is correct
83 Correct 872 ms 19580 KB Output is correct
84 Correct 1247 ms 28032 KB Output is correct
85 Correct 930 ms 25348 KB Output is correct
86 Correct 1161 ms 27772 KB Output is correct
87 Correct 591 ms 22556 KB Output is correct
88 Correct 1117 ms 27268 KB Output is correct
89 Correct 1026 ms 26080 KB Output is correct
90 Correct 1155 ms 27340 KB Output is correct
91 Correct 736 ms 23564 KB Output is correct
92 Correct 1158 ms 27452 KB Output is correct
93 Correct 634 ms 22880 KB Output is correct
94 Correct 1139 ms 27600 KB Output is correct
95 Correct 685 ms 23168 KB Output is correct
96 Correct 1105 ms 27444 KB Output is correct