oj.uz

답안 #897316

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
897316 2024-01-02T21:43:40 Z ttamx Two Antennas (JOI19_antennas) C++14
100 / 100
 507 ms 38228 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,int v){
        push(l,r,i);
        if(x<l||r<x)return;
        if(l==r){
            t[i].mn=v?h[l]:INF;
            t[i].mx=v?h[l]:-INF;
            return;
        }
        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,int 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,1);
        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,0);
    }
    for(int i=1;i<=q;i++)cout << ans[i] << "\n";
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 29272 KB Output is correct
2 Correct 6 ms 29272 KB Output is correct
3 Correct 6 ms 29272 KB Output is correct
4 Correct 6 ms 29272 KB Output is correct
5 Correct 7 ms 29276 KB Output is correct
6 Correct 7 ms 29132 KB Output is correct
7 Correct 6 ms 29276 KB Output is correct
8 Correct 6 ms 29604 KB Output is correct
9 Correct 6 ms 29276 KB Output is correct
10 Correct 6 ms 29132 KB Output is correct
11 Correct 6 ms 29128 KB Output is correct
12 Correct 6 ms 29276 KB Output is correct
13 Correct 6 ms 29276 KB Output is correct
14 Correct 6 ms 29276 KB Output is correct
15 Correct 6 ms 29276 KB Output is correct
16 Correct 7 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 29364 KB Output is correct
20 Correct 6 ms 29276 KB Output is correct
21 Correct 6 ms 29272 KB Output is correct
22 Correct 6 ms 29276 KB Output is correct
23 Correct 6 ms 29272 KB Output is correct
24 Correct 6 ms 29276 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 29272 KB Output is correct
2 Correct 6 ms 29272 KB Output is correct
3 Correct 6 ms 29272 KB Output is correct
4 Correct 6 ms 29272 KB Output is correct
5 Correct 7 ms 29276 KB Output is correct
6 Correct 7 ms 29132 KB Output is correct
7 Correct 6 ms 29276 KB Output is correct
8 Correct 6 ms 29604 KB Output is correct
9 Correct 6 ms 29276 KB Output is correct
10 Correct 6 ms 29132 KB Output is correct
11 Correct 6 ms 29128 KB Output is correct
12 Correct 6 ms 29276 KB Output is correct
13 Correct 6 ms 29276 KB Output is correct
14 Correct 6 ms 29276 KB Output is correct
15 Correct 6 ms 29276 KB Output is correct
16 Correct 7 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 29364 KB Output is correct
20 Correct 6 ms 29276 KB Output is correct
21 Correct 6 ms 29272 KB Output is correct
22 Correct 6 ms 29276 KB Output is correct
23 Correct 6 ms 29272 KB Output is correct
24 Correct 6 ms 29276 KB Output is correct
25 Correct 69 ms 31316 KB Output is correct
26 Correct 15 ms 29528 KB Output is correct
27 Correct 94 ms 32208 KB Output is correct
28 Correct 95 ms 32180 KB Output is correct
29 Correct 71 ms 31324 KB Output is correct
30 Correct 66 ms 31316 KB Output is correct
31 Correct 73 ms 31824 KB Output is correct
32 Correct 97 ms 32340 KB Output is correct
33 Correct 91 ms 32028 KB Output is correct
34 Correct 52 ms 30548 KB Output is correct
35 Correct 90 ms 32336 KB Output is correct
36 Correct 95 ms 32340 KB Output is correct
37 Correct 58 ms 30396 KB Output is correct
38 Correct 94 ms 31364 KB Output is correct
39 Correct 19 ms 29528 KB Output is correct
40 Correct 95 ms 31388 KB Output is correct
41 Correct 74 ms 30804 KB Output is correct
42 Correct 104 ms 31376 KB Output is correct
43 Correct 35 ms 30064 KB Output is correct
44 Correct 96 ms 31328 KB Output is correct
45 Correct 22 ms 29528 KB Output is correct
46 Correct 93 ms 31388 KB Output is correct
47 Correct 29 ms 29964 KB Output is correct
48 Correct 100 ms 31404 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 290 ms 32608 KB Output is correct
2 Correct 254 ms 32860 KB Output is correct
3 Correct 171 ms 31680 KB Output is correct
4 Correct 286 ms 32988 KB Output is correct
5 Correct 106 ms 30964 KB Output is correct
6 Correct 270 ms 33008 KB Output is correct
7 Correct 227 ms 32464 KB Output is correct
8 Correct 281 ms 32936 KB Output is correct
9 Correct 40 ms 29784 KB Output is correct
10 Correct 272 ms 32848 KB Output is correct
11 Correct 156 ms 31548 KB Output is correct
12 Correct 264 ms 33068 KB Output is correct
13 Correct 190 ms 30660 KB Output is correct
14 Correct 170 ms 30724 KB Output is correct
15 Correct 164 ms 30784 KB Output is correct
16 Correct 145 ms 31056 KB Output is correct
17 Correct 180 ms 30644 KB Output is correct
18 Correct 167 ms 31060 KB Output is correct
19 Correct 177 ms 30280 KB Output is correct
20 Correct 164 ms 30772 KB Output is correct
21 Correct 172 ms 30532 KB Output is correct
22 Correct 173 ms 30800 KB Output is correct
23 Correct 177 ms 30420 KB Output is correct
24 Correct 141 ms 30668 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 29272 KB Output is correct
2 Correct 6 ms 29272 KB Output is correct
3 Correct 6 ms 29272 KB Output is correct
4 Correct 6 ms 29272 KB Output is correct
5 Correct 7 ms 29276 KB Output is correct
6 Correct 7 ms 29132 KB Output is correct
7 Correct 6 ms 29276 KB Output is correct
8 Correct 6 ms 29604 KB Output is correct
9 Correct 6 ms 29276 KB Output is correct
10 Correct 6 ms 29132 KB Output is correct
11 Correct 6 ms 29128 KB Output is correct
12 Correct 6 ms 29276 KB Output is correct
13 Correct 6 ms 29276 KB Output is correct
14 Correct 6 ms 29276 KB Output is correct
15 Correct 6 ms 29276 KB Output is correct
16 Correct 7 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 29364 KB Output is correct
20 Correct 6 ms 29276 KB Output is correct
21 Correct 6 ms 29272 KB Output is correct
22 Correct 6 ms 29276 KB Output is correct
23 Correct 6 ms 29272 KB Output is correct
24 Correct 6 ms 29276 KB Output is correct
25 Correct 69 ms 31316 KB Output is correct
26 Correct 15 ms 29528 KB Output is correct
27 Correct 94 ms 32208 KB Output is correct
28 Correct 95 ms 32180 KB Output is correct
29 Correct 71 ms 31324 KB Output is correct
30 Correct 66 ms 31316 KB Output is correct
31 Correct 73 ms 31824 KB Output is correct
32 Correct 97 ms 32340 KB Output is correct
33 Correct 91 ms 32028 KB Output is correct
34 Correct 52 ms 30548 KB Output is correct
35 Correct 90 ms 32336 KB Output is correct
36 Correct 95 ms 32340 KB Output is correct
37 Correct 58 ms 30396 KB Output is correct
38 Correct 94 ms 31364 KB Output is correct
39 Correct 19 ms 29528 KB Output is correct
40 Correct 95 ms 31388 KB Output is correct
41 Correct 74 ms 30804 KB Output is correct
42 Correct 104 ms 31376 KB Output is correct
43 Correct 35 ms 30064 KB Output is correct
44 Correct 96 ms 31328 KB Output is correct
45 Correct 22 ms 29528 KB Output is correct
46 Correct 93 ms 31388 KB Output is correct
47 Correct 29 ms 29964 KB Output is correct
48 Correct 100 ms 31404 KB Output is correct
49 Correct 290 ms 32608 KB Output is correct
50 Correct 254 ms 32860 KB Output is correct
51 Correct 171 ms 31680 KB Output is correct
52 Correct 286 ms 32988 KB Output is correct
53 Correct 106 ms 30964 KB Output is correct
54 Correct 270 ms 33008 KB Output is correct
55 Correct 227 ms 32464 KB Output is correct
56 Correct 281 ms 32936 KB Output is correct
57 Correct 40 ms 29784 KB Output is correct
58 Correct 272 ms 32848 KB Output is correct
59 Correct 156 ms 31548 KB Output is correct
60 Correct 264 ms 33068 KB Output is correct
61 Correct 190 ms 30660 KB Output is correct
62 Correct 170 ms 30724 KB Output is correct
63 Correct 164 ms 30784 KB Output is correct
64 Correct 145 ms 31056 KB Output is correct
65 Correct 180 ms 30644 KB Output is correct
66 Correct 167 ms 31060 KB Output is correct
67 Correct 177 ms 30280 KB Output is correct
68 Correct 164 ms 30772 KB Output is correct
69 Correct 172 ms 30532 KB Output is correct
70 Correct 173 ms 30800 KB Output is correct
71 Correct 177 ms 30420 KB Output is correct
72 Correct 141 ms 30668 KB Output is correct
73 Correct 443 ms 36504 KB Output is correct
74 Correct 324 ms 33368 KB Output is correct
75 Correct 365 ms 36436 KB Output is correct
76 Correct 507 ms 38228 KB Output is correct
77 Correct 273 ms 34132 KB Output is correct
78 Correct 384 ms 36816 KB Output is correct
79 Correct 418 ms 37256 KB Output is correct
80 Correct 504 ms 38068 KB Output is correct
81 Correct 169 ms 33360 KB Output is correct
82 Correct 386 ms 35832 KB Output is correct
83 Correct 331 ms 36140 KB Output is correct
84 Correct 485 ms 38064 KB Output is correct
85 Correct 320 ms 33208 KB Output is correct
86 Correct 354 ms 34752 KB Output is correct
87 Correct 197 ms 31556 KB Output is correct
88 Correct 318 ms 35248 KB Output is correct
89 Correct 321 ms 34000 KB Output is correct
90 Correct 375 ms 35240 KB Output is correct
91 Correct 235 ms 32312 KB Output is correct
92 Correct 388 ms 34640 KB Output is correct
93 Correct 215 ms 31452 KB Output is correct
94 Correct 365 ms 34736 KB Output is correct
95 Correct 233 ms 31916 KB Output is correct
96 Correct 319 ms 34660 KB Output is correct