oj.uz

Submission #866993

# Submission time Handle Problem Language Result Execution time Memory
866993 2023-10-27T14:48:14 Z lolismek Two Antennas (JOI19_antennas) C++14
100 / 100
 804 ms 40648 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;

        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].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;
    }

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

        int mid = (l + r) / 2, ans = -INF;
        if(ql <= mid){
            ans = max(ans, querym(2 * node, l, mid, ql, qr));
        }
        if(mid + 1 <= qr){
            ans = max(ans, querym(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]){
            //cout << "==== " << ind << ' ' << AINT::querym(1, 1, n, quer[ind].first, quer[ind].second) << endl;
            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;
}

/*
5
10 2 4
1 1 1
2 1 3
1 1 1
100 1 1
5
1 2
2 3
1 3
1 4
1 5

20
260055884 2 15
737689751 5 5
575359903 1 15
341907415 14 14
162026576 9 19
55126745 10 19
95712405 11 14
416027186 8 13
370819848 11 14
629309664 4 13
822713895 5 15
390716905 13 17
577166133 8 19
195931195 10 17
377030463 14 17
968486685 11 19
963040581 4 10
566835557 1 12
586336111 6 16
385865831 8 9
1
1 20

5 16
*/

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 3 ms 14936 KB Output is correct
3 Correct 3 ms 14788 KB Output is correct
4 Correct 3 ms 14684 KB Output is correct
5 Correct 3 ms 14824 KB Output is correct
6 Correct 3 ms 14684 KB Output is correct
7 Correct 3 ms 14684 KB Output is correct
8 Correct 3 ms 14804 KB Output is correct
9 Correct 3 ms 14684 KB Output is correct
10 Correct 3 ms 14684 KB Output is correct
11 Correct 3 ms 14684 KB Output is correct
12 Correct 3 ms 14684 KB Output is correct
13 Correct 3 ms 14684 KB Output is correct
14 Correct 3 ms 14936 KB Output is correct
15 Correct 3 ms 14808 KB Output is correct
16 Correct 3 ms 14684 KB Output is correct
17 Correct 4 ms 14684 KB Output is correct
18 Correct 3 ms 14684 KB Output is correct
19 Correct 3 ms 14680 KB Output is correct
20 Correct 3 ms 14684 KB Output is correct
21 Correct 3 ms 14684 KB Output is correct
22 Correct 3 ms 14684 KB Output is correct
23 Correct 3 ms 14680 KB Output is correct
24 Correct 3 ms 14684 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 3 ms 14936 KB Output is correct
3 Correct 3 ms 14788 KB Output is correct
4 Correct 3 ms 14684 KB Output is correct
5 Correct 3 ms 14824 KB Output is correct
6 Correct 3 ms 14684 KB Output is correct
7 Correct 3 ms 14684 KB Output is correct
8 Correct 3 ms 14804 KB Output is correct
9 Correct 3 ms 14684 KB Output is correct
10 Correct 3 ms 14684 KB Output is correct
11 Correct 3 ms 14684 KB Output is correct
12 Correct 3 ms 14684 KB Output is correct
13 Correct 3 ms 14684 KB Output is correct
14 Correct 3 ms 14936 KB Output is correct
15 Correct 3 ms 14808 KB Output is correct
16 Correct 3 ms 14684 KB Output is correct
17 Correct 4 ms 14684 KB Output is correct
18 Correct 3 ms 14684 KB Output is correct
19 Correct 3 ms 14680 KB Output is correct
20 Correct 3 ms 14684 KB Output is correct
21 Correct 3 ms 14684 KB Output is correct
22 Correct 3 ms 14684 KB Output is correct
23 Correct 3 ms 14680 KB Output is correct
24 Correct 3 ms 14684 KB Output is correct
25 Correct 137 ms 17300 KB Output is correct
26 Correct 19 ms 15196 KB Output is correct
27 Correct 178 ms 18112 KB Output is correct
28 Correct 176 ms 18000 KB Output is correct
29 Correct 117 ms 17204 KB Output is correct
30 Correct 137 ms 17084 KB Output is correct
31 Correct 138 ms 17868 KB Output is correct
32 Correct 177 ms 18152 KB Output is correct
33 Correct 156 ms 18004 KB Output is correct
34 Correct 91 ms 16468 KB Output is correct
35 Correct 168 ms 18264 KB Output is correct
36 Correct 176 ms 18004 KB Output is correct
37 Correct 132 ms 16112 KB Output is correct
38 Correct 179 ms 17212 KB Output is correct
39 Correct 29 ms 15196 KB Output is correct
40 Correct 175 ms 17236 KB Output is correct
41 Correct 128 ms 16572 KB Output is correct
42 Correct 172 ms 17232 KB Output is correct
43 Correct 61 ms 15696 KB Output is correct
44 Correct 186 ms 17148 KB Output is correct
45 Correct 36 ms 15196 KB Output is correct
46 Correct 178 ms 17088 KB Output is correct
47 Correct 48 ms 15476 KB Output is correct
48 Correct 189 ms 17236 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 402 ms 25848 KB Output is correct
2 Correct 447 ms 30816 KB Output is correct
3 Correct 310 ms 27980 KB Output is correct
4 Correct 444 ms 31228 KB Output is correct
5 Correct 195 ms 23420 KB Output is correct
6 Correct 452 ms 30980 KB Output is correct
7 Correct 373 ms 29600 KB Output is correct
8 Correct 479 ms 30776 KB Output is correct
9 Correct 62 ms 18496 KB Output is correct
10 Correct 455 ms 30856 KB Output is correct
11 Correct 271 ms 25156 KB Output is correct
12 Correct 467 ms 30992 KB Output is correct
13 Correct 423 ms 31288 KB Output is correct
14 Correct 399 ms 30988 KB Output is correct
15 Correct 384 ms 29944 KB Output is correct
16 Correct 366 ms 29896 KB Output is correct
17 Correct 422 ms 31620 KB Output is correct
18 Correct 400 ms 30472 KB Output is correct
19 Correct 404 ms 30748 KB Output is correct
20 Correct 401 ms 30512 KB Output is correct
21 Correct 368 ms 30464 KB Output is correct
22 Correct 396 ms 30416 KB Output is correct
23 Correct 396 ms 30672 KB Output is correct
24 Correct 359 ms 29432 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 3 ms 14936 KB Output is correct
3 Correct 3 ms 14788 KB Output is correct
4 Correct 3 ms 14684 KB Output is correct
5 Correct 3 ms 14824 KB Output is correct
6 Correct 3 ms 14684 KB Output is correct
7 Correct 3 ms 14684 KB Output is correct
8 Correct 3 ms 14804 KB Output is correct
9 Correct 3 ms 14684 KB Output is correct
10 Correct 3 ms 14684 KB Output is correct
11 Correct 3 ms 14684 KB Output is correct
12 Correct 3 ms 14684 KB Output is correct
13 Correct 3 ms 14684 KB Output is correct
14 Correct 3 ms 14936 KB Output is correct
15 Correct 3 ms 14808 KB Output is correct
16 Correct 3 ms 14684 KB Output is correct
17 Correct 4 ms 14684 KB Output is correct
18 Correct 3 ms 14684 KB Output is correct
19 Correct 3 ms 14680 KB Output is correct
20 Correct 3 ms 14684 KB Output is correct
21 Correct 3 ms 14684 KB Output is correct
22 Correct 3 ms 14684 KB Output is correct
23 Correct 3 ms 14680 KB Output is correct
24 Correct 3 ms 14684 KB Output is correct
25 Correct 137 ms 17300 KB Output is correct
26 Correct 19 ms 15196 KB Output is correct
27 Correct 178 ms 18112 KB Output is correct
28 Correct 176 ms 18000 KB Output is correct
29 Correct 117 ms 17204 KB Output is correct
30 Correct 137 ms 17084 KB Output is correct
31 Correct 138 ms 17868 KB Output is correct
32 Correct 177 ms 18152 KB Output is correct
33 Correct 156 ms 18004 KB Output is correct
34 Correct 91 ms 16468 KB Output is correct
35 Correct 168 ms 18264 KB Output is correct
36 Correct 176 ms 18004 KB Output is correct
37 Correct 132 ms 16112 KB Output is correct
38 Correct 179 ms 17212 KB Output is correct
39 Correct 29 ms 15196 KB Output is correct
40 Correct 175 ms 17236 KB Output is correct
41 Correct 128 ms 16572 KB Output is correct
42 Correct 172 ms 17232 KB Output is correct
43 Correct 61 ms 15696 KB Output is correct
44 Correct 186 ms 17148 KB Output is correct
45 Correct 36 ms 15196 KB Output is correct
46 Correct 178 ms 17088 KB Output is correct
47 Correct 48 ms 15476 KB Output is correct
48 Correct 189 ms 17236 KB Output is correct
49 Correct 402 ms 25848 KB Output is correct
50 Correct 447 ms 30816 KB Output is correct
51 Correct 310 ms 27980 KB Output is correct
52 Correct 444 ms 31228 KB Output is correct
53 Correct 195 ms 23420 KB Output is correct
54 Correct 452 ms 30980 KB Output is correct
55 Correct 373 ms 29600 KB Output is correct
56 Correct 479 ms 30776 KB Output is correct
57 Correct 62 ms 18496 KB Output is correct
58 Correct 455 ms 30856 KB Output is correct
59 Correct 271 ms 25156 KB Output is correct
60 Correct 467 ms 30992 KB Output is correct
61 Correct 423 ms 31288 KB Output is correct
62 Correct 399 ms 30988 KB Output is correct
63 Correct 384 ms 29944 KB Output is correct
64 Correct 366 ms 29896 KB Output is correct
65 Correct 422 ms 31620 KB Output is correct
66 Correct 400 ms 30472 KB Output is correct
67 Correct 404 ms 30748 KB Output is correct
68 Correct 401 ms 30512 KB Output is correct
69 Correct 368 ms 30464 KB Output is correct
70 Correct 396 ms 30416 KB Output is correct
71 Correct 396 ms 30672 KB Output is correct
72 Correct 359 ms 29432 KB Output is correct
73 Correct 631 ms 37612 KB Output is correct
74 Correct 455 ms 31936 KB Output is correct
75 Correct 613 ms 36436 KB Output is correct
76 Correct 804 ms 40584 KB Output is correct
77 Correct 401 ms 29560 KB Output is correct
78 Correct 655 ms 38480 KB Output is correct
79 Correct 686 ms 38740 KB Output is correct
80 Correct 742 ms 40532 KB Output is correct
81 Correct 298 ms 24660 KB Output is correct
82 Correct 595 ms 36576 KB Output is correct
83 Correct 541 ms 33252 KB Output is correct
84 Correct 747 ms 40648 KB Output is correct
85 Correct 608 ms 36868 KB Output is correct
86 Correct 701 ms 39432 KB Output is correct
87 Correct 430 ms 31804 KB Output is correct
88 Correct 678 ms 38316 KB Output is correct
89 Correct 660 ms 38564 KB Output is correct
90 Correct 703 ms 38940 KB Output is correct
91 Correct 522 ms 34760 KB Output is correct
92 Correct 717 ms 39492 KB Output is correct
93 Correct 424 ms 33012 KB Output is correct
94 Correct 702 ms 39240 KB Output is correct
95 Correct 489 ms 34148 KB Output is correct
96 Correct 663 ms 37912 KB Output is correct