oj.uz

답안 #866992

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
866992 2023-10-27T14:47:27 Z lolismek Two Antennas (JOI19_antennas) C++14
13 / 100
 187 ms 39088 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[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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 3 ms 12796 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 3 ms 12756 KB Output is correct
5 Correct 3 ms 12756 KB Output is correct
6 Correct 3 ms 12632 KB Output is correct
7 Correct 4 ms 12636 KB Output is correct
8 Correct 3 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 3 ms 12768 KB Output is correct
11 Correct 3 ms 12636 KB Output is correct
12 Correct 3 ms 12636 KB Output is correct
13 Correct 3 ms 12636 KB Output is correct
14 Correct 3 ms 12636 KB Output is correct
15 Correct 4 ms 12632 KB Output is correct
16 Correct 3 ms 12636 KB Output is correct
17 Correct 3 ms 12760 KB Output is correct
18 Correct 3 ms 12636 KB Output is correct
19 Correct 3 ms 12636 KB Output is correct
20 Correct 3 ms 12756 KB Output is correct
21 Correct 3 ms 12636 KB Output is correct
22 Correct 3 ms 12636 KB Output is correct
23 Correct 3 ms 12884 KB Output is correct
24 Correct 3 ms 12632 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 3 ms 12796 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 3 ms 12756 KB Output is correct
5 Correct 3 ms 12756 KB Output is correct
6 Correct 3 ms 12632 KB Output is correct
7 Correct 4 ms 12636 KB Output is correct
8 Correct 3 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 3 ms 12768 KB Output is correct
11 Correct 3 ms 12636 KB Output is correct
12 Correct 3 ms 12636 KB Output is correct
13 Correct 3 ms 12636 KB Output is correct
14 Correct 3 ms 12636 KB Output is correct
15 Correct 4 ms 12632 KB Output is correct
16 Correct 3 ms 12636 KB Output is correct
17 Correct 3 ms 12760 KB Output is correct
18 Correct 3 ms 12636 KB Output is correct
19 Correct 3 ms 12636 KB Output is correct
20 Correct 3 ms 12756 KB Output is correct
21 Correct 3 ms 12636 KB Output is correct
22 Correct 3 ms 12636 KB Output is correct
23 Correct 3 ms 12884 KB Output is correct
24 Correct 3 ms 12632 KB Output is correct
25 Correct 115 ms 16428 KB Output is correct
26 Correct 18 ms 13196 KB Output is correct
27 Correct 171 ms 17872 KB Output is correct
28 Correct 175 ms 17836 KB Output is correct
29 Correct 124 ms 16292 KB Output is correct
30 Correct 118 ms 16212 KB Output is correct
31 Correct 133 ms 17292 KB Output is correct
32 Correct 176 ms 18004 KB Output is correct
33 Correct 157 ms 17720 KB Output is correct
34 Correct 97 ms 15188 KB Output is correct
35 Correct 169 ms 18160 KB Output is correct
36 Correct 182 ms 17868 KB Output is correct
37 Correct 101 ms 15188 KB Output is correct
38 Correct 184 ms 16964 KB Output is correct
39 Correct 29 ms 13660 KB Output is correct
40 Correct 174 ms 17032 KB Output is correct
41 Correct 127 ms 16044 KB Output is correct
42 Correct 174 ms 16980 KB Output is correct
43 Correct 61 ms 14160 KB Output is correct
44 Correct 173 ms 16964 KB Output is correct
45 Correct 37 ms 13656 KB Output is correct
46 Correct 179 ms 17236 KB Output is correct
47 Correct 48 ms 13908 KB Output is correct
48 Correct 187 ms 16976 KB Output is correct

Subtask #3
0 / 22.0

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

Subtask #4
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 3 ms 12796 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 3 ms 12756 KB Output is correct
5 Correct 3 ms 12756 KB Output is correct
6 Correct 3 ms 12632 KB Output is correct
7 Correct 4 ms 12636 KB Output is correct
8 Correct 3 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 3 ms 12768 KB Output is correct
11 Correct 3 ms 12636 KB Output is correct
12 Correct 3 ms 12636 KB Output is correct
13 Correct 3 ms 12636 KB Output is correct
14 Correct 3 ms 12636 KB Output is correct
15 Correct 4 ms 12632 KB Output is correct
16 Correct 3 ms 12636 KB Output is correct
17 Correct 3 ms 12760 KB Output is correct
18 Correct 3 ms 12636 KB Output is correct
19 Correct 3 ms 12636 KB Output is correct
20 Correct 3 ms 12756 KB Output is correct
21 Correct 3 ms 12636 KB Output is correct
22 Correct 3 ms 12636 KB Output is correct
23 Correct 3 ms 12884 KB Output is correct
24 Correct 3 ms 12632 KB Output is correct
25 Correct 115 ms 16428 KB Output is correct
26 Correct 18 ms 13196 KB Output is correct
27 Correct 171 ms 17872 KB Output is correct
28 Correct 175 ms 17836 KB Output is correct
29 Correct 124 ms 16292 KB Output is correct
30 Correct 118 ms 16212 KB Output is correct
31 Correct 133 ms 17292 KB Output is correct
32 Correct 176 ms 18004 KB Output is correct
33 Correct 157 ms 17720 KB Output is correct
34 Correct 97 ms 15188 KB Output is correct
35 Correct 169 ms 18160 KB Output is correct
36 Correct 182 ms 17868 KB Output is correct
37 Correct 101 ms 15188 KB Output is correct
38 Correct 184 ms 16964 KB Output is correct
39 Correct 29 ms 13660 KB Output is correct
40 Correct 174 ms 17032 KB Output is correct
41 Correct 127 ms 16044 KB Output is correct
42 Correct 174 ms 16980 KB Output is correct
43 Correct 61 ms 14160 KB Output is correct
44 Correct 173 ms 16964 KB Output is correct
45 Correct 37 ms 13656 KB Output is correct
46 Correct 179 ms 17236 KB Output is correct
47 Correct 48 ms 13908 KB Output is correct
48 Correct 187 ms 16976 KB Output is correct
49 Runtime error 169 ms 39088 KB Execution killed with signal 11
50 Halted 0 ms 0 KB -