oj.uz

Submission #921310

# Submission time Handle Problem Language Result Execution time Memory
921310 2024-02-03T16:54:34 Z boris_mihov Two Antennas (JOI19_antennas) C++17
100 / 100
 489 ms 363132 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>

typedef long long llong;
const int MAXN = 2000000 + 10;
const int INF = 1e9;

int n, q;
struct SegmentTree
{
    struct Node
    {
        int height;
        int answer;
        int lazyMAX;
        int lazyMIN;
        int minActiveHeight;
        int maxActiveHeight;

        Node()
        {
            lazyMAX = -INF;
            lazyMIN = INF;
            minActiveHeight = INF;
            maxActiveHeight = -INF;
            answer = -1;
            height = 0;
        }

        friend Node operator + (const Node &left, const Node &right)
        {
            Node res;
            res.answer = std::max(left.answer, right.answer);
            res.minActiveHeight = std::min(left.minActiveHeight, right.minActiveHeight);
            res.maxActiveHeight = std::max(left.maxActiveHeight, right.maxActiveHeight);
            return res;
        }
    };

    Node tree[4*MAXN];
    void push(int node, int l, int r)
    {
        if (tree[node].lazyMAX == -INF && tree[node].lazyMIN == INF)
        {
            return;
        }

        tree[node].answer = std::max(tree[node].answer, tree[node].lazyMAX - tree[node].minActiveHeight);
        tree[node].answer = std::max(tree[node].answer, tree[node].maxActiveHeight - tree[node].lazyMIN);

        if (l < r)
        {
            tree[2*node].lazyMAX = std::max(tree[2*node].lazyMAX, tree[node].lazyMAX);
            tree[2*node].lazyMIN = std::min(tree[2*node].lazyMIN, tree[node].lazyMIN);
            tree[2*node + 1].lazyMAX = std::max(tree[2*node + 1].lazyMAX, tree[node].lazyMAX);
            tree[2*node + 1].lazyMIN = std::min(tree[2*node + 1].lazyMIN, tree[node].lazyMIN);
        }

        tree[node].lazyMAX = -INF;
        tree[node].lazyMIN = INF;
    }

    void updateHeight(int l, int r, int node, int queryPos, int queryVal)
    {
        push(node, l, r);
        if (queryPos < l || r < queryPos)
        {
            return;
        }

        if (l == r)
        {
            tree[node].height = queryVal;
            tree[node].minActiveHeight = (queryVal == 0 ? INF : queryVal);
            tree[node].maxActiveHeight = (queryVal == 0 ? -INF : queryVal);
            return;
        }

        int mid = (l + r) / 2;
        updateHeight(l, mid, 2*node, queryPos, queryVal);
        updateHeight(mid + 1, r, 2*node + 1, queryPos, queryVal);
        tree[node] = tree[2*node] + tree[2*node + 1];
    }

    void updateRange(int l, int r, int node, int queryL, int queryR, int queryVal)
    {
        push(node, l, r);
        if (queryR < l || r < queryL)
        {
            return;
        }

        if (queryL <= l && r <= queryR)
        {
            tree[node].lazyMAX = queryVal;
            tree[node].lazyMIN = queryVal;
            push(node, l, r);
            return;
        }

        int mid = (l + r) / 2;
        updateRange(l, mid, 2*node, queryL, queryR, queryVal);
        updateRange(mid + 1, r, 2*node + 1, queryL, queryR, queryVal);
        tree[node] = tree[2*node] + tree[2*node + 1];
    }

    int query(int l, int r, int node, int queryL, int queryR)
    {
        push(node, l, r);
        if (queryL <= l && r <= queryR)
        {
            return tree[node].answer;
        }

        int res = -1;
        int mid = (l + r) / 2;
        if (queryL <= mid) res = std::max(res, query(l, mid, 2*node, queryL, queryR));
        if (mid + 1 <= queryR) res = std::max(res, query(mid + 1, r, 2*node + 1, queryL, queryR));
        return res;
    }

    void updateHeight(int pos, int val)
    {
        updateHeight(1, n, 1, pos, val);
    }

    void updateRange(int l, int r, int val)
    {
        updateRange(1, n, 1, l, r, val);
    }

    int query(int l, int r)
    {
        return query(1, n, 1, l, r);
    }
};

int a[MAXN];
int b[MAXN];
int h[MAXN];
int answer[MAXN];
std::vector <int> add[MAXN];
std::vector <int> rem[MAXN];
std::vector <std::pair <int,int>> queries[MAXN];
SegmentTree tree;

void solve()
{
    for (int i = 1 ; i <= n ; ++i)
    {
        add[a[i] + i].push_back(i);
        rem[b[i] + i + 1].push_back(i);
    }

    for (int i = 1 ; i <= n ; ++i)
    {
        for (const int &idx : add[i])
        {
            tree.updateHeight(idx, h[idx]);
        }

        for (const int &idx : rem[i])
        {
            tree.updateHeight(idx, 0);
        }

        if (i - a[i] > 0)
        {
            tree.updateRange(std::max(1, i - b[i]), std::max(1, i - a[i]), h[i]);
        }

        for (const auto &[l, idx] : queries[i])
        {
            answer[idx] = tree.query(l, i);
        }
    }
}

void input()
{
    std::cin >> n;
    for (int i = 1 ; i <= n ; ++i)
    {
        std::cin >> h[i] >> a[i] >> b[i];
    }

    std::cin >> q;
    for (int i = 1 ; i <= q ; ++i)
    {
        int l, r;
        std::cin >> l >> r;
        queries[r].push_back({l, i});
    }
}

void print()
{
    for (int i = 1 ; i <= q ; ++i)
    {
        std::cout << answer[i] << '\n';
    }
}

void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int main()
{
    fastIOI();
    input();
    solve();
    print();

    return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 337336 KB Output is correct
2 Correct 73 ms 337108 KB Output is correct
3 Correct 73 ms 336988 KB Output is correct
4 Correct 71 ms 336980 KB Output is correct
5 Correct 74 ms 336908 KB Output is correct
6 Correct 75 ms 337492 KB Output is correct
7 Correct 74 ms 336976 KB Output is correct
8 Correct 71 ms 336980 KB Output is correct
9 Correct 73 ms 337040 KB Output is correct
10 Correct 73 ms 337016 KB Output is correct
11 Correct 75 ms 337184 KB Output is correct
12 Correct 71 ms 337064 KB Output is correct
13 Correct 72 ms 337000 KB Output is correct
14 Correct 71 ms 336976 KB Output is correct
15 Correct 75 ms 337040 KB Output is correct
16 Correct 74 ms 337236 KB Output is correct
17 Correct 71 ms 336976 KB Output is correct
18 Correct 72 ms 336980 KB Output is correct
19 Correct 72 ms 336980 KB Output is correct
20 Correct 73 ms 337088 KB Output is correct
21 Correct 72 ms 336920 KB Output is correct
22 Correct 70 ms 337140 KB Output is correct
23 Correct 71 ms 336980 KB Output is correct
24 Correct 72 ms 337080 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 337336 KB Output is correct
2 Correct 73 ms 337108 KB Output is correct
3 Correct 73 ms 336988 KB Output is correct
4 Correct 71 ms 336980 KB Output is correct
5 Correct 74 ms 336908 KB Output is correct
6 Correct 75 ms 337492 KB Output is correct
7 Correct 74 ms 336976 KB Output is correct
8 Correct 71 ms 336980 KB Output is correct
9 Correct 73 ms 337040 KB Output is correct
10 Correct 73 ms 337016 KB Output is correct
11 Correct 75 ms 337184 KB Output is correct
12 Correct 71 ms 337064 KB Output is correct
13 Correct 72 ms 337000 KB Output is correct
14 Correct 71 ms 336976 KB Output is correct
15 Correct 75 ms 337040 KB Output is correct
16 Correct 74 ms 337236 KB Output is correct
17 Correct 71 ms 336976 KB Output is correct
18 Correct 72 ms 336980 KB Output is correct
19 Correct 72 ms 336980 KB Output is correct
20 Correct 73 ms 337088 KB Output is correct
21 Correct 72 ms 336920 KB Output is correct
22 Correct 70 ms 337140 KB Output is correct
23 Correct 71 ms 336980 KB Output is correct
24 Correct 72 ms 337080 KB Output is correct
25 Correct 113 ms 340052 KB Output is correct
26 Correct 81 ms 337460 KB Output is correct
27 Correct 153 ms 341332 KB Output is correct
28 Correct 139 ms 341180 KB Output is correct
29 Correct 120 ms 340108 KB Output is correct
30 Correct 126 ms 339724 KB Output is correct
31 Correct 125 ms 340816 KB Output is correct
32 Correct 152 ms 341372 KB Output is correct
33 Correct 137 ms 340916 KB Output is correct
34 Correct 105 ms 338968 KB Output is correct
35 Correct 139 ms 341156 KB Output is correct
36 Correct 140 ms 341304 KB Output is correct
37 Correct 113 ms 338908 KB Output is correct
38 Correct 136 ms 340392 KB Output is correct
39 Correct 80 ms 337744 KB Output is correct
40 Correct 137 ms 340208 KB Output is correct
41 Correct 117 ms 339280 KB Output is correct
42 Correct 136 ms 340380 KB Output is correct
43 Correct 93 ms 338156 KB Output is correct
44 Correct 137 ms 340396 KB Output is correct
45 Correct 89 ms 337536 KB Output is correct
46 Correct 141 ms 340540 KB Output is correct
47 Correct 88 ms 337748 KB Output is correct
48 Correct 135 ms 340420 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 321 ms 349372 KB Output is correct
2 Correct 334 ms 354804 KB Output is correct
3 Correct 273 ms 350724 KB Output is correct
4 Correct 331 ms 354828 KB Output is correct
5 Correct 192 ms 345456 KB Output is correct
6 Correct 373 ms 354876 KB Output is correct
7 Correct 290 ms 352996 KB Output is correct
8 Correct 330 ms 354640 KB Output is correct
9 Correct 104 ms 341072 KB Output is correct
10 Correct 355 ms 354936 KB Output is correct
11 Correct 239 ms 349660 KB Output is correct
12 Correct 403 ms 354824 KB Output is correct
13 Correct 205 ms 351340 KB Output is correct
14 Correct 197 ms 350652 KB Output is correct
15 Correct 215 ms 351316 KB Output is correct
16 Correct 186 ms 351976 KB Output is correct
17 Correct 217 ms 351028 KB Output is correct
18 Correct 198 ms 350800 KB Output is correct
19 Correct 203 ms 350792 KB Output is correct
20 Correct 204 ms 351144 KB Output is correct
21 Correct 189 ms 350772 KB Output is correct
22 Correct 203 ms 351272 KB Output is correct
23 Correct 202 ms 350712 KB Output is correct
24 Correct 188 ms 351496 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 337336 KB Output is correct
2 Correct 73 ms 337108 KB Output is correct
3 Correct 73 ms 336988 KB Output is correct
4 Correct 71 ms 336980 KB Output is correct
5 Correct 74 ms 336908 KB Output is correct
6 Correct 75 ms 337492 KB Output is correct
7 Correct 74 ms 336976 KB Output is correct
8 Correct 71 ms 336980 KB Output is correct
9 Correct 73 ms 337040 KB Output is correct
10 Correct 73 ms 337016 KB Output is correct
11 Correct 75 ms 337184 KB Output is correct
12 Correct 71 ms 337064 KB Output is correct
13 Correct 72 ms 337000 KB Output is correct
14 Correct 71 ms 336976 KB Output is correct
15 Correct 75 ms 337040 KB Output is correct
16 Correct 74 ms 337236 KB Output is correct
17 Correct 71 ms 336976 KB Output is correct
18 Correct 72 ms 336980 KB Output is correct
19 Correct 72 ms 336980 KB Output is correct
20 Correct 73 ms 337088 KB Output is correct
21 Correct 72 ms 336920 KB Output is correct
22 Correct 70 ms 337140 KB Output is correct
23 Correct 71 ms 336980 KB Output is correct
24 Correct 72 ms 337080 KB Output is correct
25 Correct 113 ms 340052 KB Output is correct
26 Correct 81 ms 337460 KB Output is correct
27 Correct 153 ms 341332 KB Output is correct
28 Correct 139 ms 341180 KB Output is correct
29 Correct 120 ms 340108 KB Output is correct
30 Correct 126 ms 339724 KB Output is correct
31 Correct 125 ms 340816 KB Output is correct
32 Correct 152 ms 341372 KB Output is correct
33 Correct 137 ms 340916 KB Output is correct
34 Correct 105 ms 338968 KB Output is correct
35 Correct 139 ms 341156 KB Output is correct
36 Correct 140 ms 341304 KB Output is correct
37 Correct 113 ms 338908 KB Output is correct
38 Correct 136 ms 340392 KB Output is correct
39 Correct 80 ms 337744 KB Output is correct
40 Correct 137 ms 340208 KB Output is correct
41 Correct 117 ms 339280 KB Output is correct
42 Correct 136 ms 340380 KB Output is correct
43 Correct 93 ms 338156 KB Output is correct
44 Correct 137 ms 340396 KB Output is correct
45 Correct 89 ms 337536 KB Output is correct
46 Correct 141 ms 340540 KB Output is correct
47 Correct 88 ms 337748 KB Output is correct
48 Correct 135 ms 340420 KB Output is correct
49 Correct 321 ms 349372 KB Output is correct
50 Correct 334 ms 354804 KB Output is correct
51 Correct 273 ms 350724 KB Output is correct
52 Correct 331 ms 354828 KB Output is correct
53 Correct 192 ms 345456 KB Output is correct
54 Correct 373 ms 354876 KB Output is correct
55 Correct 290 ms 352996 KB Output is correct
56 Correct 330 ms 354640 KB Output is correct
57 Correct 104 ms 341072 KB Output is correct
58 Correct 355 ms 354936 KB Output is correct
59 Correct 239 ms 349660 KB Output is correct
60 Correct 403 ms 354824 KB Output is correct
61 Correct 205 ms 351340 KB Output is correct
62 Correct 197 ms 350652 KB Output is correct
63 Correct 215 ms 351316 KB Output is correct
64 Correct 186 ms 351976 KB Output is correct
65 Correct 217 ms 351028 KB Output is correct
66 Correct 198 ms 350800 KB Output is correct
67 Correct 203 ms 350792 KB Output is correct
68 Correct 204 ms 351144 KB Output is correct
69 Correct 189 ms 350772 KB Output is correct
70 Correct 203 ms 351272 KB Output is correct
71 Correct 202 ms 350712 KB Output is correct
72 Correct 188 ms 351496 KB Output is correct
73 Correct 434 ms 359696 KB Output is correct
74 Correct 355 ms 355412 KB Output is correct
75 Correct 381 ms 358508 KB Output is correct
76 Correct 489 ms 363088 KB Output is correct
77 Correct 288 ms 350940 KB Output is correct
78 Correct 451 ms 360672 KB Output is correct
79 Correct 466 ms 361192 KB Output is correct
80 Correct 473 ms 363132 KB Output is correct
81 Correct 212 ms 347824 KB Output is correct
82 Correct 400 ms 359100 KB Output is correct
83 Correct 393 ms 357188 KB Output is correct
84 Correct 483 ms 363092 KB Output is correct
85 Correct 299 ms 355576 KB Output is correct
86 Correct 337 ms 357832 KB Output is correct
87 Correct 226 ms 352596 KB Output is correct
88 Correct 327 ms 359172 KB Output is correct
89 Correct 312 ms 356404 KB Output is correct
90 Correct 347 ms 358088 KB Output is correct
91 Correct 271 ms 353628 KB Output is correct
92 Correct 330 ms 358136 KB Output is correct
93 Correct 247 ms 352308 KB Output is correct
94 Correct 359 ms 358380 KB Output is correct
95 Correct 244 ms 353100 KB Output is correct
96 Correct 338 ms 358760 KB Output is correct