oj.uz

Submission #921313

# Submission time Handle Problem Language Result Execution time Memory
921313 2024-02-03T16:58:57 Z boris_mihov Two Antennas (JOI19_antennas) C++17
13 / 100
 117 ms 121024 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>

typedef long long llong;
const int MAXN = 300000 + 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

# Verdict Execution time Memory Grader output
1 Correct 13 ms 53848 KB Output is correct
2 Correct 12 ms 53852 KB Output is correct
3 Correct 14 ms 53904 KB Output is correct
4 Correct 12 ms 53852 KB Output is correct
5 Correct 12 ms 53852 KB Output is correct
6 Correct 12 ms 53852 KB Output is correct
7 Correct 12 ms 53852 KB Output is correct
8 Correct 13 ms 53968 KB Output is correct
9 Correct 13 ms 53848 KB Output is correct
10 Correct 13 ms 53852 KB Output is correct
11 Correct 12 ms 53972 KB Output is correct
12 Correct 13 ms 53852 KB Output is correct
13 Correct 12 ms 53852 KB Output is correct
14 Correct 12 ms 53848 KB Output is correct
15 Correct 14 ms 53848 KB Output is correct
16 Correct 12 ms 53852 KB Output is correct
17 Correct 14 ms 53976 KB Output is correct
18 Correct 14 ms 53852 KB Output is correct
19 Correct 14 ms 53936 KB Output is correct
20 Correct 14 ms 53848 KB Output is correct
21 Correct 13 ms 53848 KB Output is correct
22 Correct 13 ms 53852 KB Output is correct
23 Correct 12 ms 53852 KB Output is correct
24 Correct 12 ms 53900 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 53848 KB Output is correct
2 Correct 12 ms 53852 KB Output is correct
3 Correct 14 ms 53904 KB Output is correct
4 Correct 12 ms 53852 KB Output is correct
5 Correct 12 ms 53852 KB Output is correct
6 Correct 12 ms 53852 KB Output is correct
7 Correct 12 ms 53852 KB Output is correct
8 Correct 13 ms 53968 KB Output is correct
9 Correct 13 ms 53848 KB Output is correct
10 Correct 13 ms 53852 KB Output is correct
11 Correct 12 ms 53972 KB Output is correct
12 Correct 13 ms 53852 KB Output is correct
13 Correct 12 ms 53852 KB Output is correct
14 Correct 12 ms 53848 KB Output is correct
15 Correct 14 ms 53848 KB Output is correct
16 Correct 12 ms 53852 KB Output is correct
17 Correct 14 ms 53976 KB Output is correct
18 Correct 14 ms 53852 KB Output is correct
19 Correct 14 ms 53936 KB Output is correct
20 Correct 14 ms 53848 KB Output is correct
21 Correct 13 ms 53848 KB Output is correct
22 Correct 13 ms 53852 KB Output is correct
23 Correct 12 ms 53852 KB Output is correct
24 Correct 12 ms 53900 KB Output is correct
25 Correct 56 ms 56916 KB Output is correct
26 Correct 19 ms 54360 KB Output is correct
27 Correct 79 ms 58252 KB Output is correct
28 Correct 81 ms 58196 KB Output is correct
29 Correct 65 ms 56832 KB Output is correct
30 Correct 71 ms 56748 KB Output is correct
31 Correct 65 ms 57424 KB Output is correct
32 Correct 86 ms 58008 KB Output is correct
33 Correct 75 ms 57872 KB Output is correct
34 Correct 48 ms 55892 KB Output is correct
35 Correct 77 ms 57940 KB Output is correct
36 Correct 79 ms 58024 KB Output is correct
37 Correct 50 ms 55860 KB Output is correct
38 Correct 79 ms 57216 KB Output is correct
39 Correct 23 ms 54360 KB Output is correct
40 Correct 78 ms 57172 KB Output is correct
41 Correct 61 ms 56148 KB Output is correct
42 Correct 78 ms 57216 KB Output is correct
43 Correct 41 ms 55080 KB Output is correct
44 Correct 78 ms 57192 KB Output is correct
45 Correct 25 ms 54436 KB Output is correct
46 Correct 76 ms 57168 KB Output is correct
47 Correct 31 ms 54620 KB Output is correct
48 Correct 81 ms 57252 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Runtime error 117 ms 121024 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 53848 KB Output is correct
2 Correct 12 ms 53852 KB Output is correct
3 Correct 14 ms 53904 KB Output is correct
4 Correct 12 ms 53852 KB Output is correct
5 Correct 12 ms 53852 KB Output is correct
6 Correct 12 ms 53852 KB Output is correct
7 Correct 12 ms 53852 KB Output is correct
8 Correct 13 ms 53968 KB Output is correct
9 Correct 13 ms 53848 KB Output is correct
10 Correct 13 ms 53852 KB Output is correct
11 Correct 12 ms 53972 KB Output is correct
12 Correct 13 ms 53852 KB Output is correct
13 Correct 12 ms 53852 KB Output is correct
14 Correct 12 ms 53848 KB Output is correct
15 Correct 14 ms 53848 KB Output is correct
16 Correct 12 ms 53852 KB Output is correct
17 Correct 14 ms 53976 KB Output is correct
18 Correct 14 ms 53852 KB Output is correct
19 Correct 14 ms 53936 KB Output is correct
20 Correct 14 ms 53848 KB Output is correct
21 Correct 13 ms 53848 KB Output is correct
22 Correct 13 ms 53852 KB Output is correct
23 Correct 12 ms 53852 KB Output is correct
24 Correct 12 ms 53900 KB Output is correct
25 Correct 56 ms 56916 KB Output is correct
26 Correct 19 ms 54360 KB Output is correct
27 Correct 79 ms 58252 KB Output is correct
28 Correct 81 ms 58196 KB Output is correct
29 Correct 65 ms 56832 KB Output is correct
30 Correct 71 ms 56748 KB Output is correct
31 Correct 65 ms 57424 KB Output is correct
32 Correct 86 ms 58008 KB Output is correct
33 Correct 75 ms 57872 KB Output is correct
34 Correct 48 ms 55892 KB Output is correct
35 Correct 77 ms 57940 KB Output is correct
36 Correct 79 ms 58024 KB Output is correct
37 Correct 50 ms 55860 KB Output is correct
38 Correct 79 ms 57216 KB Output is correct
39 Correct 23 ms 54360 KB Output is correct
40 Correct 78 ms 57172 KB Output is correct
41 Correct 61 ms 56148 KB Output is correct
42 Correct 78 ms 57216 KB Output is correct
43 Correct 41 ms 55080 KB Output is correct
44 Correct 78 ms 57192 KB Output is correct
45 Correct 25 ms 54436 KB Output is correct
46 Correct 76 ms 57168 KB Output is correct
47 Correct 31 ms 54620 KB Output is correct
48 Correct 81 ms 57252 KB Output is correct
49 Runtime error 117 ms 121024 KB Execution killed with signal 11
50 Halted 0 ms 0 KB -