oj.uz

Submission #947838

# Submission time Handle Problem Language Result Execution time Memory
947838 2024-03-17T05:56:27 Z phoenix0423 Two Antennas (JOI19_antennas) C++17
100 / 100
 539 ms 58108 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define int long long
const int maxn = 2e5 + 5;
const int INF = 1e18;
int n, q;
int h[maxn], a[maxn], b[maxn];
vector<pll> qry[maxn], e[maxn * 2];
int ans[maxn];

struct node{
    int ans, mxc;
    int td; 
} st[maxn * 4];

void build(int v = 1, int l = 0, int r = n - 1){
    st[v].ans = st[v].mxc = -INF;
    st[v].td = INF;
    if(l == r) return;
    int m = (l + r) / 2;
    build(v * 2, l, m);
    build(v * 2 + 1, m + 1, r);
}

void cast(int v, int val){
    st[v].td = min(st[v].td, val);
    st[v].ans = max(st[v].ans, st[v].mxc - st[v].td);
}

void push(int v){
    if(st[v].td != INF){
        cast(v * 2, st[v].td);
        cast(v * 2 + 1, st[v].td);
        st[v].td = INF;
    }
}
void pull(int v){
    st[v].mxc = max(st[v * 2].mxc, st[v * 2 + 1].mxc);
    st[v].ans = max(st[v * 2].ans, st[v * 2 + 1].ans);
}

void setc(int pos, int val, int v = 1, int l = 0, int r = n - 1){
    if(l == r){
        st[v].mxc = val;
        st[v].td = INF;
        return;
    }
    push(v);
    int m = (l + r) / 2;
    if(pos <= m) setc(pos, val, v * 2, l, m);
    else setc(pos, val, v * 2 + 1, m + 1, r);
    pull(v);
}

void apply(int l, int r, int val, int v = 1, int L = 0, int R = n - 1){
    if(l > R || r < L) return;
    if(l <= L && r >= R){
        cast(v, val);
        return;
    }
    push(v);
    int m = (L + R) / 2;
    apply(l, r, val, v * 2, L, m);
    apply(l, r, val, v * 2 + 1, m + 1, R);
    pull(v);
}

int get(int l, int r, int v = 1, int L = 0, int R = n - 1){
    if(l > R || r < L) return -INF;
    if(l <= L && r >= R) return st[v].ans;
    push(v);
    int m = (L + R) / 2;
    return max(get(l, r, v * 2, L, m), get(l, r, v * 2 + 1, m + 1, R));
}

void solve(){
    build();
    for(int i = 0; i < n; i++){
        // erase j
        for(auto [x, t] : e[i]){
            if(t == -1) setc(x, -INF);
            else setc(x, h[x]);
        }
        //insert i
        apply(max(0LL, i - b[i]), i - a[i], h[i]);
        //handle qry
        for(auto [l, id] : qry[i]){
            ans[id] = max(ans[id], get(l, i));
        }
    }
}

signed main(void){
    fastio;
    cin>>n;
    for(int i = 0; i < n; i++){
        cin>>h[i]>>a[i]>>b[i];
        e[i + a[i]].eb(i, 1);
        e[i + b[i] + 1].eb(i, -1);
    }
    cin>>q;
    for(int i = 0; i < q; i++){
        int l, r;
        cin>>l>>r;
        l--, r--;
        qry[r].eb(l, i);
    }
    for(int i = 0; i < q; i++) ans[i] = -INF;
    solve();
    for(int i = 0; i < n; i++) h[i] = INF - h[i];
    solve();
    for(int i = 0; i < q; i++) cout<<(ans[i] >= 0 ? ans[i] : -1)<<"\n";
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 18780 KB Output is correct
2 Correct 5 ms 18780 KB Output is correct
3 Correct 4 ms 18780 KB Output is correct
4 Correct 5 ms 18780 KB Output is correct
5 Correct 4 ms 18872 KB Output is correct
6 Correct 5 ms 18780 KB Output is correct
7 Correct 4 ms 18780 KB Output is correct
8 Correct 5 ms 19036 KB Output is correct
9 Correct 4 ms 18780 KB Output is correct
10 Correct 4 ms 18776 KB Output is correct
11 Correct 4 ms 18780 KB Output is correct
12 Correct 4 ms 18780 KB Output is correct
13 Correct 5 ms 18780 KB Output is correct
14 Correct 5 ms 18948 KB Output is correct
15 Correct 4 ms 18932 KB Output is correct
16 Correct 4 ms 18780 KB Output is correct
17 Correct 4 ms 18780 KB Output is correct
18 Correct 4 ms 18784 KB Output is correct
19 Correct 4 ms 18780 KB Output is correct
20 Correct 4 ms 18884 KB Output is correct
21 Correct 4 ms 18776 KB Output is correct
22 Correct 4 ms 18884 KB Output is correct
23 Correct 4 ms 18776 KB Output is correct
24 Correct 4 ms 18776 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 18780 KB Output is correct
2 Correct 5 ms 18780 KB Output is correct
3 Correct 4 ms 18780 KB Output is correct
4 Correct 5 ms 18780 KB Output is correct
5 Correct 4 ms 18872 KB Output is correct
6 Correct 5 ms 18780 KB Output is correct
7 Correct 4 ms 18780 KB Output is correct
8 Correct 5 ms 19036 KB Output is correct
9 Correct 4 ms 18780 KB Output is correct
10 Correct 4 ms 18776 KB Output is correct
11 Correct 4 ms 18780 KB Output is correct
12 Correct 4 ms 18780 KB Output is correct
13 Correct 5 ms 18780 KB Output is correct
14 Correct 5 ms 18948 KB Output is correct
15 Correct 4 ms 18932 KB Output is correct
16 Correct 4 ms 18780 KB Output is correct
17 Correct 4 ms 18780 KB Output is correct
18 Correct 4 ms 18784 KB Output is correct
19 Correct 4 ms 18780 KB Output is correct
20 Correct 4 ms 18884 KB Output is correct
21 Correct 4 ms 18776 KB Output is correct
22 Correct 4 ms 18884 KB Output is correct
23 Correct 4 ms 18776 KB Output is correct
24 Correct 4 ms 18776 KB Output is correct
25 Correct 73 ms 24768 KB Output is correct
26 Correct 14 ms 19804 KB Output is correct
27 Correct 105 ms 27324 KB Output is correct
28 Correct 136 ms 27472 KB Output is correct
29 Correct 73 ms 24780 KB Output is correct
30 Correct 74 ms 24676 KB Output is correct
31 Correct 80 ms 25940 KB Output is correct
32 Correct 113 ms 27388 KB Output is correct
33 Correct 97 ms 26704 KB Output is correct
34 Correct 58 ms 23124 KB Output is correct
35 Correct 114 ms 27152 KB Output is correct
36 Correct 108 ms 27532 KB Output is correct
37 Correct 63 ms 23384 KB Output is correct
38 Correct 107 ms 26588 KB Output is correct
39 Correct 19 ms 20100 KB Output is correct
40 Correct 108 ms 26452 KB Output is correct
41 Correct 78 ms 24496 KB Output is correct
42 Correct 123 ms 26612 KB Output is correct
43 Correct 39 ms 21592 KB Output is correct
44 Correct 112 ms 26588 KB Output is correct
45 Correct 23 ms 20304 KB Output is correct
46 Correct 106 ms 26628 KB Output is correct
47 Correct 31 ms 20824 KB Output is correct
48 Correct 111 ms 26708 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 46420 KB Output is correct
2 Correct 281 ms 48396 KB Output is correct
3 Correct 187 ms 42896 KB Output is correct
4 Correct 294 ms 48244 KB Output is correct
5 Correct 110 ms 32756 KB Output is correct
6 Correct 285 ms 48404 KB Output is correct
7 Correct 252 ms 45912 KB Output is correct
8 Correct 354 ms 48468 KB Output is correct
9 Correct 35 ms 23644 KB Output is correct
10 Correct 283 ms 48212 KB Output is correct
11 Correct 167 ms 35312 KB Output is correct
12 Correct 274 ms 48212 KB Output is correct
13 Correct 166 ms 46384 KB Output is correct
14 Correct 184 ms 46432 KB Output is correct
15 Correct 151 ms 46852 KB Output is correct
16 Correct 134 ms 47052 KB Output is correct
17 Correct 171 ms 46324 KB Output is correct
18 Correct 150 ms 46716 KB Output is correct
19 Correct 165 ms 46248 KB Output is correct
20 Correct 150 ms 46316 KB Output is correct
21 Correct 146 ms 46204 KB Output is correct
22 Correct 162 ms 46680 KB Output is correct
23 Correct 167 ms 46576 KB Output is correct
24 Correct 136 ms 46764 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 18780 KB Output is correct
2 Correct 5 ms 18780 KB Output is correct
3 Correct 4 ms 18780 KB Output is correct
4 Correct 5 ms 18780 KB Output is correct
5 Correct 4 ms 18872 KB Output is correct
6 Correct 5 ms 18780 KB Output is correct
7 Correct 4 ms 18780 KB Output is correct
8 Correct 5 ms 19036 KB Output is correct
9 Correct 4 ms 18780 KB Output is correct
10 Correct 4 ms 18776 KB Output is correct
11 Correct 4 ms 18780 KB Output is correct
12 Correct 4 ms 18780 KB Output is correct
13 Correct 5 ms 18780 KB Output is correct
14 Correct 5 ms 18948 KB Output is correct
15 Correct 4 ms 18932 KB Output is correct
16 Correct 4 ms 18780 KB Output is correct
17 Correct 4 ms 18780 KB Output is correct
18 Correct 4 ms 18784 KB Output is correct
19 Correct 4 ms 18780 KB Output is correct
20 Correct 4 ms 18884 KB Output is correct
21 Correct 4 ms 18776 KB Output is correct
22 Correct 4 ms 18884 KB Output is correct
23 Correct 4 ms 18776 KB Output is correct
24 Correct 4 ms 18776 KB Output is correct
25 Correct 73 ms 24768 KB Output is correct
26 Correct 14 ms 19804 KB Output is correct
27 Correct 105 ms 27324 KB Output is correct
28 Correct 136 ms 27472 KB Output is correct
29 Correct 73 ms 24780 KB Output is correct
30 Correct 74 ms 24676 KB Output is correct
31 Correct 80 ms 25940 KB Output is correct
32 Correct 113 ms 27388 KB Output is correct
33 Correct 97 ms 26704 KB Output is correct
34 Correct 58 ms 23124 KB Output is correct
35 Correct 114 ms 27152 KB Output is correct
36 Correct 108 ms 27532 KB Output is correct
37 Correct 63 ms 23384 KB Output is correct
38 Correct 107 ms 26588 KB Output is correct
39 Correct 19 ms 20100 KB Output is correct
40 Correct 108 ms 26452 KB Output is correct
41 Correct 78 ms 24496 KB Output is correct
42 Correct 123 ms 26612 KB Output is correct
43 Correct 39 ms 21592 KB Output is correct
44 Correct 112 ms 26588 KB Output is correct
45 Correct 23 ms 20304 KB Output is correct
46 Correct 106 ms 26628 KB Output is correct
47 Correct 31 ms 20824 KB Output is correct
48 Correct 111 ms 26708 KB Output is correct
49 Correct 276 ms 46420 KB Output is correct
50 Correct 281 ms 48396 KB Output is correct
51 Correct 187 ms 42896 KB Output is correct
52 Correct 294 ms 48244 KB Output is correct
53 Correct 110 ms 32756 KB Output is correct
54 Correct 285 ms 48404 KB Output is correct
55 Correct 252 ms 45912 KB Output is correct
56 Correct 354 ms 48468 KB Output is correct
57 Correct 35 ms 23644 KB Output is correct
58 Correct 283 ms 48212 KB Output is correct
59 Correct 167 ms 35312 KB Output is correct
60 Correct 274 ms 48212 KB Output is correct
61 Correct 166 ms 46384 KB Output is correct
62 Correct 184 ms 46432 KB Output is correct
63 Correct 151 ms 46852 KB Output is correct
64 Correct 134 ms 47052 KB Output is correct
65 Correct 171 ms 46324 KB Output is correct
66 Correct 150 ms 46716 KB Output is correct
67 Correct 165 ms 46248 KB Output is correct
68 Correct 150 ms 46316 KB Output is correct
69 Correct 146 ms 46204 KB Output is correct
70 Correct 162 ms 46680 KB Output is correct
71 Correct 167 ms 46576 KB Output is correct
72 Correct 136 ms 46764 KB Output is correct
73 Correct 487 ms 53780 KB Output is correct
74 Correct 291 ms 48980 KB Output is correct
75 Correct 382 ms 52480 KB Output is correct
76 Correct 536 ms 58108 KB Output is correct
77 Correct 269 ms 39692 KB Output is correct
78 Correct 465 ms 54884 KB Output is correct
79 Correct 459 ms 55636 KB Output is correct
80 Correct 539 ms 57940 KB Output is correct
81 Correct 189 ms 32340 KB Output is correct
82 Correct 420 ms 53024 KB Output is correct
83 Correct 419 ms 44880 KB Output is correct
84 Correct 530 ms 58016 KB Output is correct
85 Correct 295 ms 51196 KB Output is correct
86 Correct 362 ms 55024 KB Output is correct
87 Correct 195 ms 48024 KB Output is correct
88 Correct 385 ms 55688 KB Output is correct
89 Correct 367 ms 52676 KB Output is correct
90 Correct 379 ms 55160 KB Output is correct
91 Correct 245 ms 49304 KB Output is correct
92 Correct 374 ms 54736 KB Output is correct
93 Correct 187 ms 47800 KB Output is correct
94 Correct 401 ms 55320 KB Output is correct
95 Correct 223 ms 48728 KB Output is correct
96 Correct 365 ms 55712 KB Output is correct