oj.uz

답안 #867013

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
867013 2023-10-27T15:08:25 Z lolismek Two Antennas (JOI19_antennas) C++14
100 / 100
 770 ms 33616 KB 
#include <iostream>
#include <vector>

#define pii pair <int, int>

using namespace std;

const int NMAX = 2e5;
const int INF = 1e9 + 10;

int n, q;
int v[NMAX + 1];
pii ant[NMAX + 1];
pii quer[NMAX + 1];

vector <int> inds[NMAX + 1];
vector <pii> ev[NMAX + 1];

int qans[NMAX + 1];

namespace AINT{
    struct Node{
        int maxi, mini, diff;
    }seg[4 * NMAX + 1];

    void propag(int node, int l, int r){
        int x = seg[node].mini;
        seg[node].mini = +INF;
        // ^ singe-handedly the most important aspect of the Segment Tree
        // makes sure that a minimum finds a maximum, but not a maximum finds a minimum

        if(l < r){
            seg[2 * node].mini = min(seg[2 * node].mini, x);
            seg[2 * node].diff = max(seg[2 * node].diff, seg[2 * node].maxi - seg[2 * node].mini);

            seg[2 * node + 1].mini = min(seg[2 * node + 1].mini, x);
            seg[2 * node + 1].diff = max(seg[2 * node + 1].diff, seg[2 * node + 1].maxi - seg[2 * node + 1].mini);
        }
    }

    void build(int node, int l, int r){
        seg[node].maxi = -INF;
        seg[node].mini = +INF;
        seg[node].diff = seg[node].maxi - seg[node].mini;

        if(l == r){
            return;
        }

        int mid = (l + r) / 2;
        build(2 * node, l, mid);
        build(2 * node + 1, mid + 1, r);
    }

    void updatemx(int node, int l, int r, int pos, int val){
        propag(node, l, r);
        if(l == r){
            seg[node].maxi = val;
            seg[node].mini = +INF;
            seg[node].diff = max(seg[node].diff, seg[node].maxi - seg[node].mini);
            return;
        }

        int mid = (l + r) / 2;
        if(pos <= mid){
            updatemx(2 * node, l, mid, pos, val);
        }else{
            updatemx(2 * node + 1, mid + 1, r, pos, val);
        }

        propag(2 * node, l, mid);
        propag(2 * node + 1, mid + 1, r);

        seg[node].maxi = max(seg[2 * node].maxi, seg[2 * node + 1].maxi);
        seg[node].diff = max(seg[2 * node].diff, seg[2 * node + 1].diff);
    }

    void updatemn(int node, int l, int r, int ul, int ur, int val){
        propag(node, l, r);
        if(ul <= l && r <= ur){
            seg[node].mini = min(val, seg[node].mini);
            seg[node].diff = max(seg[node].diff, seg[node].maxi - seg[node].mini);
            return;
        }

        int mid = (l + r) / 2;
        if(ul <= mid){
            updatemn(2 * node, l, mid, ul, ur, val);
        }
        if(mid + 1 <= ur){
            updatemn(2 * node + 1, mid + 1, r, ul, ur, val);
        }

        propag(2 * node, l, mid);
        propag(2 * node + 1, mid + 1, r);

        seg[node].mini = max(seg[2 * node].mini, seg[2 * node + 1].mini);
        seg[node].diff = max(seg[2 * node].diff, seg[2 * node + 1].diff);
    }

    int query(int node, int l, int r, int ql, int qr){
        propag(node, l, r);
        if(ql <= l && r <= qr){
            return seg[node].diff;
        }

        int mid = (l + r) / 2, ans = -INF;
        if(ql <= mid){
            ans = max(ans, query(2 * node, l, mid, ql, qr));
        }
        if(mid + 1 <= qr){
            ans = max(ans, query(2 * node + 1, mid + 1, r, ql, qr));
        }

        return ans;
    }
}

void solve(){
    // clears
    for(int i = 1; i <= n; i++){
        ev[i].clear();
        inds[i].clear();
    }

    for(int i = 1; i <= n; i++){
        if(i + ant[i].first <= n){
            ev[i + ant[i].first].push_back({i, +1});
        }
        if(i + ant[i].second + 1 <= n){
            ev[i + ant[i].second + 1].push_back({i, -1});
        }
    }
    AINT::build(1, 1, n);

    for(int i = 1; i <= q; i++){
        inds[quer[i].second].push_back(i);
    }

    for(int i = 1; i <= n; i++){
        // process events
        for(pii e : ev[i]){
            if(e.second == +1){
                AINT::updatemx(1, 1, n, e.first, v[e.first]);
            }else{
                AINT::updatemx(1, 1, n, e.first, -INF);
            }
        }
        // update with current element
        if(i - ant[i].first >= 1){
            AINT::updatemn(1, 1, n, max(1, i - ant[i].second), i - ant[i].first, v[i]);
        }
        // answer queries
        for(int ind : inds[i]){
            qans[ind] = max(qans[ind], AINT::query(1, 1, n, quer[ind].first, quer[ind].second));
        }
    }
}

int main(){

    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> v[i];
        cin >> ant[i].first >> ant[i].second;
    }

    cin >> q;
    for(int i = 1; i <= q; i++){
        cin >> quer[i].first >> quer[i].second;
        qans[i] = -1;
    }

    solve();

    // reverse
    for(int i = 1; i <= n / 2; i++){
        swap(v[i], v[n - i + 1]);
        swap(ant[i], ant[n - i + 1]);
    }
    for(int i = 1; i <= q; i++){
        quer[i].first = n - quer[i].first + 1;
        quer[i].second = n - quer[i].second + 1;
        swap(quer[i].first, quer[i].second);
    }

    solve();

    for(int i = 1; i <= q; i++){
        cout << qans[i] << '\n';
    }

    return 0;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 14820 KB Output is correct
2 Correct 3 ms 14680 KB Output is correct
3 Correct 4 ms 14684 KB Output is correct
4 Correct 4 ms 14684 KB Output is correct
5 Correct 3 ms 14684 KB Output is correct
6 Correct 3 ms 14828 KB Output is correct
7 Correct 3 ms 14800 KB Output is correct
8 Correct 3 ms 14684 KB Output is correct
9 Correct 4 ms 14788 KB Output is correct
10 Correct 4 ms 14840 KB Output is correct
11 Correct 3 ms 14684 KB Output is correct
12 Correct 4 ms 14684 KB Output is correct
13 Correct 4 ms 14684 KB Output is correct
14 Correct 3 ms 14684 KB Output is correct
15 Correct 3 ms 14684 KB Output is correct
16 Correct 4 ms 14680 KB Output is correct
17 Correct 3 ms 14684 KB Output is correct
18 Correct 4 ms 14684 KB Output is correct
19 Correct 3 ms 14820 KB Output is correct
20 Correct 3 ms 14684 KB Output is correct
21 Correct 3 ms 14684 KB Output is correct
22 Correct 4 ms 14684 KB Output is correct
23 Correct 4 ms 14684 KB Output is correct
24 Correct 3 ms 14684 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 14820 KB Output is correct
2 Correct 3 ms 14680 KB Output is correct
3 Correct 4 ms 14684 KB Output is correct
4 Correct 4 ms 14684 KB Output is correct
5 Correct 3 ms 14684 KB Output is correct
6 Correct 3 ms 14828 KB Output is correct
7 Correct 3 ms 14800 KB Output is correct
8 Correct 3 ms 14684 KB Output is correct
9 Correct 4 ms 14788 KB Output is correct
10 Correct 4 ms 14840 KB Output is correct
11 Correct 3 ms 14684 KB Output is correct
12 Correct 4 ms 14684 KB Output is correct
13 Correct 4 ms 14684 KB Output is correct
14 Correct 3 ms 14684 KB Output is correct
15 Correct 3 ms 14684 KB Output is correct
16 Correct 4 ms 14680 KB Output is correct
17 Correct 3 ms 14684 KB Output is correct
18 Correct 4 ms 14684 KB Output is correct
19 Correct 3 ms 14820 KB Output is correct
20 Correct 3 ms 14684 KB Output is correct
21 Correct 3 ms 14684 KB Output is correct
22 Correct 4 ms 14684 KB Output is correct
23 Correct 4 ms 14684 KB Output is correct
24 Correct 3 ms 14684 KB Output is correct
25 Correct 122 ms 17128 KB Output is correct
26 Correct 19 ms 15000 KB Output is correct
27 Correct 213 ms 18112 KB Output is correct
28 Correct 183 ms 18112 KB Output is correct
29 Correct 152 ms 17296 KB Output is correct
30 Correct 153 ms 17112 KB Output is correct
31 Correct 188 ms 17852 KB Output is correct
32 Correct 173 ms 18004 KB Output is correct
33 Correct 174 ms 18096 KB Output is correct
34 Correct 133 ms 16492 KB Output is correct
35 Correct 215 ms 18248 KB Output is correct
36 Correct 174 ms 18028 KB Output is correct
37 Correct 105 ms 16208 KB Output is correct
38 Correct 169 ms 17104 KB Output is correct
39 Correct 30 ms 15068 KB Output is correct
40 Correct 169 ms 17236 KB Output is correct
41 Correct 125 ms 16724 KB Output is correct
42 Correct 171 ms 17124 KB Output is correct
43 Correct 58 ms 15548 KB Output is correct
44 Correct 177 ms 17296 KB Output is correct
45 Correct 33 ms 15196 KB Output is correct
46 Correct 167 ms 17236 KB Output is correct
47 Correct 47 ms 15444 KB Output is correct
48 Correct 174 ms 17224 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 383 ms 25924 KB Output is correct
2 Correct 426 ms 26448 KB Output is correct
3 Correct 303 ms 24660 KB Output is correct
4 Correct 420 ms 26448 KB Output is correct
5 Correct 188 ms 21344 KB Output is correct
6 Correct 421 ms 26436 KB Output is correct
7 Correct 367 ms 25736 KB Output is correct
8 Correct 422 ms 26452 KB Output is correct
9 Correct 58 ms 17752 KB Output is correct
10 Correct 417 ms 26452 KB Output is correct
11 Correct 287 ms 22356 KB Output is correct
12 Correct 416 ms 26452 KB Output is correct
13 Correct 394 ms 26692 KB Output is correct
14 Correct 384 ms 26376 KB Output is correct
15 Correct 363 ms 25372 KB Output is correct
16 Correct 352 ms 25340 KB Output is correct
17 Correct 408 ms 27352 KB Output is correct
18 Correct 380 ms 26028 KB Output is correct
19 Correct 394 ms 26172 KB Output is correct
20 Correct 385 ms 26292 KB Output is correct
21 Correct 351 ms 26176 KB Output is correct
22 Correct 373 ms 26056 KB Output is correct
23 Correct 378 ms 26312 KB Output is correct
24 Correct 335 ms 25004 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 14820 KB Output is correct
2 Correct 3 ms 14680 KB Output is correct
3 Correct 4 ms 14684 KB Output is correct
4 Correct 4 ms 14684 KB Output is correct
5 Correct 3 ms 14684 KB Output is correct
6 Correct 3 ms 14828 KB Output is correct
7 Correct 3 ms 14800 KB Output is correct
8 Correct 3 ms 14684 KB Output is correct
9 Correct 4 ms 14788 KB Output is correct
10 Correct 4 ms 14840 KB Output is correct
11 Correct 3 ms 14684 KB Output is correct
12 Correct 4 ms 14684 KB Output is correct
13 Correct 4 ms 14684 KB Output is correct
14 Correct 3 ms 14684 KB Output is correct
15 Correct 3 ms 14684 KB Output is correct
16 Correct 4 ms 14680 KB Output is correct
17 Correct 3 ms 14684 KB Output is correct
18 Correct 4 ms 14684 KB Output is correct
19 Correct 3 ms 14820 KB Output is correct
20 Correct 3 ms 14684 KB Output is correct
21 Correct 3 ms 14684 KB Output is correct
22 Correct 4 ms 14684 KB Output is correct
23 Correct 4 ms 14684 KB Output is correct
24 Correct 3 ms 14684 KB Output is correct
25 Correct 122 ms 17128 KB Output is correct
26 Correct 19 ms 15000 KB Output is correct
27 Correct 213 ms 18112 KB Output is correct
28 Correct 183 ms 18112 KB Output is correct
29 Correct 152 ms 17296 KB Output is correct
30 Correct 153 ms 17112 KB Output is correct
31 Correct 188 ms 17852 KB Output is correct
32 Correct 173 ms 18004 KB Output is correct
33 Correct 174 ms 18096 KB Output is correct
34 Correct 133 ms 16492 KB Output is correct
35 Correct 215 ms 18248 KB Output is correct
36 Correct 174 ms 18028 KB Output is correct
37 Correct 105 ms 16208 KB Output is correct
38 Correct 169 ms 17104 KB Output is correct
39 Correct 30 ms 15068 KB Output is correct
40 Correct 169 ms 17236 KB Output is correct
41 Correct 125 ms 16724 KB Output is correct
42 Correct 171 ms 17124 KB Output is correct
43 Correct 58 ms 15548 KB Output is correct
44 Correct 177 ms 17296 KB Output is correct
45 Correct 33 ms 15196 KB Output is correct
46 Correct 167 ms 17236 KB Output is correct
47 Correct 47 ms 15444 KB Output is correct
48 Correct 174 ms 17224 KB Output is correct
49 Correct 383 ms 25924 KB Output is correct
50 Correct 426 ms 26448 KB Output is correct
51 Correct 303 ms 24660 KB Output is correct
52 Correct 420 ms 26448 KB Output is correct
53 Correct 188 ms 21344 KB Output is correct
54 Correct 421 ms 26436 KB Output is correct
55 Correct 367 ms 25736 KB Output is correct
56 Correct 422 ms 26452 KB Output is correct
57 Correct 58 ms 17752 KB Output is correct
58 Correct 417 ms 26452 KB Output is correct
59 Correct 287 ms 22356 KB Output is correct
60 Correct 416 ms 26452 KB Output is correct
61 Correct 394 ms 26692 KB Output is correct
62 Correct 384 ms 26376 KB Output is correct
63 Correct 363 ms 25372 KB Output is correct
64 Correct 352 ms 25340 KB Output is correct
65 Correct 408 ms 27352 KB Output is correct
66 Correct 380 ms 26028 KB Output is correct
67 Correct 394 ms 26172 KB Output is correct
68 Correct 385 ms 26292 KB Output is correct
69 Correct 351 ms 26176 KB Output is correct
70 Correct 373 ms 26056 KB Output is correct
71 Correct 378 ms 26312 KB Output is correct
72 Correct 335 ms 25004 KB Output is correct
73 Correct 603 ms 31624 KB Output is correct
74 Correct 468 ms 27208 KB Output is correct
75 Correct 574 ms 30768 KB Output is correct
76 Correct 746 ms 33364 KB Output is correct
77 Correct 389 ms 25804 KB Output is correct
78 Correct 663 ms 32016 KB Output is correct
79 Correct 687 ms 32764 KB Output is correct
80 Correct 736 ms 33616 KB Output is correct
81 Correct 277 ms 21844 KB Output is correct
82 Correct 582 ms 30804 KB Output is correct
83 Correct 534 ms 28012 KB Output is correct
84 Correct 770 ms 33384 KB Output is correct
85 Correct 582 ms 31176 KB Output is correct
86 Correct 682 ms 32416 KB Output is correct
87 Correct 420 ms 27036 KB Output is correct
88 Correct 674 ms 31456 KB Output is correct
89 Correct 634 ms 32256 KB Output is correct
90 Correct 695 ms 32028 KB Output is correct
91 Correct 501 ms 29572 KB Output is correct
92 Correct 684 ms 32064 KB Output is correct
93 Correct 417 ms 28040 KB Output is correct
94 Correct 692 ms 32016 KB Output is correct
95 Correct 480 ms 28848 KB Output is correct
96 Correct 679 ms 31000 KB Output is correct