oj.uz

Submission #575560

# Submission time Handle Problem Language Result Execution time Memory
575560 2022-06-11T03:07:29 Z chonka Two Antennas (JOI19_antennas) C++17
100 / 100
 648 ms 39436 KB 
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
const int MAXN = 200007 ;
const int inf = 1000000007 ;

int n , m ;
int h[ MAXN ] , a[ MAXN ] , b[ MAXN ] ;

pair < int , int > qlist[ MAXN ] ;
int ans[ MAXN ] ;

vector < pair < int , int > > v[ MAXN ] ;
vector < int > to_solve[ MAXN ] ;

class Tree {
public :
    int tr[ 4 * MAXN ] , ret[ 4 * MAXN ] ;
    int lazy[ 4 * MAXN ] ;
    void push_lazy ( int where , int IL , int IR ) {
        ret[ where ] = max ( ret[ where ] , tr[ where ] + lazy[ where ] ) ;
        if ( IL != IR ) {
            lazy[ 2 * where ] = max ( lazy[ 2 * where ] , lazy[ where ] ) ;
            lazy[ 2 * where + 1 ] = max ( lazy[ 2 * where + 1 ] , lazy[ where ] ) ;
        }
        lazy[ where ] = -inf ;
    }
    void init ( int where , int IL , int IR ) {
        tr[ where ] = lazy[ where ] = ret[ where ] = -inf ;
        if ( IL == IR ) { return ; }
        int mid = ( IL + IR ) / 2 ;
        init ( 2 * where , IL , mid ) ;
        init ( 2 * where + 1 , mid + 1 , IR ) ;
    }
    void upd_pos ( int where , int IL , int IR , int pos , int nw ) {
        push_lazy ( where , IL , IR ) ;
        if ( IR < pos || pos < IL ) { return ; }
        if ( IL == IR ) {
            tr[ where ] = nw ;
            return ;
        }
        int mid = ( IL + IR ) / 2 ;
        upd_pos ( 2 * where , IL , mid , pos , nw ) ;
        upd_pos ( 2 * where + 1 , mid + 1 , IR , pos , nw ) ;
        tr[ where ] = max ( tr[ 2 * where ] , tr[ 2 * where + 1 ] ) ;
        ret[ where ] = max ( ret[ 2 * where ] , ret[ 2 * where + 1 ] ) ;
    }
    void upd_range ( int where , int IL , int IR , int CURL , int CURR , int val ) {
        push_lazy ( where , IL , IR ) ;
        if ( IL > IR || CURL > CURR ) { return ; }
        if ( IR < CURL || CURR < IL ) { return ; }
        if ( CURL <= IL && IR <= CURR ) {
            lazy[ where ] = val ;
            push_lazy ( where , IL , IR ) ;
            return ;
        }
        int mid = ( IL + IR ) / 2 ;
        upd_range ( 2 * where , IL , mid , CURL , CURR , val ) ;
        upd_range ( 2 * where + 1 , mid + 1 , IR , CURL , CURR , val ) ;
        tr[ where ] = max ( tr[ 2 * where ] , tr[ 2 * where + 1 ] ) ;
        ret[ where ] = max ( ret[ 2 * where ] , ret[ 2 * where + 1 ] ) ;
    }
    int query ( int where , int IL , int IR , int CURL , int CURR ) {
        push_lazy ( where , IL , IR ) ;
        if ( IL > IR || CURL > IR ) { return -inf ; }
        if ( IR < CURL || CURR < IL ) { return -inf ; }
        if ( CURL <= IL && IR <= CURR ) { return ret[ where ] ; }
        int mid = ( IL + IR ) / 2 ;
        return max ( query ( 2 * where , IL , mid , CURL , CURR ) , query ( 2 * where + 1 , mid + 1 , IR , CURL , CURR ) ) ;
    }
};
Tree w ;

void input ( ) {
    cin >> n ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        cin >> h[ i ] >> a[ i ] >> b[ i ] ;
    }
    cin >> m ;
    for ( int i = 1 ; i <= m ; ++ i ) {
        cin >> qlist[ i ].first >> qlist[ i ].second ;
        ans[ i ] = -inf ;
    }
}

void solve ( ) {
    for ( int iter = 0 ; iter < 2 ; ++ iter ) {
        w.init ( 1 , 1 , n ) ;
        for ( int i = 1 ; i <= n ; ++ i ) {
            int st = i + a[ i ] , en = i + b[ i ] + 1 ;
            if ( st <= n ) {
                v[ st ].push_back ( { i , 1 } ) ;
            }
            if ( en <= n ) {
                v[ en ].push_back ( { i , -1 } ) ;
            }
        }
        for ( int i = 1 ; i <= m ; ++ i ) {
            to_solve[ qlist[ i ].second ].push_back ( i ) ;
        }
        for ( int i = 1 ; i <= n ; ++ i ) {
            for ( auto e : v[ i ] ) {
                int id = e.first , type = e.second ;
                if ( type == 1 ) {
                    w.upd_pos ( 1 , 1 , n , id , -h[ id ] ) ;
                }
                else {
                    w.upd_pos ( 1 , 1 , n , id , -inf ) ;
                }
            }
            int st = i - b[ i ] ;
            int en = i - a[ i ] ;
            if ( st < 1 ) { st = 1 ; }
            if ( en < 0 ) { en = 0 ; }
            w.upd_range ( 1 , 1 , n , st , en , h[ i ] ) ;
            for ( auto id : to_solve[ i ] ) {
                ans[ id ] = max ( ans[ id ] , w.query ( 1 , 1 , n , qlist[ id ].first , i ) ) ;
            }
        }
        for ( int i = 1 ; i < n - i + 1 ; ++ i ) {
            swap ( h[ i ] , h[ n - i + 1 ] ) ;
            swap ( a[ i ] , a[ n - i + 1 ] ) ;
            swap ( b[ i ] , b[ n - i + 1 ] ) ;
        }
        for ( int i = 1 ; i <= m ; ++ i ) {
            int x = qlist[ i ].first , y = qlist[ i ].second ;
            qlist[ i ] = { n - y + 1 , n - x + 1 } ;
        }
        for ( int i = 1 ; i <= n ; ++ i ) {
            v[ i ].clear ( ) ;
            to_solve[ i ].clear ( ) ;
        }
    }
    for ( int i = 1 ; i <= m ; ++ i ) {
        if ( ans[ i ] < 0 ) { ans[ i ] = -1 ; }
        cout << ans[ i ] << "\n" ;
    }
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ;
    /// cin >> t ;
    while ( t -- ) {
        input ( ) ;
        solve ( ) ;
    }
    return 0 ;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9744 KB Output is correct
3 Correct 5 ms 9736 KB Output is correct
4 Correct 5 ms 9812 KB Output is correct
5 Correct 6 ms 9768 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 6 ms 9736 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 6 ms 9684 KB Output is correct
11 Correct 5 ms 9736 KB Output is correct
12 Correct 5 ms 9748 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 6 ms 9736 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 6 ms 9684 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Correct 5 ms 9684 KB Output is correct
23 Correct 5 ms 9700 KB Output is correct
24 Correct 5 ms 9736 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9744 KB Output is correct
3 Correct 5 ms 9736 KB Output is correct
4 Correct 5 ms 9812 KB Output is correct
5 Correct 6 ms 9768 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 6 ms 9736 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 6 ms 9684 KB Output is correct
11 Correct 5 ms 9736 KB Output is correct
12 Correct 5 ms 9748 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 6 ms 9736 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 6 ms 9684 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Correct 5 ms 9684 KB Output is correct
23 Correct 5 ms 9700 KB Output is correct
24 Correct 5 ms 9736 KB Output is correct
25 Correct 95 ms 15180 KB Output is correct
26 Correct 18 ms 10512 KB Output is correct
27 Correct 150 ms 17360 KB Output is correct
28 Correct 144 ms 17412 KB Output is correct
29 Correct 96 ms 15180 KB Output is correct
30 Correct 105 ms 14908 KB Output is correct
31 Correct 109 ms 16600 KB Output is correct
32 Correct 143 ms 17392 KB Output is correct
33 Correct 133 ms 17000 KB Output is correct
34 Correct 73 ms 13416 KB Output is correct
35 Correct 145 ms 17532 KB Output is correct
36 Correct 146 ms 17356 KB Output is correct
37 Correct 84 ms 13708 KB Output is correct
38 Correct 143 ms 16356 KB Output is correct
39 Correct 27 ms 10780 KB Output is correct
40 Correct 144 ms 16416 KB Output is correct
41 Correct 117 ms 14852 KB Output is correct
42 Correct 142 ms 16376 KB Output is correct
43 Correct 51 ms 12072 KB Output is correct
44 Correct 143 ms 16424 KB Output is correct
45 Correct 30 ms 10956 KB Output is correct
46 Correct 148 ms 16336 KB Output is correct
47 Correct 42 ms 11548 KB Output is correct
48 Correct 144 ms 16336 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 281 ms 22160 KB Output is correct
2 Correct 304 ms 22844 KB Output is correct
3 Correct 200 ms 20668 KB Output is correct
4 Correct 296 ms 22768 KB Output is correct
5 Correct 119 ms 16012 KB Output is correct
6 Correct 319 ms 22828 KB Output is correct
7 Correct 253 ms 21836 KB Output is correct
8 Correct 301 ms 22764 KB Output is correct
9 Correct 45 ms 11576 KB Output is correct
10 Correct 294 ms 22840 KB Output is correct
11 Correct 169 ms 17196 KB Output is correct
12 Correct 320 ms 22860 KB Output is correct
13 Correct 241 ms 23088 KB Output is correct
14 Correct 212 ms 22776 KB Output is correct
15 Correct 209 ms 21848 KB Output is correct
16 Correct 195 ms 21908 KB Output is correct
17 Correct 232 ms 23504 KB Output is correct
18 Correct 222 ms 22336 KB Output is correct
19 Correct 228 ms 22692 KB Output is correct
20 Correct 216 ms 22684 KB Output is correct
21 Correct 202 ms 22600 KB Output is correct
22 Correct 214 ms 22592 KB Output is correct
23 Correct 220 ms 22808 KB Output is correct
24 Correct 185 ms 21316 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9744 KB Output is correct
3 Correct 5 ms 9736 KB Output is correct
4 Correct 5 ms 9812 KB Output is correct
5 Correct 6 ms 9768 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 6 ms 9736 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 6 ms 9684 KB Output is correct
11 Correct 5 ms 9736 KB Output is correct
12 Correct 5 ms 9748 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 6 ms 9736 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 6 ms 9684 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Correct 5 ms 9684 KB Output is correct
23 Correct 5 ms 9700 KB Output is correct
24 Correct 5 ms 9736 KB Output is correct
25 Correct 95 ms 15180 KB Output is correct
26 Correct 18 ms 10512 KB Output is correct
27 Correct 150 ms 17360 KB Output is correct
28 Correct 144 ms 17412 KB Output is correct
29 Correct 96 ms 15180 KB Output is correct
30 Correct 105 ms 14908 KB Output is correct
31 Correct 109 ms 16600 KB Output is correct
32 Correct 143 ms 17392 KB Output is correct
33 Correct 133 ms 17000 KB Output is correct
34 Correct 73 ms 13416 KB Output is correct
35 Correct 145 ms 17532 KB Output is correct
36 Correct 146 ms 17356 KB Output is correct
37 Correct 84 ms 13708 KB Output is correct
38 Correct 143 ms 16356 KB Output is correct
39 Correct 27 ms 10780 KB Output is correct
40 Correct 144 ms 16416 KB Output is correct
41 Correct 117 ms 14852 KB Output is correct
42 Correct 142 ms 16376 KB Output is correct
43 Correct 51 ms 12072 KB Output is correct
44 Correct 143 ms 16424 KB Output is correct
45 Correct 30 ms 10956 KB Output is correct
46 Correct 148 ms 16336 KB Output is correct
47 Correct 42 ms 11548 KB Output is correct
48 Correct 144 ms 16336 KB Output is correct
49 Correct 281 ms 22160 KB Output is correct
50 Correct 304 ms 22844 KB Output is correct
51 Correct 200 ms 20668 KB Output is correct
52 Correct 296 ms 22768 KB Output is correct
53 Correct 119 ms 16012 KB Output is correct
54 Correct 319 ms 22828 KB Output is correct
55 Correct 253 ms 21836 KB Output is correct
56 Correct 301 ms 22764 KB Output is correct
57 Correct 45 ms 11576 KB Output is correct
58 Correct 294 ms 22840 KB Output is correct
59 Correct 169 ms 17196 KB Output is correct
60 Correct 320 ms 22860 KB Output is correct
61 Correct 241 ms 23088 KB Output is correct
62 Correct 212 ms 22776 KB Output is correct
63 Correct 209 ms 21848 KB Output is correct
64 Correct 195 ms 21908 KB Output is correct
65 Correct 232 ms 23504 KB Output is correct
66 Correct 222 ms 22336 KB Output is correct
67 Correct 228 ms 22692 KB Output is correct
68 Correct 216 ms 22684 KB Output is correct
69 Correct 202 ms 22600 KB Output is correct
70 Correct 214 ms 22592 KB Output is correct
71 Correct 220 ms 22808 KB Output is correct
72 Correct 185 ms 21316 KB Output is correct
73 Correct 525 ms 35560 KB Output is correct
74 Correct 334 ms 28620 KB Output is correct
75 Correct 517 ms 34856 KB Output is correct
76 Correct 636 ms 39384 KB Output is correct
77 Correct 333 ms 25724 KB Output is correct
78 Correct 549 ms 36316 KB Output is correct
79 Correct 598 ms 37388 KB Output is correct
80 Correct 640 ms 39436 KB Output is correct
81 Correct 241 ms 20704 KB Output is correct
82 Correct 482 ms 34256 KB Output is correct
83 Correct 475 ms 30452 KB Output is correct
84 Correct 648 ms 39380 KB Output is correct
85 Correct 444 ms 34792 KB Output is correct
86 Correct 545 ms 38152 KB Output is correct
87 Correct 274 ms 28508 KB Output is correct
88 Correct 538 ms 37244 KB Output is correct
89 Correct 479 ms 36736 KB Output is correct
90 Correct 581 ms 37796 KB Output is correct
91 Correct 343 ms 31724 KB Output is correct
92 Correct 546 ms 38012 KB Output is correct
93 Correct 276 ms 29788 KB Output is correct
94 Correct 542 ms 37956 KB Output is correct
95 Correct 309 ms 31044 KB Output is correct
96 Correct 515 ms 36796 KB Output is correct