oj.uz

답안 #779752

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
779752 2023-07-11T18:37:59 Z LucaIlie Two Antennas (JOI19_antennas) C++17
100 / 100
 657 ms 54052 KB 
#include <bits/stdc++.h>

using namespace std;

struct update {
    int type, p;
};

struct query {
    int q, l;
};

const int MAX_N = 2e5;
const int MAX_Q = 2e5;
const int INF = 1e9 + 1;
int h[MAX_N], a[MAX_N], b[MAX_N], ans[MAX_Q];
vector<update> updates[2 * MAX_N];
vector<query> queries[MAX_N];

struct segTree {
    struct info {
        int minL, maxL, minR, maxR, maxDelta;

        info operator + ( const info &x ) const {
            return { min( minL, x.minL ), max( maxL, x.maxL ), INF, -INF, max( maxDelta, x.maxDelta ) };
        }
    };

    info segTree[4 * MAX_N];

    void init() {
        for ( int v = 0; v < 4 * MAX_N; v++ )
            segTree[v] = { INF, -INF, INF, -INF, -1 };
    }

    void propag( int v, int l, int r ) {
        if ( segTree[v].minR == INF || segTree[v].minL == INF ) {
            segTree[v].minR = INF;
            segTree[v].maxR = -INF;
            return;
        }

        segTree[v].maxDelta = max( segTree[v].maxDelta, abs( segTree[v].maxR - segTree[v].minL ) );
        segTree[v].maxDelta = max( segTree[v].maxDelta, abs( segTree[v].minR - segTree[v].maxL ) );
        if ( l != r ) {
            segTree[v * 2 + 1].minR = min( segTree[v * 2 + 1].minR, segTree[v].minR );
            segTree[v * 2 + 1].maxR = max( segTree[v * 2 + 1].maxR, segTree[v].maxR );
            segTree[v * 2 + 2].minR = min( segTree[v * 2 + 2].minR, segTree[v].minR );
            segTree[v * 2 + 2].maxR = max( segTree[v * 2 + 2].maxR, segTree[v].maxR );
        }
        segTree[v].minR = INF;
        segTree[v].maxR = -INF;
    }

    void updatePos( int v, int l, int r, int p, int t ) {
        propag( v, l, r );

        if ( l > p || r < p )
            return;

        if ( l == r ) {
            if ( t == 1 )
                segTree[v].minL = segTree[v].maxL = h[p];
            else
                segTree[v].minL = INF, segTree[v].maxL = -INF;
            return;
        }

        int mid = (l + r) / 2;
        updatePos( v * 2 + 1, l, mid, p, t );
        updatePos( v * 2 + 2, mid + 1, r, p, t );
        segTree[v] = segTree[v * 2 + 1] + segTree[v * 2 + 2];
    }

    void updateInterval( int v, int l, int r, int lu, int ru, int val ) {
        propag( v, l, r );

        if ( l > ru || r < lu )
            return;

        if ( lu <= l && r <= ru ) {
            segTree[v].minR = segTree[v].maxR = val;
            propag( v, l, r );
            return;
        }

        int mid = (l + r) / 2;
        updateInterval( v * 2 + 1, l, mid, lu, ru, val );
        updateInterval( v * 2 + 2, mid + 1, r, lu, ru, val );
        segTree[v] = segTree[v * 2 + 1] + segTree[v * 2 + 2];
    }

    info query( int v, int l, int r, int lq, int rq ) {
        propag( v, l, r );

        if ( l > rq || r < lq )
            return { INF, -INF, INF, -INF, -1 };

        if ( lq <= l && r <= rq )
            return segTree[v];

        int mid = (l + r) / 2;
        return query( v * 2 + 1, l, mid, lq, rq ) + query( v * 2 + 2, mid + 1, r, lq, rq );
    }
};

segTree antena3;

int main() {
    int n, q;

    cin >> n;
    for ( int i = 0; i < n; i++ ) {
        cin >> h[i] >> a[i] >> b[i];
        updates[i + a[i]].push_back( { 1, i } );
        updates[i + b[i] + 1].push_back( { -1, i } );
    }

    cin >> q;
    for ( int i = 0; i < q; i++ ) {
        int l, r;
        cin >> l >> r;
        l--;
        r--;
        queries[r].push_back( { i, l } );
    }

    antena3.init();
    for ( int i = 0; i < n; i++ ) {
        for ( update u: updates[i] )
            antena3.updatePos( 0, 0, n - 1, u.p, u.type );
        antena3.updateInterval( 0, 0, n - 1, i - b[i], i - a[i], h[i] );
        for ( query q: queries[i] )
            ans[q.q] = antena3.query( 0, 0, n - 1, q.l, i ).maxDelta;
    }

    for ( int i = 0; i < q; i++ )
        cout << ans[i] << "\n";

    return 0;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 30036 KB Output is correct
2 Correct 13 ms 30088 KB Output is correct
3 Correct 12 ms 30036 KB Output is correct
4 Correct 13 ms 30088 KB Output is correct
5 Correct 13 ms 30088 KB Output is correct
6 Correct 13 ms 30000 KB Output is correct
7 Correct 12 ms 30016 KB Output is correct
8 Correct 13 ms 30036 KB Output is correct
9 Correct 12 ms 30076 KB Output is correct
10 Correct 14 ms 29964 KB Output is correct
11 Correct 12 ms 30036 KB Output is correct
12 Correct 13 ms 30036 KB Output is correct
13 Correct 13 ms 30016 KB Output is correct
14 Correct 12 ms 30036 KB Output is correct
15 Correct 14 ms 30072 KB Output is correct
16 Correct 13 ms 30080 KB Output is correct
17 Correct 15 ms 30036 KB Output is correct
18 Correct 15 ms 30084 KB Output is correct
19 Correct 12 ms 30036 KB Output is correct
20 Correct 13 ms 30024 KB Output is correct
21 Correct 13 ms 30048 KB Output is correct
22 Correct 14 ms 30072 KB Output is correct
23 Correct 13 ms 30036 KB Output is correct
24 Correct 13 ms 30036 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 30036 KB Output is correct
2 Correct 13 ms 30088 KB Output is correct
3 Correct 12 ms 30036 KB Output is correct
4 Correct 13 ms 30088 KB Output is correct
5 Correct 13 ms 30088 KB Output is correct
6 Correct 13 ms 30000 KB Output is correct
7 Correct 12 ms 30016 KB Output is correct
8 Correct 13 ms 30036 KB Output is correct
9 Correct 12 ms 30076 KB Output is correct
10 Correct 14 ms 29964 KB Output is correct
11 Correct 12 ms 30036 KB Output is correct
12 Correct 13 ms 30036 KB Output is correct
13 Correct 13 ms 30016 KB Output is correct
14 Correct 12 ms 30036 KB Output is correct
15 Correct 14 ms 30072 KB Output is correct
16 Correct 13 ms 30080 KB Output is correct
17 Correct 15 ms 30036 KB Output is correct
18 Correct 15 ms 30084 KB Output is correct
19 Correct 12 ms 30036 KB Output is correct
20 Correct 13 ms 30024 KB Output is correct
21 Correct 13 ms 30048 KB Output is correct
22 Correct 14 ms 30072 KB Output is correct
23 Correct 13 ms 30036 KB Output is correct
24 Correct 13 ms 30036 KB Output is correct
25 Correct 106 ms 33680 KB Output is correct
26 Correct 30 ms 30436 KB Output is correct
27 Correct 143 ms 35088 KB Output is correct
28 Correct 147 ms 35208 KB Output is correct
29 Correct 103 ms 33744 KB Output is correct
30 Correct 103 ms 33364 KB Output is correct
31 Correct 116 ms 34420 KB Output is correct
32 Correct 145 ms 35044 KB Output is correct
33 Correct 137 ms 34804 KB Output is correct
34 Correct 79 ms 32448 KB Output is correct
35 Correct 139 ms 35056 KB Output is correct
36 Correct 149 ms 35144 KB Output is correct
37 Correct 90 ms 32480 KB Output is correct
38 Correct 142 ms 34136 KB Output is correct
39 Correct 33 ms 30688 KB Output is correct
40 Correct 142 ms 34072 KB Output is correct
41 Correct 111 ms 33100 KB Output is correct
42 Correct 157 ms 34156 KB Output is correct
43 Correct 56 ms 31432 KB Output is correct
44 Correct 141 ms 34188 KB Output is correct
45 Correct 37 ms 30712 KB Output is correct
46 Correct 143 ms 34216 KB Output is correct
47 Correct 48 ms 31100 KB Output is correct
48 Correct 148 ms 34172 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 335 ms 41972 KB Output is correct
2 Correct 406 ms 44828 KB Output is correct
3 Correct 300 ms 40276 KB Output is correct
4 Correct 365 ms 44808 KB Output is correct
5 Correct 171 ms 36752 KB Output is correct
6 Correct 358 ms 44812 KB Output is correct
7 Correct 303 ms 42848 KB Output is correct
8 Correct 359 ms 44772 KB Output is correct
9 Correct 58 ms 32292 KB Output is correct
10 Correct 384 ms 44720 KB Output is correct
11 Correct 223 ms 39324 KB Output is correct
12 Correct 368 ms 44828 KB Output is correct
13 Correct 240 ms 42188 KB Output is correct
14 Correct 231 ms 42088 KB Output is correct
15 Correct 232 ms 42780 KB Output is correct
16 Correct 221 ms 43244 KB Output is correct
17 Correct 244 ms 42192 KB Output is correct
18 Correct 281 ms 42392 KB Output is correct
19 Correct 236 ms 42036 KB Output is correct
20 Correct 272 ms 42064 KB Output is correct
21 Correct 230 ms 42200 KB Output is correct
22 Correct 286 ms 42392 KB Output is correct
23 Correct 237 ms 42180 KB Output is correct
24 Correct 225 ms 42896 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 30036 KB Output is correct
2 Correct 13 ms 30088 KB Output is correct
3 Correct 12 ms 30036 KB Output is correct
4 Correct 13 ms 30088 KB Output is correct
5 Correct 13 ms 30088 KB Output is correct
6 Correct 13 ms 30000 KB Output is correct
7 Correct 12 ms 30016 KB Output is correct
8 Correct 13 ms 30036 KB Output is correct
9 Correct 12 ms 30076 KB Output is correct
10 Correct 14 ms 29964 KB Output is correct
11 Correct 12 ms 30036 KB Output is correct
12 Correct 13 ms 30036 KB Output is correct
13 Correct 13 ms 30016 KB Output is correct
14 Correct 12 ms 30036 KB Output is correct
15 Correct 14 ms 30072 KB Output is correct
16 Correct 13 ms 30080 KB Output is correct
17 Correct 15 ms 30036 KB Output is correct
18 Correct 15 ms 30084 KB Output is correct
19 Correct 12 ms 30036 KB Output is correct
20 Correct 13 ms 30024 KB Output is correct
21 Correct 13 ms 30048 KB Output is correct
22 Correct 14 ms 30072 KB Output is correct
23 Correct 13 ms 30036 KB Output is correct
24 Correct 13 ms 30036 KB Output is correct
25 Correct 106 ms 33680 KB Output is correct
26 Correct 30 ms 30436 KB Output is correct
27 Correct 143 ms 35088 KB Output is correct
28 Correct 147 ms 35208 KB Output is correct
29 Correct 103 ms 33744 KB Output is correct
30 Correct 103 ms 33364 KB Output is correct
31 Correct 116 ms 34420 KB Output is correct
32 Correct 145 ms 35044 KB Output is correct
33 Correct 137 ms 34804 KB Output is correct
34 Correct 79 ms 32448 KB Output is correct
35 Correct 139 ms 35056 KB Output is correct
36 Correct 149 ms 35144 KB Output is correct
37 Correct 90 ms 32480 KB Output is correct
38 Correct 142 ms 34136 KB Output is correct
39 Correct 33 ms 30688 KB Output is correct
40 Correct 142 ms 34072 KB Output is correct
41 Correct 111 ms 33100 KB Output is correct
42 Correct 157 ms 34156 KB Output is correct
43 Correct 56 ms 31432 KB Output is correct
44 Correct 141 ms 34188 KB Output is correct
45 Correct 37 ms 30712 KB Output is correct
46 Correct 143 ms 34216 KB Output is correct
47 Correct 48 ms 31100 KB Output is correct
48 Correct 148 ms 34172 KB Output is correct
49 Correct 335 ms 41972 KB Output is correct
50 Correct 406 ms 44828 KB Output is correct
51 Correct 300 ms 40276 KB Output is correct
52 Correct 365 ms 44808 KB Output is correct
53 Correct 171 ms 36752 KB Output is correct
54 Correct 358 ms 44812 KB Output is correct
55 Correct 303 ms 42848 KB Output is correct
56 Correct 359 ms 44772 KB Output is correct
57 Correct 58 ms 32292 KB Output is correct
58 Correct 384 ms 44720 KB Output is correct
59 Correct 223 ms 39324 KB Output is correct
60 Correct 368 ms 44828 KB Output is correct
61 Correct 240 ms 42188 KB Output is correct
62 Correct 231 ms 42088 KB Output is correct
63 Correct 232 ms 42780 KB Output is correct
64 Correct 221 ms 43244 KB Output is correct
65 Correct 244 ms 42192 KB Output is correct
66 Correct 281 ms 42392 KB Output is correct
67 Correct 236 ms 42036 KB Output is correct
68 Correct 272 ms 42064 KB Output is correct
69 Correct 230 ms 42200 KB Output is correct
70 Correct 286 ms 42392 KB Output is correct
71 Correct 237 ms 42180 KB Output is correct
72 Correct 225 ms 42896 KB Output is correct
73 Correct 514 ms 50224 KB Output is correct
74 Correct 392 ms 45628 KB Output is correct
75 Correct 487 ms 49004 KB Output is correct
76 Correct 614 ms 54052 KB Output is correct
77 Correct 319 ms 42932 KB Output is correct
78 Correct 563 ms 51104 KB Output is correct
79 Correct 593 ms 51648 KB Output is correct
80 Correct 657 ms 53856 KB Output is correct
81 Correct 243 ms 39776 KB Output is correct
82 Correct 518 ms 49628 KB Output is correct
83 Correct 449 ms 47724 KB Output is correct
84 Correct 647 ms 53912 KB Output is correct
85 Correct 432 ms 46976 KB Output is correct
86 Correct 500 ms 49992 KB Output is correct
87 Correct 269 ms 44152 KB Output is correct
88 Correct 511 ms 51208 KB Output is correct
89 Correct 444 ms 48120 KB Output is correct
90 Correct 489 ms 50356 KB Output is correct
91 Correct 335 ms 44980 KB Output is correct
92 Correct 479 ms 50096 KB Output is correct
93 Correct 279 ms 43724 KB Output is correct
94 Correct 473 ms 50344 KB Output is correct
95 Correct 304 ms 44504 KB Output is correct
96 Correct 472 ms 50788 KB Output is correct