oj.uz

Submission #613709

# Submission time Handle Problem Language Result Execution time Memory
613709 2022-07-30T09:37:45 Z tengiz05 Two Antennas (JOI19_antennas) C++17
100 / 100
 1297 ms 45216 KB 
#include <bits/stdc++.h>

using i64 = long long;
using namespace std;

constexpr int N = 2E5;
constexpr i64 inf = 1E18;

struct Info {
    i64 max;
    i64 allmax;
    Info() : max(-2 * inf), allmax(-2 * inf) {}
};
Info operator+(const Info &a, const Info &b) {
    Info c;
    c.max = max(a.max, b.max);
    c.allmax = max(a.allmax, b.allmax);
    return c;
}
struct Tag {
    i64 x;
    i64 mx;
    Tag(i64 x = 0) : x(x), mx(max(0LL, x)) {}
};
void apply(Tag &a, const Tag &b) {
    a.mx = max(a.mx, a.x + b.mx);
    a.x += b.x;
}
void apply(Info &a, const Tag &b) {
    a.allmax = max({a.allmax, a.max + b.mx});
    a.max += b.x;
}
template<class Info, class Tag,
    class Merge = std::plus<Info>>
struct LazySegmentTree {
    const int n;
    const Merge merge;
    std::vector<Info> info;
    std::vector<Tag> tag;
    LazySegmentTree(int n) : n(n), merge(Merge()), info(4 << std::__lg(n)), tag(4 << std::__lg(n)) {}
    LazySegmentTree(std::vector<Info> init) : LazySegmentTree(init.size()) {
        std::function<void(int, int, int)> build = [&](int p, int l, int r) {
            if (r - l == 1) {
                info[p] = init[l];
                return;
            }
            int m = (l + r) / 2;
            build(2 * p, l, m);
            build(2 * p + 1, m, r);
            pull(p);
        };
        build(1, 0, n);
    }
    void reconstruct() {
        info.assign(4 << std::__lg(n), Info());
        tag.assign(4 << std::__lg(n), Tag());
    }
    void pull(int p) {
        info[p] = merge(info[2 * p], info[2 * p + 1]);
    }
    void apply(int p, const Tag &v) {
        ::apply(info[p], v);
        ::apply(tag[p], v);
    }
    void push(int p) {
        apply(2 * p, tag[p]);
        apply(2 * p + 1, tag[p]);
        tag[p] = Tag();
    }
    void modify(int p, int l, int r, int x, Info v) {
        if (r - l == 1) {
            info[p] = v;
            return;
        }
        int m = (l + r) / 2;
        push(p);
        if (x < m) {
            modify(2 * p, l, m, x, v);
        } else {
            modify(2 * p + 1, m, r, x, v);
        }
        pull(p);
    }
    void modify(int x, Info v) {
        modify(1, 0, n, x, v);
    }
    Info rangeQuery(int p, int l, int r, int x, int y) {
        if (l >= y || r <= x) {
            return Info();
        }
        if (l >= x && r <= y) {
            return info[p];
        }
        int m = (l + r) / 2;
        push(p);
        return merge(rangeQuery(2 * p, l, m, x, y), rangeQuery(2 * p + 1, m, r, x, y));
    }
    Info rangeQuery(int l, int r) {
        return rangeQuery(1, 0, n, l, r);
    }
    void rangeApply(int p, int l, int r, int x, int y, const Tag &v) {
        if (l >= y || r <= x) {
            return;
        }
        if (l >= x && r <= y) {
            apply(p, v);
            return;
        }
        int m = (l + r) / 2;
        push(p);
        rangeApply(2 * p, l, m, x, y, v);
        rangeApply(2 * p + 1, m, r, x, y, v);
        pull(p);
    }
    void rangeApply(int l, int r, const Tag &v) {
        return rangeApply(1, 0, n, l, r, v);
    }
};
LazySegmentTree<Info, Tag> s(N);
i64 A[N], historyMax[N];
void update(int p, i64 x) {
    auto old = s.rangeQuery(p, p + 1);
    s.rangeApply(p, p + 1, x - old.max);
}
void add(int l, int r, i64 x) {
    s.rangeApply(l, r, x);
}
int query(int l, int r) {
    return max(-1LL, s.rangeQuery(l, r).allmax);
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    for (int i = 0; i < N; i++) {
        A[i] = -2 * inf;
        historyMax[i] = -1;
    }
    
    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];
    }
    
    vector<array<int, 3>> g;
    for (int i = 0; i < n; i++) {
        g.push_back({i + a[i], 1, i});
        g.push_back({i + b[i] + 1, -1, i});
    }
    
    sort(g.begin(), g.end());
    
    int q;
    cin >> q;
    
    vector<vector<array<int, 2>>> Q(n);
    vector<int> ans(q);
    for (int i = 0; i < q; i++) {
        int l, r;
        cin >> l >> r;
        l--;
        r--;
        Q[r].push_back({l, i});
    }
    
    int k = 0;
    
    for (int i = 0; i < n; i++) {
        while (k < int(g.size()) && g[k][0] == i) {
            int p = g[k][2];
            if (g[k][1] == 1) {
                update(p, -inf + h[p]);
            } else {
                update(p, -2 * inf);
            }
            k++;
        }
        int L = max(0, i - b[i]);
        int R = max(0, i - a[i] + 1);
        add(L, R, -h[i]);
        add(L, R, inf);
        for (auto [l, id] : Q[i]) {
            ans[id] = query(l, i + 1);
        }
        add(L, R, -inf);
        add(L, R, h[i]);
    }
    
    for (int i = 0; i < N; i++) {
        A[i] = -2 * inf;
        historyMax[i] = -1;
    }
    
    k = 0;
    
    s.reconstruct();
    
    for (int i = 0; i < n; i++) {
        while (k < int(g.size()) && g[k][0] == i) {
            int p = g[k][2];
            if (g[k][1] == 1) {
                update(p, -inf + -h[p]);
            } else {
                update(p, -2 * inf);
            }
            k++;
        }
        int L = max(0, i - b[i]);
        int R = max(0, i - a[i] + 1);
        add(L, R, h[i]);
        add(L, R, inf);
        for (auto [l, id] : Q[i]) {
            ans[id] = max(ans[id], query(l, i + 1));
        }
        add(L, R, -inf);
        add(L, R, -h[i]);
    }
    
    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 12 ms 19796 KB Output is correct
2 Correct 19 ms 19924 KB Output is correct
3 Correct 12 ms 19916 KB Output is correct
4 Correct 17 ms 19836 KB Output is correct
5 Correct 11 ms 19904 KB Output is correct
6 Correct 11 ms 19796 KB Output is correct
7 Correct 16 ms 19848 KB Output is correct
8 Correct 11 ms 19888 KB Output is correct
9 Correct 11 ms 19796 KB Output is correct
10 Correct 14 ms 19912 KB Output is correct
11 Correct 13 ms 19888 KB Output is correct
12 Correct 13 ms 19924 KB Output is correct
13 Correct 12 ms 19904 KB Output is correct
14 Correct 15 ms 19836 KB Output is correct
15 Correct 12 ms 19796 KB Output is correct
16 Correct 12 ms 19796 KB Output is correct
17 Correct 11 ms 19848 KB Output is correct
18 Correct 12 ms 19864 KB Output is correct
19 Correct 11 ms 19896 KB Output is correct
20 Correct 14 ms 19908 KB Output is correct
21 Correct 11 ms 19796 KB Output is correct
22 Correct 12 ms 19844 KB Output is correct
23 Correct 12 ms 19796 KB Output is correct
24 Correct 11 ms 19852 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19796 KB Output is correct
2 Correct 19 ms 19924 KB Output is correct
3 Correct 12 ms 19916 KB Output is correct
4 Correct 17 ms 19836 KB Output is correct
5 Correct 11 ms 19904 KB Output is correct
6 Correct 11 ms 19796 KB Output is correct
7 Correct 16 ms 19848 KB Output is correct
8 Correct 11 ms 19888 KB Output is correct
9 Correct 11 ms 19796 KB Output is correct
10 Correct 14 ms 19912 KB Output is correct
11 Correct 13 ms 19888 KB Output is correct
12 Correct 13 ms 19924 KB Output is correct
13 Correct 12 ms 19904 KB Output is correct
14 Correct 15 ms 19836 KB Output is correct
15 Correct 12 ms 19796 KB Output is correct
16 Correct 12 ms 19796 KB Output is correct
17 Correct 11 ms 19848 KB Output is correct
18 Correct 12 ms 19864 KB Output is correct
19 Correct 11 ms 19896 KB Output is correct
20 Correct 14 ms 19908 KB Output is correct
21 Correct 11 ms 19796 KB Output is correct
22 Correct 12 ms 19844 KB Output is correct
23 Correct 12 ms 19796 KB Output is correct
24 Correct 11 ms 19852 KB Output is correct
25 Correct 166 ms 23856 KB Output is correct
26 Correct 38 ms 20500 KB Output is correct
27 Correct 255 ms 25332 KB Output is correct
28 Correct 289 ms 25360 KB Output is correct
29 Correct 155 ms 23780 KB Output is correct
30 Correct 150 ms 23456 KB Output is correct
31 Correct 189 ms 24592 KB Output is correct
32 Correct 231 ms 25348 KB Output is correct
33 Correct 211 ms 25124 KB Output is correct
34 Correct 121 ms 22536 KB Output is correct
35 Correct 212 ms 25304 KB Output is correct
36 Correct 235 ms 25336 KB Output is correct
37 Correct 129 ms 22516 KB Output is correct
38 Correct 238 ms 24420 KB Output is correct
39 Correct 45 ms 20568 KB Output is correct
40 Correct 222 ms 24392 KB Output is correct
41 Correct 176 ms 23160 KB Output is correct
42 Correct 222 ms 24384 KB Output is correct
43 Correct 85 ms 21444 KB Output is correct
44 Correct 241 ms 24460 KB Output is correct
45 Correct 58 ms 20680 KB Output is correct
46 Correct 224 ms 24360 KB Output is correct
47 Correct 73 ms 21084 KB Output is correct
48 Correct 240 ms 24452 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1012 ms 30976 KB Output is correct
2 Correct 982 ms 33836 KB Output is correct
3 Correct 676 ms 30344 KB Output is correct
4 Correct 951 ms 33880 KB Output is correct
5 Correct 395 ms 27404 KB Output is correct
6 Correct 919 ms 33836 KB Output is correct
7 Correct 805 ms 32316 KB Output is correct
8 Correct 912 ms 34156 KB Output is correct
9 Correct 142 ms 22528 KB Output is correct
10 Correct 1039 ms 34092 KB Output is correct
11 Correct 557 ms 29704 KB Output is correct
12 Correct 873 ms 34140 KB Output is correct
13 Correct 902 ms 34148 KB Output is correct
14 Correct 793 ms 34168 KB Output is correct
15 Correct 785 ms 34260 KB Output is correct
16 Correct 706 ms 34244 KB Output is correct
17 Correct 838 ms 34268 KB Output is correct
18 Correct 754 ms 34284 KB Output is correct
19 Correct 819 ms 34300 KB Output is correct
20 Correct 726 ms 34232 KB Output is correct
21 Correct 759 ms 34280 KB Output is correct
22 Correct 776 ms 34220 KB Output is correct
23 Correct 775 ms 34248 KB Output is correct
24 Correct 706 ms 34352 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19796 KB Output is correct
2 Correct 19 ms 19924 KB Output is correct
3 Correct 12 ms 19916 KB Output is correct
4 Correct 17 ms 19836 KB Output is correct
5 Correct 11 ms 19904 KB Output is correct
6 Correct 11 ms 19796 KB Output is correct
7 Correct 16 ms 19848 KB Output is correct
8 Correct 11 ms 19888 KB Output is correct
9 Correct 11 ms 19796 KB Output is correct
10 Correct 14 ms 19912 KB Output is correct
11 Correct 13 ms 19888 KB Output is correct
12 Correct 13 ms 19924 KB Output is correct
13 Correct 12 ms 19904 KB Output is correct
14 Correct 15 ms 19836 KB Output is correct
15 Correct 12 ms 19796 KB Output is correct
16 Correct 12 ms 19796 KB Output is correct
17 Correct 11 ms 19848 KB Output is correct
18 Correct 12 ms 19864 KB Output is correct
19 Correct 11 ms 19896 KB Output is correct
20 Correct 14 ms 19908 KB Output is correct
21 Correct 11 ms 19796 KB Output is correct
22 Correct 12 ms 19844 KB Output is correct
23 Correct 12 ms 19796 KB Output is correct
24 Correct 11 ms 19852 KB Output is correct
25 Correct 166 ms 23856 KB Output is correct
26 Correct 38 ms 20500 KB Output is correct
27 Correct 255 ms 25332 KB Output is correct
28 Correct 289 ms 25360 KB Output is correct
29 Correct 155 ms 23780 KB Output is correct
30 Correct 150 ms 23456 KB Output is correct
31 Correct 189 ms 24592 KB Output is correct
32 Correct 231 ms 25348 KB Output is correct
33 Correct 211 ms 25124 KB Output is correct
34 Correct 121 ms 22536 KB Output is correct
35 Correct 212 ms 25304 KB Output is correct
36 Correct 235 ms 25336 KB Output is correct
37 Correct 129 ms 22516 KB Output is correct
38 Correct 238 ms 24420 KB Output is correct
39 Correct 45 ms 20568 KB Output is correct
40 Correct 222 ms 24392 KB Output is correct
41 Correct 176 ms 23160 KB Output is correct
42 Correct 222 ms 24384 KB Output is correct
43 Correct 85 ms 21444 KB Output is correct
44 Correct 241 ms 24460 KB Output is correct
45 Correct 58 ms 20680 KB Output is correct
46 Correct 224 ms 24360 KB Output is correct
47 Correct 73 ms 21084 KB Output is correct
48 Correct 240 ms 24452 KB Output is correct
49 Correct 1012 ms 30976 KB Output is correct
50 Correct 982 ms 33836 KB Output is correct
51 Correct 676 ms 30344 KB Output is correct
52 Correct 951 ms 33880 KB Output is correct
53 Correct 395 ms 27404 KB Output is correct
54 Correct 919 ms 33836 KB Output is correct
55 Correct 805 ms 32316 KB Output is correct
56 Correct 912 ms 34156 KB Output is correct
57 Correct 142 ms 22528 KB Output is correct
58 Correct 1039 ms 34092 KB Output is correct
59 Correct 557 ms 29704 KB Output is correct
60 Correct 873 ms 34140 KB Output is correct
61 Correct 902 ms 34148 KB Output is correct
62 Correct 793 ms 34168 KB Output is correct
63 Correct 785 ms 34260 KB Output is correct
64 Correct 706 ms 34244 KB Output is correct
65 Correct 838 ms 34268 KB Output is correct
66 Correct 754 ms 34284 KB Output is correct
67 Correct 819 ms 34300 KB Output is correct
68 Correct 726 ms 34232 KB Output is correct
69 Correct 759 ms 34280 KB Output is correct
70 Correct 776 ms 34220 KB Output is correct
71 Correct 775 ms 34248 KB Output is correct
72 Correct 706 ms 34352 KB Output is correct
73 Correct 1042 ms 41336 KB Output is correct
74 Correct 880 ms 37040 KB Output is correct
75 Correct 943 ms 39928 KB Output is correct
76 Correct 1297 ms 45216 KB Output is correct
77 Correct 579 ms 33444 KB Output is correct
78 Correct 1104 ms 42452 KB Output is correct
79 Correct 1088 ms 42860 KB Output is correct
80 Correct 1217 ms 45216 KB Output is correct
81 Correct 371 ms 29856 KB Output is correct
82 Correct 1033 ms 40876 KB Output is correct
83 Correct 822 ms 38512 KB Output is correct
84 Correct 1213 ms 45216 KB Output is correct
85 Correct 1084 ms 40844 KB Output is correct
86 Correct 1120 ms 43964 KB Output is correct
87 Correct 815 ms 37284 KB Output is correct
88 Correct 1064 ms 43952 KB Output is correct
89 Correct 1111 ms 41976 KB Output is correct
90 Correct 1252 ms 43960 KB Output is correct
91 Correct 1002 ms 39020 KB Output is correct
92 Correct 1203 ms 43948 KB Output is correct
93 Correct 828 ms 37552 KB Output is correct
94 Correct 1201 ms 43952 KB Output is correct
95 Correct 916 ms 38336 KB Output is correct
96 Correct 1138 ms 43960 KB Output is correct