oj.uz

답안 #921308

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
921308 2024-02-03T16:53:28 Z boris_mihov Two Antennas (JOI19_antennas) C++17
13 / 100
 89 ms 76112 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>

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

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 35672 KB Output is correct
2 Correct 9 ms 35420 KB Output is correct
3 Correct 9 ms 35420 KB Output is correct
4 Correct 9 ms 35544 KB Output is correct
5 Correct 9 ms 35420 KB Output is correct
6 Correct 9 ms 35532 KB Output is correct
7 Correct 10 ms 35420 KB Output is correct
8 Correct 10 ms 35420 KB Output is correct
9 Correct 9 ms 35676 KB Output is correct
10 Correct 10 ms 35512 KB Output is correct
11 Correct 8 ms 35420 KB Output is correct
12 Correct 9 ms 35420 KB Output is correct
13 Correct 9 ms 35420 KB Output is correct
14 Correct 9 ms 35420 KB Output is correct
15 Correct 9 ms 35416 KB Output is correct
16 Correct 9 ms 35420 KB Output is correct
17 Correct 9 ms 35440 KB Output is correct
18 Correct 9 ms 35420 KB Output is correct
19 Correct 10 ms 35420 KB Output is correct
20 Correct 9 ms 35420 KB Output is correct
21 Correct 9 ms 35448 KB Output is correct
22 Correct 9 ms 35416 KB Output is correct
23 Correct 9 ms 35420 KB Output is correct
24 Correct 9 ms 35420 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 35672 KB Output is correct
2 Correct 9 ms 35420 KB Output is correct
3 Correct 9 ms 35420 KB Output is correct
4 Correct 9 ms 35544 KB Output is correct
5 Correct 9 ms 35420 KB Output is correct
6 Correct 9 ms 35532 KB Output is correct
7 Correct 10 ms 35420 KB Output is correct
8 Correct 10 ms 35420 KB Output is correct
9 Correct 9 ms 35676 KB Output is correct
10 Correct 10 ms 35512 KB Output is correct
11 Correct 8 ms 35420 KB Output is correct
12 Correct 9 ms 35420 KB Output is correct
13 Correct 9 ms 35420 KB Output is correct
14 Correct 9 ms 35420 KB Output is correct
15 Correct 9 ms 35416 KB Output is correct
16 Correct 9 ms 35420 KB Output is correct
17 Correct 9 ms 35440 KB Output is correct
18 Correct 9 ms 35420 KB Output is correct
19 Correct 10 ms 35420 KB Output is correct
20 Correct 9 ms 35420 KB Output is correct
21 Correct 9 ms 35448 KB Output is correct
22 Correct 9 ms 35416 KB Output is correct
23 Correct 9 ms 35420 KB Output is correct
24 Correct 9 ms 35420 KB Output is correct
25 Correct 60 ms 38384 KB Output is correct
26 Correct 16 ms 35928 KB Output is correct
27 Correct 81 ms 39596 KB Output is correct
28 Correct 75 ms 39624 KB Output is correct
29 Correct 52 ms 38384 KB Output is correct
30 Correct 55 ms 38224 KB Output is correct
31 Correct 62 ms 38972 KB Output is correct
32 Correct 75 ms 39612 KB Output is correct
33 Correct 68 ms 39504 KB Output is correct
34 Correct 43 ms 37460 KB Output is correct
35 Correct 89 ms 39508 KB Output is correct
36 Correct 79 ms 39664 KB Output is correct
37 Correct 47 ms 37200 KB Output is correct
38 Correct 73 ms 38736 KB Output is correct
39 Correct 19 ms 35932 KB Output is correct
40 Correct 76 ms 38740 KB Output is correct
41 Correct 56 ms 37740 KB Output is correct
42 Correct 72 ms 38628 KB Output is correct
43 Correct 31 ms 36444 KB Output is correct
44 Correct 75 ms 38768 KB Output is correct
45 Correct 20 ms 35932 KB Output is correct
46 Correct 73 ms 38780 KB Output is correct
47 Correct 26 ms 36436 KB Output is correct
48 Correct 72 ms 38744 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 77 ms 76112 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 35672 KB Output is correct
2 Correct 9 ms 35420 KB Output is correct
3 Correct 9 ms 35420 KB Output is correct
4 Correct 9 ms 35544 KB Output is correct
5 Correct 9 ms 35420 KB Output is correct
6 Correct 9 ms 35532 KB Output is correct
7 Correct 10 ms 35420 KB Output is correct
8 Correct 10 ms 35420 KB Output is correct
9 Correct 9 ms 35676 KB Output is correct
10 Correct 10 ms 35512 KB Output is correct
11 Correct 8 ms 35420 KB Output is correct
12 Correct 9 ms 35420 KB Output is correct
13 Correct 9 ms 35420 KB Output is correct
14 Correct 9 ms 35420 KB Output is correct
15 Correct 9 ms 35416 KB Output is correct
16 Correct 9 ms 35420 KB Output is correct
17 Correct 9 ms 35440 KB Output is correct
18 Correct 9 ms 35420 KB Output is correct
19 Correct 10 ms 35420 KB Output is correct
20 Correct 9 ms 35420 KB Output is correct
21 Correct 9 ms 35448 KB Output is correct
22 Correct 9 ms 35416 KB Output is correct
23 Correct 9 ms 35420 KB Output is correct
24 Correct 9 ms 35420 KB Output is correct
25 Correct 60 ms 38384 KB Output is correct
26 Correct 16 ms 35928 KB Output is correct
27 Correct 81 ms 39596 KB Output is correct
28 Correct 75 ms 39624 KB Output is correct
29 Correct 52 ms 38384 KB Output is correct
30 Correct 55 ms 38224 KB Output is correct
31 Correct 62 ms 38972 KB Output is correct
32 Correct 75 ms 39612 KB Output is correct
33 Correct 68 ms 39504 KB Output is correct
34 Correct 43 ms 37460 KB Output is correct
35 Correct 89 ms 39508 KB Output is correct
36 Correct 79 ms 39664 KB Output is correct
37 Correct 47 ms 37200 KB Output is correct
38 Correct 73 ms 38736 KB Output is correct
39 Correct 19 ms 35932 KB Output is correct
40 Correct 76 ms 38740 KB Output is correct
41 Correct 56 ms 37740 KB Output is correct
42 Correct 72 ms 38628 KB Output is correct
43 Correct 31 ms 36444 KB Output is correct
44 Correct 75 ms 38768 KB Output is correct
45 Correct 20 ms 35932 KB Output is correct
46 Correct 73 ms 38780 KB Output is correct
47 Correct 26 ms 36436 KB Output is correct
48 Correct 72 ms 38744 KB Output is correct
49 Runtime error 77 ms 76112 KB Execution killed with signal 11
50 Halted 0 ms 0 KB -