oj.uz

Submission #779751

# Submission time Handle Problem Language Result Execution time Memory
779751 2023-07-11T18:37:31 Z LucaIlie Two Antennas (JOI19_antennas) C++17
13 / 100
 151 ms 32332 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[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

# Verdict Execution time Memory Grader output
1 Correct 11 ms 25300 KB Output is correct
2 Correct 11 ms 25400 KB Output is correct
3 Correct 12 ms 25300 KB Output is correct
4 Correct 11 ms 25300 KB Output is correct
5 Correct 12 ms 25324 KB Output is correct
6 Correct 12 ms 25328 KB Output is correct
7 Correct 14 ms 25328 KB Output is correct
8 Correct 12 ms 25332 KB Output is correct
9 Correct 11 ms 25300 KB Output is correct
10 Correct 12 ms 25336 KB Output is correct
11 Correct 14 ms 25388 KB Output is correct
12 Correct 11 ms 25300 KB Output is correct
13 Correct 12 ms 25300 KB Output is correct
14 Correct 12 ms 25332 KB Output is correct
15 Correct 11 ms 25324 KB Output is correct
16 Correct 11 ms 25328 KB Output is correct
17 Correct 11 ms 25328 KB Output is correct
18 Correct 11 ms 25332 KB Output is correct
19 Correct 11 ms 25328 KB Output is correct
20 Correct 11 ms 25328 KB Output is correct
21 Correct 11 ms 25336 KB Output is correct
22 Correct 11 ms 25300 KB Output is correct
23 Correct 11 ms 25332 KB Output is correct
24 Correct 11 ms 25332 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 25300 KB Output is correct
2 Correct 11 ms 25400 KB Output is correct
3 Correct 12 ms 25300 KB Output is correct
4 Correct 11 ms 25300 KB Output is correct
5 Correct 12 ms 25324 KB Output is correct
6 Correct 12 ms 25328 KB Output is correct
7 Correct 14 ms 25328 KB Output is correct
8 Correct 12 ms 25332 KB Output is correct
9 Correct 11 ms 25300 KB Output is correct
10 Correct 12 ms 25336 KB Output is correct
11 Correct 14 ms 25388 KB Output is correct
12 Correct 11 ms 25300 KB Output is correct
13 Correct 12 ms 25300 KB Output is correct
14 Correct 12 ms 25332 KB Output is correct
15 Correct 11 ms 25324 KB Output is correct
16 Correct 11 ms 25328 KB Output is correct
17 Correct 11 ms 25328 KB Output is correct
18 Correct 11 ms 25332 KB Output is correct
19 Correct 11 ms 25328 KB Output is correct
20 Correct 11 ms 25328 KB Output is correct
21 Correct 11 ms 25336 KB Output is correct
22 Correct 11 ms 25300 KB Output is correct
23 Correct 11 ms 25332 KB Output is correct
24 Correct 11 ms 25332 KB Output is correct
25 Correct 100 ms 30216 KB Output is correct
26 Correct 23 ms 25924 KB Output is correct
27 Correct 140 ms 32208 KB Output is correct
28 Correct 144 ms 32240 KB Output is correct
29 Correct 99 ms 30356 KB Output is correct
30 Correct 101 ms 29916 KB Output is correct
31 Correct 114 ms 31192 KB Output is correct
32 Correct 148 ms 32332 KB Output is correct
33 Correct 137 ms 31896 KB Output is correct
34 Correct 76 ms 28716 KB Output is correct
35 Correct 138 ms 32148 KB Output is correct
36 Correct 145 ms 32332 KB Output is correct
37 Correct 87 ms 28864 KB Output is correct
38 Correct 139 ms 31288 KB Output is correct
39 Correct 36 ms 26260 KB Output is correct
40 Correct 143 ms 31268 KB Output is correct
41 Correct 112 ms 29836 KB Output is correct
42 Correct 148 ms 31296 KB Output is correct
43 Correct 55 ms 27288 KB Output is correct
44 Correct 141 ms 31344 KB Output is correct
45 Correct 34 ms 26444 KB Output is correct
46 Correct 143 ms 31300 KB Output is correct
47 Correct 45 ms 26896 KB Output is correct
48 Correct 151 ms 31284 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Runtime error 59 ms 29032 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 25300 KB Output is correct
2 Correct 11 ms 25400 KB Output is correct
3 Correct 12 ms 25300 KB Output is correct
4 Correct 11 ms 25300 KB Output is correct
5 Correct 12 ms 25324 KB Output is correct
6 Correct 12 ms 25328 KB Output is correct
7 Correct 14 ms 25328 KB Output is correct
8 Correct 12 ms 25332 KB Output is correct
9 Correct 11 ms 25300 KB Output is correct
10 Correct 12 ms 25336 KB Output is correct
11 Correct 14 ms 25388 KB Output is correct
12 Correct 11 ms 25300 KB Output is correct
13 Correct 12 ms 25300 KB Output is correct
14 Correct 12 ms 25332 KB Output is correct
15 Correct 11 ms 25324 KB Output is correct
16 Correct 11 ms 25328 KB Output is correct
17 Correct 11 ms 25328 KB Output is correct
18 Correct 11 ms 25332 KB Output is correct
19 Correct 11 ms 25328 KB Output is correct
20 Correct 11 ms 25328 KB Output is correct
21 Correct 11 ms 25336 KB Output is correct
22 Correct 11 ms 25300 KB Output is correct
23 Correct 11 ms 25332 KB Output is correct
24 Correct 11 ms 25332 KB Output is correct
25 Correct 100 ms 30216 KB Output is correct
26 Correct 23 ms 25924 KB Output is correct
27 Correct 140 ms 32208 KB Output is correct
28 Correct 144 ms 32240 KB Output is correct
29 Correct 99 ms 30356 KB Output is correct
30 Correct 101 ms 29916 KB Output is correct
31 Correct 114 ms 31192 KB Output is correct
32 Correct 148 ms 32332 KB Output is correct
33 Correct 137 ms 31896 KB Output is correct
34 Correct 76 ms 28716 KB Output is correct
35 Correct 138 ms 32148 KB Output is correct
36 Correct 145 ms 32332 KB Output is correct
37 Correct 87 ms 28864 KB Output is correct
38 Correct 139 ms 31288 KB Output is correct
39 Correct 36 ms 26260 KB Output is correct
40 Correct 143 ms 31268 KB Output is correct
41 Correct 112 ms 29836 KB Output is correct
42 Correct 148 ms 31296 KB Output is correct
43 Correct 55 ms 27288 KB Output is correct
44 Correct 141 ms 31344 KB Output is correct
45 Correct 34 ms 26444 KB Output is correct
46 Correct 143 ms 31300 KB Output is correct
47 Correct 45 ms 26896 KB Output is correct
48 Correct 151 ms 31284 KB Output is correct
49 Runtime error 59 ms 29032 KB Execution killed with signal 11
50 Halted 0 ms 0 KB -