oj.uz

Submission #897311

# Submission time Handle Problem Language Result Execution time Memory
897311 2024-01-02T21:40:42 Z ttamx Two Antennas (JOI19_antennas) C++14
100 / 100
 505 ms 45196 KB 
#include<bits/stdc++.h>

using namespace std;

const int N=2e5+5;
const int K=1<<19;
const int INF=1e9+7;

int n,q;
int h[N],a[N],b[N];
int ql[N],qr[N],ans[N];
vector<int> qrs[N],add[N],del[N];

struct Segtree{
    struct Node{
        int mx,mn,ans;
        Node():mx(-INF),mn(INF),ans(-1){}
        Node(int h):mx(h),mn(h),ans(-1){}
        friend Node operator+(const Node &lhs,const Node &rhs){
           Node res;
           res.mx=max(lhs.mx,rhs.mx);
           res.mn=min(lhs.mn,rhs.mn);
           res.ans=max(lhs.ans,rhs.ans);
           return res;
        }
    }t[K];
    struct Tag{
        int mx,mn;
        Tag():mx(-INF),mn(INF){}
        Tag(int h):mx(h),mn(h){}
        Tag &operator+=(const Tag &rhs){
            mx=max(mx,rhs.mx);
            mn=min(mn,rhs.mn);
            return *this;
        }
    }lz[K];
    void push(int l,int r,int i){
        t[i].ans=max(t[i].ans,lz[i].mx-t[i].mn);
        t[i].ans=max(t[i].ans,t[i].mx-lz[i].mn);
        if(l<r){
            lz[i*2]+=lz[i];
            lz[i*2+1]+=lz[i];
        }
        lz[i]=Tag();
    }
    void update(int l,int r,int i,int x,int y,int v){
        push(l,r,i);
        if(y<l||r<x)return;
        if(x<=l&&r<=y)return lz[i]=v,push(l,r,i);
        int m=(l+r)/2;
        update(l,m,i*2,x,y,v);
        update(m+1,r,i*2+1,x,y,v);
        t[i]=t[i*2]+t[i*2+1];
    }
    void update(int x,int y,int v){
        update(1,n,1,x,y,v);
    }
    void modify(int l,int r,int i,int x,const Node &v){
        push(l,r,i);
        if(x<l||r<x)return;
        if(l==r)return t[i].mx=v.mx,t[i].mn=v.mn,void();
        int m=(l+r)/2;
        modify(l,m,i*2,x,v);
        modify(m+1,r,i*2+1,x,v);
        t[i]=t[i*2]+t[i*2+1];
    }
    void modify(int x,const Node &v){
        modify(1,n,1,x,v);
    }
    int query(int l,int r,int i,int x,int y){
        push(l,r,i);
        if(y<l||r<x)return -1;
        if(x<=l&&r<=y)return t[i].ans;
        int m=(l+r)/2;
        return max(query(l,m,i*2,x,y),query(m+1,r,i*2+1,x,y));
    }
    int query(int x,int y){
        return query(1,n,1,x,y);
    }
}s;

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n;
    for(int i=1;i<=n;i++){
        cin >> h[i] >> a[i] >> b[i];
        int l=i+a[i],r=i+b[i];
        if(l<=n)add[l].emplace_back(i);
        if(r<=n)del[r].emplace_back(i);
    }
    cin >> q;
    for(int i=1;i<=q;i++){
        cin >> ql[i] >> qr[i];
        qrs[qr[i]].emplace_back(i);
    }
    for(int i=1;i<=n;i++){
        for(auto j:add[i])s.modify(j,Segtree::Node(h[j]));
        s.update(i-b[i],i-a[i],h[i]);
        for(auto j:qrs[i])ans[j]=s.query(ql[j],qr[j]);
        for(auto j:del[i])s.modify(j,Segtree::Node());
    }
    for(int i=1;i<=q;i++)cout << ans[i] << "\n";
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 29276 KB Output is correct
2 Correct 6 ms 29348 KB Output is correct
3 Correct 6 ms 29276 KB Output is correct
4 Correct 6 ms 29272 KB Output is correct
5 Correct 6 ms 29276 KB Output is correct
6 Correct 6 ms 29276 KB Output is correct
7 Correct 6 ms 29276 KB Output is correct
8 Correct 7 ms 29276 KB Output is correct
9 Correct 6 ms 29276 KB Output is correct
10 Correct 7 ms 29276 KB Output is correct
11 Correct 6 ms 29276 KB Output is correct
12 Correct 6 ms 29276 KB Output is correct
13 Correct 6 ms 29272 KB Output is correct
14 Correct 6 ms 29276 KB Output is correct
15 Correct 6 ms 29364 KB Output is correct
16 Correct 6 ms 29276 KB Output is correct
17 Correct 6 ms 29276 KB Output is correct
18 Correct 6 ms 29276 KB Output is correct
19 Correct 6 ms 29276 KB Output is correct
20 Correct 6 ms 29380 KB Output is correct
21 Correct 6 ms 29276 KB Output is correct
22 Correct 7 ms 29276 KB Output is correct
23 Correct 6 ms 29276 KB Output is correct
24 Correct 6 ms 29276 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 29276 KB Output is correct
2 Correct 6 ms 29348 KB Output is correct
3 Correct 6 ms 29276 KB Output is correct
4 Correct 6 ms 29272 KB Output is correct
5 Correct 6 ms 29276 KB Output is correct
6 Correct 6 ms 29276 KB Output is correct
7 Correct 6 ms 29276 KB Output is correct
8 Correct 7 ms 29276 KB Output is correct
9 Correct 6 ms 29276 KB Output is correct
10 Correct 7 ms 29276 KB Output is correct
11 Correct 6 ms 29276 KB Output is correct
12 Correct 6 ms 29276 KB Output is correct
13 Correct 6 ms 29272 KB Output is correct
14 Correct 6 ms 29276 KB Output is correct
15 Correct 6 ms 29364 KB Output is correct
16 Correct 6 ms 29276 KB Output is correct
17 Correct 6 ms 29276 KB Output is correct
18 Correct 6 ms 29276 KB Output is correct
19 Correct 6 ms 29276 KB Output is correct
20 Correct 6 ms 29380 KB Output is correct
21 Correct 6 ms 29276 KB Output is correct
22 Correct 7 ms 29276 KB Output is correct
23 Correct 6 ms 29276 KB Output is correct
24 Correct 6 ms 29276 KB Output is correct
25 Correct 72 ms 32656 KB Output is correct
26 Correct 17 ms 29788 KB Output is correct
27 Correct 94 ms 34176 KB Output is correct
28 Correct 96 ms 34032 KB Output is correct
29 Correct 64 ms 32596 KB Output is correct
30 Correct 72 ms 32616 KB Output is correct
31 Correct 74 ms 33508 KB Output is correct
32 Correct 95 ms 34128 KB Output is correct
33 Correct 94 ms 33772 KB Output is correct
34 Correct 51 ms 31664 KB Output is correct
35 Correct 99 ms 34128 KB Output is correct
36 Correct 95 ms 34132 KB Output is correct
37 Correct 66 ms 31420 KB Output is correct
38 Correct 94 ms 33104 KB Output is correct
39 Correct 22 ms 29788 KB Output is correct
40 Correct 94 ms 33240 KB Output is correct
41 Correct 71 ms 32144 KB Output is correct
42 Correct 110 ms 33364 KB Output is correct
43 Correct 36 ms 30420 KB Output is correct
44 Correct 92 ms 33144 KB Output is correct
45 Correct 22 ms 29952 KB Output is correct
46 Correct 94 ms 33100 KB Output is correct
47 Correct 29 ms 30296 KB Output is correct
48 Correct 93 ms 33104 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 219 ms 32612 KB Output is correct
2 Correct 313 ms 37716 KB Output is correct
3 Correct 163 ms 34940 KB Output is correct
4 Correct 255 ms 37460 KB Output is correct
5 Correct 119 ms 32680 KB Output is correct
6 Correct 246 ms 37456 KB Output is correct
7 Correct 216 ms 36364 KB Output is correct
8 Correct 282 ms 37716 KB Output is correct
9 Correct 36 ms 30556 KB Output is correct
10 Correct 250 ms 37552 KB Output is correct
11 Correct 148 ms 34308 KB Output is correct
12 Correct 257 ms 37544 KB Output is correct
13 Correct 173 ms 35084 KB Output is correct
14 Correct 161 ms 35180 KB Output is correct
15 Correct 165 ms 35260 KB Output is correct
16 Correct 138 ms 35432 KB Output is correct
17 Correct 177 ms 35072 KB Output is correct
18 Correct 167 ms 35444 KB Output is correct
19 Correct 157 ms 34784 KB Output is correct
20 Correct 167 ms 35176 KB Output is correct
21 Correct 161 ms 34948 KB Output is correct
22 Correct 172 ms 35256 KB Output is correct
23 Correct 163 ms 34940 KB Output is correct
24 Correct 139 ms 34996 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 29276 KB Output is correct
2 Correct 6 ms 29348 KB Output is correct
3 Correct 6 ms 29276 KB Output is correct
4 Correct 6 ms 29272 KB Output is correct
5 Correct 6 ms 29276 KB Output is correct
6 Correct 6 ms 29276 KB Output is correct
7 Correct 6 ms 29276 KB Output is correct
8 Correct 7 ms 29276 KB Output is correct
9 Correct 6 ms 29276 KB Output is correct
10 Correct 7 ms 29276 KB Output is correct
11 Correct 6 ms 29276 KB Output is correct
12 Correct 6 ms 29276 KB Output is correct
13 Correct 6 ms 29272 KB Output is correct
14 Correct 6 ms 29276 KB Output is correct
15 Correct 6 ms 29364 KB Output is correct
16 Correct 6 ms 29276 KB Output is correct
17 Correct 6 ms 29276 KB Output is correct
18 Correct 6 ms 29276 KB Output is correct
19 Correct 6 ms 29276 KB Output is correct
20 Correct 6 ms 29380 KB Output is correct
21 Correct 6 ms 29276 KB Output is correct
22 Correct 7 ms 29276 KB Output is correct
23 Correct 6 ms 29276 KB Output is correct
24 Correct 6 ms 29276 KB Output is correct
25 Correct 72 ms 32656 KB Output is correct
26 Correct 17 ms 29788 KB Output is correct
27 Correct 94 ms 34176 KB Output is correct
28 Correct 96 ms 34032 KB Output is correct
29 Correct 64 ms 32596 KB Output is correct
30 Correct 72 ms 32616 KB Output is correct
31 Correct 74 ms 33508 KB Output is correct
32 Correct 95 ms 34128 KB Output is correct
33 Correct 94 ms 33772 KB Output is correct
34 Correct 51 ms 31664 KB Output is correct
35 Correct 99 ms 34128 KB Output is correct
36 Correct 95 ms 34132 KB Output is correct
37 Correct 66 ms 31420 KB Output is correct
38 Correct 94 ms 33104 KB Output is correct
39 Correct 22 ms 29788 KB Output is correct
40 Correct 94 ms 33240 KB Output is correct
41 Correct 71 ms 32144 KB Output is correct
42 Correct 110 ms 33364 KB Output is correct
43 Correct 36 ms 30420 KB Output is correct
44 Correct 92 ms 33144 KB Output is correct
45 Correct 22 ms 29952 KB Output is correct
46 Correct 94 ms 33100 KB Output is correct
47 Correct 29 ms 30296 KB Output is correct
48 Correct 93 ms 33104 KB Output is correct
49 Correct 219 ms 32612 KB Output is correct
50 Correct 313 ms 37716 KB Output is correct
51 Correct 163 ms 34940 KB Output is correct
52 Correct 255 ms 37460 KB Output is correct
53 Correct 119 ms 32680 KB Output is correct
54 Correct 246 ms 37456 KB Output is correct
55 Correct 216 ms 36364 KB Output is correct
56 Correct 282 ms 37716 KB Output is correct
57 Correct 36 ms 30556 KB Output is correct
58 Correct 250 ms 37552 KB Output is correct
59 Correct 148 ms 34308 KB Output is correct
60 Correct 257 ms 37544 KB Output is correct
61 Correct 173 ms 35084 KB Output is correct
62 Correct 161 ms 35180 KB Output is correct
63 Correct 165 ms 35260 KB Output is correct
64 Correct 138 ms 35432 KB Output is correct
65 Correct 177 ms 35072 KB Output is correct
66 Correct 167 ms 35444 KB Output is correct
67 Correct 157 ms 34784 KB Output is correct
68 Correct 167 ms 35176 KB Output is correct
69 Correct 161 ms 34948 KB Output is correct
70 Correct 172 ms 35256 KB Output is correct
71 Correct 163 ms 34940 KB Output is correct
72 Correct 139 ms 34996 KB Output is correct
73 Correct 401 ms 42652 KB Output is correct
74 Correct 277 ms 38224 KB Output is correct
75 Correct 372 ms 42132 KB Output is correct
76 Correct 505 ms 45192 KB Output is correct
77 Correct 230 ms 37868 KB Output is correct
78 Correct 403 ms 43084 KB Output is correct
79 Correct 463 ms 43768 KB Output is correct
80 Correct 484 ms 45188 KB Output is correct
81 Correct 177 ms 36120 KB Output is correct
82 Correct 351 ms 41552 KB Output is correct
83 Correct 392 ms 41200 KB Output is correct
84 Correct 456 ms 45196 KB Output is correct
85 Correct 283 ms 39364 KB Output is correct
86 Correct 357 ms 41720 KB Output is correct
87 Correct 192 ms 36324 KB Output is correct
88 Correct 341 ms 42220 KB Output is correct
89 Correct 311 ms 40296 KB Output is correct
90 Correct 358 ms 42268 KB Output is correct
91 Correct 256 ms 37624 KB Output is correct
92 Correct 336 ms 41504 KB Output is correct
93 Correct 203 ms 36288 KB Output is correct
94 Correct 360 ms 41804 KB Output is correct
95 Correct 214 ms 36988 KB Output is correct
96 Correct 329 ms 41680 KB Output is correct