oj.uz

Submission #570218

# Submission time Handle Problem Language Result Execution time Memory
570218 2022-05-28T20:53:18 Z timreizin Two Antennas (JOI19_antennas) C++17
100 / 100
 818 ms 56776 KB 
#include <iostream>
#include <vector>
#include <numeric>
#include <cmath>
#include <set>
#include <array>
#include <algorithm>

using namespace std;

using ll = long long;

const ll INF = 1e15;

struct segtree
{
    int n;
    vector<ll> mx, mod, tree;
    
    void push(int v)
    {
        if (mod[v] != 0)
        {
            mod[v << 1] = max(mod[v << 1], mod[v]);
            mod[v << 1 | 1] = max(mod[v << 1 | 1], mod[v]);
            tree[v << 1] = max(tree[v << 1], mx[v << 1] + mod[v]);
            tree[v << 1 | 1] = max(tree[v << 1 | 1], mx[v << 1 | 1] + mod[v]);
            mod[v] = 0;
        }
    }
    
    segtree(int n) : n(n)
    {
        mx.resize(4 * n, -INF);
        mod.resize(4 * n, 0);
        tree.resize(4 * n, -INF);
    }
    
    ll get(int a, int b, int l, int r, int v)
    {
        if (a > r || b < l) return -INF;
        if (a == l && b == r) return tree[v];
        int m = (l + r) >> 1;
        push(v);
        return max(get(a, min(b, m), l, m, v << 1), get(max(a, m + 1), b, m + 1, r, v << 1 | 1));
    }
    
    ll get(int a, int b)
    {
        return get(a, b, 0, n - 1, 1);
    }
    
    void updateH(int p, ll val, int l, int r, int v)
    {
        if (l > r) return;
        if (l == r)
        {
            mx[v] = val;
            tree[v] = max(tree[v], val);
            mod[v] = 0;
            return;
        }
        int m = (l + r) >> 1;
        push(v);
        if (p <= m) updateH(p, val, l, m, v << 1);
        else updateH(p, val, m + 1, r, v << 1 | 1);
        tree[v] = max({tree[v], tree[v << 1], tree[v << 1 | 1]});
        mx[v] = max(mx[v << 1], mx[v << 1 | 1]);
    }
    
    void updateH(int p, ll val)
    {
        updateH(p, val, 0, n - 1, 1);
    }
    
    void updateM(int a, int b, ll val, int l, int r, int v)
    {
        if (a > r || b < l) return;
        if (a == l && b == r)
        {
            mod[v] = max(mod[v], val);
            tree[v] = max(tree[v], mx[v] + mod[v]);
            return;
        }
        int m = (l + r) >> 1;
        push(v);
        updateM(a, min(b, m), val, l, m, v << 1);
        updateM(max(a, m + 1), b, val, m + 1, r, v << 1 | 1);
        tree[v] = max({tree[v], tree[v << 1], tree[v << 1 | 1]});
        mx[v] = max(mx[v << 1], mx[v << 1 | 1]);
    }
    
    void updateM(int a, int b, ll val)
    {
        updateM(a, b, val, 0, n - 1, 1);
    }
    
};

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n;
    cin >> n;
    vector<pair<int, int>> ab(n);
    vector<ll> h(n);
    for (int i = 0; i < n; ++i) cin >> h[i] >> ab[i].first >> ab[i].second;
    int q;
    cin >> q;
    vector<pair<int, int>> queries(q);
    for (auto &[l, r] : queries)
    {
        cin >> l >> r;
        --l;
        --r;
    }
    vector<int> inds(q);
    vector<pair<pair<int, int>, int>> events;
    segtree st(n);
    events.reserve(2 * n);
    iota(inds.begin(), inds.end(), 0);
    sort(inds.begin(), inds.end(), [&queries](int a, int b){ return queries[a].second < queries[b].second; });
    for (int i = 0; i < n; ++i)
    {
        events.emplace_back(pair(i + ab[i].first, 0), i);
        events.emplace_back(pair(i + ab[i].second, 1), i);
    }
    sort(events.begin(), events.end());
    vector<ll> result(q, -1);
    for (int i = 0, indE = 0, indQ = 0; i < n; ++i)
    {
        while (indE < 2 * n && events[indE].first <= pair(i, 0))
        {
            st.updateH(events[indE].second, -h[events[indE].second]);
            ++indE;
        }
        if (i - ab[i].first >= 0) st.updateM(max(0, i - ab[i].second), i - ab[i].first, h[i]);
        while (indQ < q && queries[inds[indQ]].second == i)
        {
            result[inds[indQ]] = max(result[inds[indQ]], st.get(queries[inds[indQ]].first, queries[inds[indQ]].second));
            ++indQ;
        }
        while (indE < 2 * n && events[indE].first <= pair(i, 1))
        {
            st.updateH(events[indE].second, -INF);
            ++indE;
        }
    }
    reverse(h.begin(), h.end());
    reverse(ab.begin(), ab.end());
    for (auto &i : queries) i = {n - i.second - 1, n - i.first - 1};
    events.clear();
    sort(inds.begin(), inds.end(), [&queries](int a, int b){ return queries[a].second < queries[b].second; });
    for (int i = 0; i < n; ++i)
    {
        events.emplace_back(pair(i + ab[i].first, 0), i);
        events.emplace_back(pair(i + ab[i].second, 1), i);
    }
    sort(events.begin(), events.end());
    st = segtree(n);
    for (int i = 0, indE = 0, indQ = 0; i < n; ++i)
    {
        while (indE < 2 * n && events[indE].first <= pair(i, 0))
        {
            st.updateH(events[indE].second, -h[events[indE].second]);
            ++indE;
        }
        if (i - ab[i].first >= 0) st.updateM(max(0, i - ab[i].second), i - ab[i].first, h[i]);
        while (indQ < q && queries[inds[indQ]].second == i)
        {
            result[inds[indQ]] = max(result[inds[indQ]], st.get(queries[inds[indQ]].first, queries[inds[indQ]].second));
            ++indQ;
        }
        while (indE < 2 * n && events[indE].first <= pair(i, 1))
        {
            st.updateH(events[indE].second, -INF);
            ++indE;
        }
        
    }
    for (ll i : result) cout << i << '\n';
    return 0;
}
/*
 5
 10 2 4
 1 1 1
 2 1 3
 1 1
 1
 100 1 1
 5
 1 2
 2 3
 1 3
 1 4
 1 5
 */

/*
 2
 10 2 4
 1 1 1
 1
 1 2
 */
//10 1 2 1 100
/*
3
6 1 1
8 1 1
2 2 2
1
1 3
*/
/*
4
8 1 2
1 1 1
5 1 1
7 1 3
1
2 4
 
3
1 1 1
5 1 1
7 1 3
1
1 3
*/

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 368 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 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 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 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 368 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 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 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 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 100 ms 4584 KB Output is correct
26 Correct 14 ms 1132 KB Output is correct
27 Correct 152 ms 6348 KB Output is correct
28 Correct 157 ms 8280 KB Output is correct
29 Correct 101 ms 5772 KB Output is correct
30 Correct 100 ms 5772 KB Output is correct
31 Correct 117 ms 7160 KB Output is correct
32 Correct 149 ms 8268 KB Output is correct
33 Correct 145 ms 7628 KB Output is correct
34 Correct 77 ms 4260 KB Output is correct
35 Correct 168 ms 8056 KB Output is correct
36 Correct 149 ms 8256 KB Output is correct
37 Correct 85 ms 4408 KB Output is correct
38 Correct 152 ms 7244 KB Output is correct
39 Correct 23 ms 1628 KB Output is correct
40 Correct 151 ms 7244 KB Output is correct
41 Correct 109 ms 5572 KB Output is correct
42 Correct 167 ms 7292 KB Output is correct
43 Correct 50 ms 2888 KB Output is correct
44 Correct 158 ms 7244 KB Output is correct
45 Correct 31 ms 1868 KB Output is correct
46 Correct 145 ms 7232 KB Output is correct
47 Correct 36 ms 2336 KB Output is correct
48 Correct 187 ms 7264 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 423 ms 41016 KB Output is correct
2 Correct 453 ms 45620 KB Output is correct
3 Correct 319 ms 32256 KB Output is correct
4 Correct 457 ms 45680 KB Output is correct
5 Correct 193 ms 21216 KB Output is correct
6 Correct 435 ms 45696 KB Output is correct
7 Correct 407 ms 39756 KB Output is correct
8 Correct 485 ms 45696 KB Output is correct
9 Correct 58 ms 7480 KB Output is correct
10 Correct 457 ms 45680 KB Output is correct
11 Correct 270 ms 28644 KB Output is correct
12 Correct 446 ms 45692 KB Output is correct
13 Correct 325 ms 45624 KB Output is correct
14 Correct 325 ms 45684 KB Output is correct
15 Correct 297 ms 45624 KB Output is correct
16 Correct 298 ms 45620 KB Output is correct
17 Correct 333 ms 45688 KB Output is correct
18 Correct 368 ms 45688 KB Output is correct
19 Correct 324 ms 45696 KB Output is correct
20 Correct 309 ms 45624 KB Output is correct
21 Correct 300 ms 45684 KB Output is correct
22 Correct 327 ms 45680 KB Output is correct
23 Correct 321 ms 45680 KB Output is correct
24 Correct 295 ms 45704 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 368 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 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 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 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 100 ms 4584 KB Output is correct
26 Correct 14 ms 1132 KB Output is correct
27 Correct 152 ms 6348 KB Output is correct
28 Correct 157 ms 8280 KB Output is correct
29 Correct 101 ms 5772 KB Output is correct
30 Correct 100 ms 5772 KB Output is correct
31 Correct 117 ms 7160 KB Output is correct
32 Correct 149 ms 8268 KB Output is correct
33 Correct 145 ms 7628 KB Output is correct
34 Correct 77 ms 4260 KB Output is correct
35 Correct 168 ms 8056 KB Output is correct
36 Correct 149 ms 8256 KB Output is correct
37 Correct 85 ms 4408 KB Output is correct
38 Correct 152 ms 7244 KB Output is correct
39 Correct 23 ms 1628 KB Output is correct
40 Correct 151 ms 7244 KB Output is correct
41 Correct 109 ms 5572 KB Output is correct
42 Correct 167 ms 7292 KB Output is correct
43 Correct 50 ms 2888 KB Output is correct
44 Correct 158 ms 7244 KB Output is correct
45 Correct 31 ms 1868 KB Output is correct
46 Correct 145 ms 7232 KB Output is correct
47 Correct 36 ms 2336 KB Output is correct
48 Correct 187 ms 7264 KB Output is correct
49 Correct 423 ms 41016 KB Output is correct
50 Correct 453 ms 45620 KB Output is correct
51 Correct 319 ms 32256 KB Output is correct
52 Correct 457 ms 45680 KB Output is correct
53 Correct 193 ms 21216 KB Output is correct
54 Correct 435 ms 45696 KB Output is correct
55 Correct 407 ms 39756 KB Output is correct
56 Correct 485 ms 45696 KB Output is correct
57 Correct 58 ms 7480 KB Output is correct
58 Correct 457 ms 45680 KB Output is correct
59 Correct 270 ms 28644 KB Output is correct
60 Correct 446 ms 45692 KB Output is correct
61 Correct 325 ms 45624 KB Output is correct
62 Correct 325 ms 45684 KB Output is correct
63 Correct 297 ms 45624 KB Output is correct
64 Correct 298 ms 45620 KB Output is correct
65 Correct 333 ms 45688 KB Output is correct
66 Correct 368 ms 45688 KB Output is correct
67 Correct 324 ms 45696 KB Output is correct
68 Correct 309 ms 45624 KB Output is correct
69 Correct 300 ms 45684 KB Output is correct
70 Correct 327 ms 45680 KB Output is correct
71 Correct 321 ms 45680 KB Output is correct
72 Correct 295 ms 45704 KB Output is correct
73 Correct 720 ms 49980 KB Output is correct
74 Correct 514 ms 50648 KB Output is correct
75 Correct 626 ms 41848 KB Output is correct
76 Correct 816 ms 56688 KB Output is correct
77 Correct 377 ms 27852 KB Output is correct
78 Correct 704 ms 54512 KB Output is correct
79 Correct 722 ms 50196 KB Output is correct
80 Correct 777 ms 56688 KB Output is correct
81 Correct 280 ms 14128 KB Output is correct
82 Correct 627 ms 53344 KB Output is correct
83 Correct 586 ms 37800 KB Output is correct
84 Correct 818 ms 56776 KB Output is correct
85 Correct 521 ms 53792 KB Output is correct
86 Correct 588 ms 56596 KB Output is correct
87 Correct 355 ms 50924 KB Output is correct
88 Correct 581 ms 56568 KB Output is correct
89 Correct 549 ms 54892 KB Output is correct
90 Correct 585 ms 56716 KB Output is correct
91 Correct 422 ms 52216 KB Output is correct
92 Correct 591 ms 56572 KB Output is correct
93 Correct 362 ms 51252 KB Output is correct
94 Correct 593 ms 56556 KB Output is correct
95 Correct 390 ms 51692 KB Output is correct
96 Correct 596 ms 56580 KB Output is correct