oj.uz

답안 #921311

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
921311 2024-02-03T16:56:12 Z boris_mihov Two Antennas (JOI19_antennas) C++17
100 / 100
 531 ms 355924 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;
    assert(n <= 200000);
    for (int i = 1 ; i <= n ; ++i)
    {
        std::cin >> h[i] >> a[i] >> b[i];
    }

    std::cin >> q;
    assert(q <= 200000);
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 336944 KB Output is correct
2 Correct 73 ms 337060 KB Output is correct
3 Correct 72 ms 337236 KB Output is correct
4 Correct 74 ms 337148 KB Output is correct
5 Correct 70 ms 336960 KB Output is correct
6 Correct 71 ms 336988 KB Output is correct
7 Correct 71 ms 336920 KB Output is correct
8 Correct 71 ms 336944 KB Output is correct
9 Correct 71 ms 337136 KB Output is correct
10 Correct 71 ms 336980 KB Output is correct
11 Correct 72 ms 336964 KB Output is correct
12 Correct 72 ms 336976 KB Output is correct
13 Correct 80 ms 337536 KB Output is correct
14 Correct 70 ms 336924 KB Output is correct
15 Correct 71 ms 336980 KB Output is correct
16 Correct 74 ms 337140 KB Output is correct
17 Correct 70 ms 337132 KB Output is correct
18 Correct 70 ms 337232 KB Output is correct
19 Correct 80 ms 337068 KB Output is correct
20 Correct 72 ms 337036 KB Output is correct
21 Correct 70 ms 336976 KB Output is correct
22 Correct 71 ms 336964 KB Output is correct
23 Correct 73 ms 337200 KB Output is correct
24 Correct 70 ms 336980 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 336944 KB Output is correct
2 Correct 73 ms 337060 KB Output is correct
3 Correct 72 ms 337236 KB Output is correct
4 Correct 74 ms 337148 KB Output is correct
5 Correct 70 ms 336960 KB Output is correct
6 Correct 71 ms 336988 KB Output is correct
7 Correct 71 ms 336920 KB Output is correct
8 Correct 71 ms 336944 KB Output is correct
9 Correct 71 ms 337136 KB Output is correct
10 Correct 71 ms 336980 KB Output is correct
11 Correct 72 ms 336964 KB Output is correct
12 Correct 72 ms 336976 KB Output is correct
13 Correct 80 ms 337536 KB Output is correct
14 Correct 70 ms 336924 KB Output is correct
15 Correct 71 ms 336980 KB Output is correct
16 Correct 74 ms 337140 KB Output is correct
17 Correct 70 ms 337132 KB Output is correct
18 Correct 70 ms 337232 KB Output is correct
19 Correct 80 ms 337068 KB Output is correct
20 Correct 72 ms 337036 KB Output is correct
21 Correct 70 ms 336976 KB Output is correct
22 Correct 71 ms 336964 KB Output is correct
23 Correct 73 ms 337200 KB Output is correct
24 Correct 70 ms 336980 KB Output is correct
25 Correct 117 ms 340104 KB Output is correct
26 Correct 78 ms 337488 KB Output is correct
27 Correct 142 ms 341152 KB Output is correct
28 Correct 142 ms 341268 KB Output is correct
29 Correct 115 ms 340072 KB Output is correct
30 Correct 119 ms 339724 KB Output is correct
31 Correct 121 ms 340800 KB Output is correct
32 Correct 154 ms 341180 KB Output is correct
33 Correct 135 ms 340908 KB Output is correct
34 Correct 105 ms 339028 KB Output is correct
35 Correct 157 ms 341284 KB Output is correct
36 Correct 140 ms 341264 KB Output is correct
37 Correct 125 ms 339024 KB Output is correct
38 Correct 138 ms 340328 KB Output is correct
39 Correct 82 ms 337492 KB Output is correct
40 Correct 137 ms 340304 KB Output is correct
41 Correct 119 ms 339340 KB Output is correct
42 Correct 136 ms 340308 KB Output is correct
43 Correct 94 ms 338060 KB Output is correct
44 Correct 143 ms 340564 KB Output is correct
45 Correct 90 ms 337540 KB Output is correct
46 Correct 136 ms 340304 KB Output is correct
47 Correct 90 ms 337960 KB Output is correct
48 Correct 140 ms 340296 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 325 ms 349164 KB Output is correct
2 Correct 341 ms 350292 KB Output is correct
3 Correct 267 ms 347504 KB Output is correct
4 Correct 337 ms 350288 KB Output is correct
5 Correct 185 ms 343312 KB Output is correct
6 Correct 341 ms 350052 KB Output is correct
7 Correct 343 ms 349072 KB Output is correct
8 Correct 327 ms 350280 KB Output is correct
9 Correct 104 ms 340560 KB Output is correct
10 Correct 326 ms 350036 KB Output is correct
11 Correct 220 ms 346856 KB Output is correct
12 Correct 325 ms 350032 KB Output is correct
13 Correct 206 ms 346660 KB Output is correct
14 Correct 209 ms 346232 KB Output is correct
15 Correct 200 ms 346900 KB Output is correct
16 Correct 186 ms 347412 KB Output is correct
17 Correct 210 ms 346736 KB Output is correct
18 Correct 234 ms 346348 KB Output is correct
19 Correct 208 ms 346292 KB Output is correct
20 Correct 196 ms 346616 KB Output is correct
21 Correct 192 ms 346364 KB Output is correct
22 Correct 199 ms 346600 KB Output is correct
23 Correct 210 ms 346520 KB Output is correct
24 Correct 185 ms 346984 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 336944 KB Output is correct
2 Correct 73 ms 337060 KB Output is correct
3 Correct 72 ms 337236 KB Output is correct
4 Correct 74 ms 337148 KB Output is correct
5 Correct 70 ms 336960 KB Output is correct
6 Correct 71 ms 336988 KB Output is correct
7 Correct 71 ms 336920 KB Output is correct
8 Correct 71 ms 336944 KB Output is correct
9 Correct 71 ms 337136 KB Output is correct
10 Correct 71 ms 336980 KB Output is correct
11 Correct 72 ms 336964 KB Output is correct
12 Correct 72 ms 336976 KB Output is correct
13 Correct 80 ms 337536 KB Output is correct
14 Correct 70 ms 336924 KB Output is correct
15 Correct 71 ms 336980 KB Output is correct
16 Correct 74 ms 337140 KB Output is correct
17 Correct 70 ms 337132 KB Output is correct
18 Correct 70 ms 337232 KB Output is correct
19 Correct 80 ms 337068 KB Output is correct
20 Correct 72 ms 337036 KB Output is correct
21 Correct 70 ms 336976 KB Output is correct
22 Correct 71 ms 336964 KB Output is correct
23 Correct 73 ms 337200 KB Output is correct
24 Correct 70 ms 336980 KB Output is correct
25 Correct 117 ms 340104 KB Output is correct
26 Correct 78 ms 337488 KB Output is correct
27 Correct 142 ms 341152 KB Output is correct
28 Correct 142 ms 341268 KB Output is correct
29 Correct 115 ms 340072 KB Output is correct
30 Correct 119 ms 339724 KB Output is correct
31 Correct 121 ms 340800 KB Output is correct
32 Correct 154 ms 341180 KB Output is correct
33 Correct 135 ms 340908 KB Output is correct
34 Correct 105 ms 339028 KB Output is correct
35 Correct 157 ms 341284 KB Output is correct
36 Correct 140 ms 341264 KB Output is correct
37 Correct 125 ms 339024 KB Output is correct
38 Correct 138 ms 340328 KB Output is correct
39 Correct 82 ms 337492 KB Output is correct
40 Correct 137 ms 340304 KB Output is correct
41 Correct 119 ms 339340 KB Output is correct
42 Correct 136 ms 340308 KB Output is correct
43 Correct 94 ms 338060 KB Output is correct
44 Correct 143 ms 340564 KB Output is correct
45 Correct 90 ms 337540 KB Output is correct
46 Correct 136 ms 340304 KB Output is correct
47 Correct 90 ms 337960 KB Output is correct
48 Correct 140 ms 340296 KB Output is correct
49 Correct 325 ms 349164 KB Output is correct
50 Correct 341 ms 350292 KB Output is correct
51 Correct 267 ms 347504 KB Output is correct
52 Correct 337 ms 350288 KB Output is correct
53 Correct 185 ms 343312 KB Output is correct
54 Correct 341 ms 350052 KB Output is correct
55 Correct 343 ms 349072 KB Output is correct
56 Correct 327 ms 350280 KB Output is correct
57 Correct 104 ms 340560 KB Output is correct
58 Correct 326 ms 350036 KB Output is correct
59 Correct 220 ms 346856 KB Output is correct
60 Correct 325 ms 350032 KB Output is correct
61 Correct 206 ms 346660 KB Output is correct
62 Correct 209 ms 346232 KB Output is correct
63 Correct 200 ms 346900 KB Output is correct
64 Correct 186 ms 347412 KB Output is correct
65 Correct 210 ms 346736 KB Output is correct
66 Correct 234 ms 346348 KB Output is correct
67 Correct 208 ms 346292 KB Output is correct
68 Correct 196 ms 346616 KB Output is correct
69 Correct 192 ms 346364 KB Output is correct
70 Correct 199 ms 346600 KB Output is correct
71 Correct 210 ms 346520 KB Output is correct
72 Correct 185 ms 346984 KB Output is correct
73 Correct 468 ms 353588 KB Output is correct
74 Correct 347 ms 350804 KB Output is correct
75 Correct 392 ms 352968 KB Output is correct
76 Correct 510 ms 355924 KB Output is correct
77 Correct 267 ms 347240 KB Output is correct
78 Correct 441 ms 354132 KB Output is correct
79 Correct 450 ms 354480 KB Output is correct
80 Correct 531 ms 355812 KB Output is correct
81 Correct 198 ms 344912 KB Output is correct
82 Correct 454 ms 353208 KB Output is correct
83 Correct 350 ms 351996 KB Output is correct
84 Correct 471 ms 355852 KB Output is correct
85 Correct 297 ms 349648 KB Output is correct
86 Correct 339 ms 350668 KB Output is correct
87 Correct 265 ms 347728 KB Output is correct
88 Correct 319 ms 351956 KB Output is correct
89 Correct 309 ms 349900 KB Output is correct
90 Correct 355 ms 350948 KB Output is correct
91 Correct 258 ms 348332 KB Output is correct
92 Correct 332 ms 350996 KB Output is correct
93 Correct 223 ms 347620 KB Output is correct
94 Correct 340 ms 351276 KB Output is correct
95 Correct 237 ms 347856 KB Output is correct
96 Correct 333 ms 351840 KB Output is correct