oj.uz

Submission #947834

# Submission time Handle Problem Language Result Execution time Memory
947834 2024-03-17T05:49:27 Z phoenix0423 Two Antennas (JOI19_antennas) C++17
13 / 100
 264 ms 76628 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];
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 3 ms 14680 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 6 ms 14684 KB Output is correct
5 Correct 3 ms 14684 KB Output is correct
6 Correct 3 ms 14684 KB Output is correct
7 Correct 5 ms 14684 KB Output is correct
8 Correct 3 ms 14684 KB Output is correct
9 Correct 3 ms 14684 KB Output is correct
10 Correct 5 ms 14684 KB Output is correct
11 Correct 3 ms 14936 KB Output is correct
12 Correct 3 ms 14684 KB Output is correct
13 Correct 3 ms 14684 KB Output is correct
14 Correct 4 ms 14684 KB Output is correct
15 Correct 3 ms 14680 KB Output is correct
16 Correct 3 ms 14684 KB Output is correct
17 Correct 3 ms 14684 KB Output is correct
18 Correct 3 ms 14684 KB Output is correct
19 Correct 3 ms 14856 KB Output is correct
20 Correct 3 ms 14872 KB Output is correct
21 Correct 3 ms 14684 KB Output is correct
22 Correct 3 ms 14684 KB Output is correct
23 Correct 5 ms 14684 KB Output is correct
24 Correct 3 ms 14684 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 6 ms 14684 KB Output is correct
5 Correct 3 ms 14684 KB Output is correct
6 Correct 3 ms 14684 KB Output is correct
7 Correct 5 ms 14684 KB Output is correct
8 Correct 3 ms 14684 KB Output is correct
9 Correct 3 ms 14684 KB Output is correct
10 Correct 5 ms 14684 KB Output is correct
11 Correct 3 ms 14936 KB Output is correct
12 Correct 3 ms 14684 KB Output is correct
13 Correct 3 ms 14684 KB Output is correct
14 Correct 4 ms 14684 KB Output is correct
15 Correct 3 ms 14680 KB Output is correct
16 Correct 3 ms 14684 KB Output is correct
17 Correct 3 ms 14684 KB Output is correct
18 Correct 3 ms 14684 KB Output is correct
19 Correct 3 ms 14856 KB Output is correct
20 Correct 3 ms 14872 KB Output is correct
21 Correct 3 ms 14684 KB Output is correct
22 Correct 3 ms 14684 KB Output is correct
23 Correct 5 ms 14684 KB Output is correct
24 Correct 3 ms 14684 KB Output is correct
25 Correct 72 ms 20816 KB Output is correct
26 Correct 13 ms 15704 KB Output is correct
27 Correct 103 ms 23380 KB Output is correct
28 Correct 107 ms 23292 KB Output is correct
29 Correct 72 ms 20820 KB Output is correct
30 Correct 72 ms 20564 KB Output is correct
31 Correct 80 ms 21844 KB Output is correct
32 Correct 106 ms 23220 KB Output is correct
33 Correct 96 ms 22756 KB Output is correct
34 Correct 56 ms 19028 KB Output is correct
35 Correct 104 ms 23124 KB Output is correct
36 Correct 108 ms 23380 KB Output is correct
37 Correct 62 ms 19284 KB Output is correct
38 Correct 116 ms 22612 KB Output is correct
39 Correct 19 ms 15960 KB Output is correct
40 Correct 107 ms 22492 KB Output is correct
41 Correct 76 ms 20460 KB Output is correct
42 Correct 113 ms 22612 KB Output is correct
43 Correct 38 ms 17256 KB Output is correct
44 Correct 106 ms 22356 KB Output is correct
45 Correct 21 ms 16172 KB Output is correct
46 Correct 110 ms 22508 KB Output is correct
47 Correct 30 ms 16732 KB Output is correct
48 Correct 105 ms 22356 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Runtime error 264 ms 76628 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 6 ms 14684 KB Output is correct
5 Correct 3 ms 14684 KB Output is correct
6 Correct 3 ms 14684 KB Output is correct
7 Correct 5 ms 14684 KB Output is correct
8 Correct 3 ms 14684 KB Output is correct
9 Correct 3 ms 14684 KB Output is correct
10 Correct 5 ms 14684 KB Output is correct
11 Correct 3 ms 14936 KB Output is correct
12 Correct 3 ms 14684 KB Output is correct
13 Correct 3 ms 14684 KB Output is correct
14 Correct 4 ms 14684 KB Output is correct
15 Correct 3 ms 14680 KB Output is correct
16 Correct 3 ms 14684 KB Output is correct
17 Correct 3 ms 14684 KB Output is correct
18 Correct 3 ms 14684 KB Output is correct
19 Correct 3 ms 14856 KB Output is correct
20 Correct 3 ms 14872 KB Output is correct
21 Correct 3 ms 14684 KB Output is correct
22 Correct 3 ms 14684 KB Output is correct
23 Correct 5 ms 14684 KB Output is correct
24 Correct 3 ms 14684 KB Output is correct
25 Correct 72 ms 20816 KB Output is correct
26 Correct 13 ms 15704 KB Output is correct
27 Correct 103 ms 23380 KB Output is correct
28 Correct 107 ms 23292 KB Output is correct
29 Correct 72 ms 20820 KB Output is correct
30 Correct 72 ms 20564 KB Output is correct
31 Correct 80 ms 21844 KB Output is correct
32 Correct 106 ms 23220 KB Output is correct
33 Correct 96 ms 22756 KB Output is correct
34 Correct 56 ms 19028 KB Output is correct
35 Correct 104 ms 23124 KB Output is correct
36 Correct 108 ms 23380 KB Output is correct
37 Correct 62 ms 19284 KB Output is correct
38 Correct 116 ms 22612 KB Output is correct
39 Correct 19 ms 15960 KB Output is correct
40 Correct 107 ms 22492 KB Output is correct
41 Correct 76 ms 20460 KB Output is correct
42 Correct 113 ms 22612 KB Output is correct
43 Correct 38 ms 17256 KB Output is correct
44 Correct 106 ms 22356 KB Output is correct
45 Correct 21 ms 16172 KB Output is correct
46 Correct 110 ms 22508 KB Output is correct
47 Correct 30 ms 16732 KB Output is correct
48 Correct 105 ms 22356 KB Output is correct
49 Runtime error 264 ms 76628 KB Execution killed with signal 6
50 Halted 0 ms 0 KB -