oj.uz

Submission #861062

# Submission time Handle Problem Language Result Execution time Memory
861062 2023-10-15T08:34:34 Z yeediot Two Antennas (JOI19_antennas) C++17
100 / 100
 564 ms 63828 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
//Don't open the standings during contests.
const int mxn=2e5+5;
vector<pii>ask(mxn);
vector<int>add2[mxn];
vector<int>remove2[mxn];
vector<int>add[mxn];
vector<int>remov[mxn];
vector<int>h(mxn),a(mxn),b(mxn),ans(mxn);
set<int>nowq;
int mx[4*mxn],mn[4*mxn],val[4*mxn],tag[4*mxn];
void clear(int l,int r,int id){
    if(l==r){
        mx[id]=-8e18;
        mn[id]=-8e18;
        val[id]=-8e18;
        return;
    }
    int mm=l+r>>1;
    clear(l,mm,id*2);
    clear(mm+1,r,id*2+1);
    mx[id]=-8e18;
    mn[id]=-8e18;
    val[id]=-8e18;
}
void upd(int id,int v){
    chmax(mn[id],v);
    val[id]=max(val[id],mn[id]+mx[id]);
}
void push(int id){
    if(mn[id]==-8e18)return;
    upd(id*2,mn[id]);
    upd(id*2+1,mn[id]);
    mn[id]=-8e18;
}
void modify(int l,int r,int id,int p,int v){
    if(l==r){
        mn[id]=-8e18;
        mx[id]=v;
        return;
    }
    push(id);
    int mm=l+r>>1;
    if(p<=mm) modify(l,mm,id*2,p,v);
    else modify(mm+1,r,id*2+1,p,v);
    mx[id]=max(mx[id*2],mx[id*2+1]);
    val[id]=max(val[id*2],val[id*2+1]);
}
void q_modify(int l,int r,int id,int ql,int qr,int v){
    if(ql>qr)return;
    if(ql<=l and r<=qr){
        upd(id,v);
        return;
    }
    push(id);
    int mm=l+r>>1;
    if(qr<=mm){
        q_modify(l,mm,id*2,ql,qr,v);
    }
    else if(ql>mm){
        q_modify(mm+1,r,id*2+1,ql,qr,v);
    }
    else{
        q_modify(l,mm,id*2,ql,mm,v);
        q_modify(mm+1,r,id*2+1,mm+1,qr,v);
    }
    mx[id]=max(mx[id*2],mx[id*2+1]);
    val[id]=max(val[id*2],val[id*2+1]);
}
int query(int l,int r,int id,int ql,int qr){
    if(ql<=l and r<=qr){
        return val[id];
    }
    push(id);
    int mm=l+r>>1;
    if(qr<=mm){
        return query(l,mm,id*2,ql,qr);
    }
    else if(ql>mm){
        return query(mm+1,r,id*2+1,ql,qr);
    }
    else{
        int a=query(l,mm,id*2,ql,mm);
        int b=query(mm+1,r,id*2+1,mm+1,qr);
        return max(a,b);
    }
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n;
    cin>>n;
    int change=0;
    for(int i=1;i<=n;i++){
        cin>>h[i]>>a[i]>>b[i];
        chmax(change,h[i]);
    }
    int q;
    cin>>q;
    for(int i=1;i<=q;i++){
        ans[i]=-1;
        int l,r;
        cin>>l>>r;
        ask[i]={l,r};
        add2[r].pb(i);
    }
    clear(1,n,1);
    for(int i=1;i<=n;i++){
        for(auto j:add[i]){
            modify(1,n,1,j,h[j]);
        }
        if(i+a[i]<=n)add[i+a[i]].pb(i);
        if(i+b[i]<=n)remov[i+b[i]].pb(i);
        q_modify(1,n,1,max(i-b[i],1LL),i-a[i],-h[i]);
        for(auto j:add2[i]){
            chmax(ans[j],query(1,n,1,ask[j].F,i));
        }
        for(auto j:remov[i])modify(1,n,1,j,-8e18);
    }
    clear(1,n,1);
    for(int i=1;i<=n;i++){
        h[i]=1e9-h[i]+1;
    }
    for(int i=1;i<=n;i++){
        for(auto j:add[i]){
            modify(1,n,1,j,h[j]);
        }
        q_modify(1,n,1,max(i-b[i],1LL),i-a[i],-h[i]);
        for(auto j:add2[i]){
            chmax(ans[j],query(1,n,1,ask[j].F,i));
        }
        for(auto j:remov[i])modify(1,n,1,j,-8e18);
    }
    for(int i=1;i<=q;i++)cout<<ans[i]<<'\n';
}
 /*
 input:
 
  掃描線
  從1掃到N
  如果當前有詢問
  chmax(ans[j],max(h[i]-min(i-a[i]~i-b[i]),max(i-a[i]~i-b[i]-h[i]));
 */

Compilation message

antennas.cpp: In function 'void clear(long long int, long long int, long long int)':
antennas.cpp:32:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   32 |     int mm=l+r>>1;
      |            ~^~
antennas.cpp: In function 'void modify(long long int, long long int, long long int, long long int, long long int)':
antennas.cpp:56:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   56 |     int mm=l+r>>1;
      |            ~^~
antennas.cpp: In function 'void q_modify(long long int, long long int, long long int, long long int, long long int, long long int)':
antennas.cpp:69:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   69 |     int mm=l+r>>1;
      |            ~^~
antennas.cpp: In function 'long long int query(long long int, long long int, long long int, long long int, long long int)':
antennas.cpp:88:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   88 |     int mm=l+r>>1;
      |            ~^~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 34904 KB Output is correct
2 Correct 9 ms 34888 KB Output is correct
3 Correct 9 ms 34916 KB Output is correct
4 Correct 9 ms 34908 KB Output is correct
5 Correct 9 ms 34908 KB Output is correct
6 Correct 8 ms 34904 KB Output is correct
7 Correct 9 ms 34908 KB Output is correct
8 Correct 8 ms 35076 KB Output is correct
9 Correct 9 ms 34908 KB Output is correct
10 Correct 9 ms 35012 KB Output is correct
11 Correct 9 ms 34904 KB Output is correct
12 Correct 9 ms 34908 KB Output is correct
13 Correct 9 ms 35076 KB Output is correct
14 Correct 9 ms 34904 KB Output is correct
15 Correct 9 ms 34908 KB Output is correct
16 Correct 9 ms 34908 KB Output is correct
17 Correct 9 ms 34908 KB Output is correct
18 Correct 9 ms 35032 KB Output is correct
19 Correct 8 ms 34908 KB Output is correct
20 Correct 9 ms 34876 KB Output is correct
21 Correct 9 ms 34908 KB Output is correct
22 Correct 9 ms 34908 KB Output is correct
23 Correct 8 ms 34908 KB Output is correct
24 Correct 8 ms 34948 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 34904 KB Output is correct
2 Correct 9 ms 34888 KB Output is correct
3 Correct 9 ms 34916 KB Output is correct
4 Correct 9 ms 34908 KB Output is correct
5 Correct 9 ms 34908 KB Output is correct
6 Correct 8 ms 34904 KB Output is correct
7 Correct 9 ms 34908 KB Output is correct
8 Correct 8 ms 35076 KB Output is correct
9 Correct 9 ms 34908 KB Output is correct
10 Correct 9 ms 35012 KB Output is correct
11 Correct 9 ms 34904 KB Output is correct
12 Correct 9 ms 34908 KB Output is correct
13 Correct 9 ms 35076 KB Output is correct
14 Correct 9 ms 34904 KB Output is correct
15 Correct 9 ms 34908 KB Output is correct
16 Correct 9 ms 34908 KB Output is correct
17 Correct 9 ms 34908 KB Output is correct
18 Correct 9 ms 35032 KB Output is correct
19 Correct 8 ms 34908 KB Output is correct
20 Correct 9 ms 34876 KB Output is correct
21 Correct 9 ms 34908 KB Output is correct
22 Correct 9 ms 34908 KB Output is correct
23 Correct 8 ms 34908 KB Output is correct
24 Correct 8 ms 34948 KB Output is correct
25 Correct 76 ms 37924 KB Output is correct
26 Correct 19 ms 35404 KB Output is correct
27 Correct 110 ms 39252 KB Output is correct
28 Correct 120 ms 39252 KB Output is correct
29 Correct 76 ms 37968 KB Output is correct
30 Correct 75 ms 37712 KB Output is correct
31 Correct 83 ms 38740 KB Output is correct
32 Correct 113 ms 39252 KB Output is correct
33 Correct 97 ms 38992 KB Output is correct
34 Correct 56 ms 37028 KB Output is correct
35 Correct 125 ms 39252 KB Output is correct
36 Correct 108 ms 39256 KB Output is correct
37 Correct 78 ms 36688 KB Output is correct
38 Correct 110 ms 38224 KB Output is correct
39 Correct 23 ms 35416 KB Output is correct
40 Correct 127 ms 38300 KB Output is correct
41 Correct 78 ms 37200 KB Output is correct
42 Correct 130 ms 38228 KB Output is correct
43 Correct 40 ms 35972 KB Output is correct
44 Correct 104 ms 38324 KB Output is correct
45 Correct 25 ms 35420 KB Output is correct
46 Correct 110 ms 38340 KB Output is correct
47 Correct 33 ms 35720 KB Output is correct
48 Correct 106 ms 38168 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 50516 KB Output is correct
2 Correct 244 ms 50996 KB Output is correct
3 Correct 175 ms 50004 KB Output is correct
4 Correct 266 ms 50924 KB Output is correct
5 Correct 100 ms 42880 KB Output is correct
6 Correct 288 ms 51028 KB Output is correct
7 Correct 209 ms 50404 KB Output is correct
8 Correct 296 ms 50768 KB Output is correct
9 Correct 36 ms 37668 KB Output is correct
10 Correct 258 ms 50936 KB Output is correct
11 Correct 151 ms 43492 KB Output is correct
12 Correct 253 ms 50768 KB Output is correct
13 Correct 179 ms 49272 KB Output is correct
14 Correct 151 ms 49440 KB Output is correct
15 Correct 141 ms 49224 KB Output is correct
16 Correct 160 ms 50072 KB Output is correct
17 Correct 150 ms 49520 KB Output is correct
18 Correct 141 ms 49840 KB Output is correct
19 Correct 143 ms 49176 KB Output is correct
20 Correct 141 ms 49472 KB Output is correct
21 Correct 147 ms 49220 KB Output is correct
22 Correct 181 ms 49376 KB Output is correct
23 Correct 149 ms 49392 KB Output is correct
24 Correct 125 ms 49252 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 34904 KB Output is correct
2 Correct 9 ms 34888 KB Output is correct
3 Correct 9 ms 34916 KB Output is correct
4 Correct 9 ms 34908 KB Output is correct
5 Correct 9 ms 34908 KB Output is correct
6 Correct 8 ms 34904 KB Output is correct
7 Correct 9 ms 34908 KB Output is correct
8 Correct 8 ms 35076 KB Output is correct
9 Correct 9 ms 34908 KB Output is correct
10 Correct 9 ms 35012 KB Output is correct
11 Correct 9 ms 34904 KB Output is correct
12 Correct 9 ms 34908 KB Output is correct
13 Correct 9 ms 35076 KB Output is correct
14 Correct 9 ms 34904 KB Output is correct
15 Correct 9 ms 34908 KB Output is correct
16 Correct 9 ms 34908 KB Output is correct
17 Correct 9 ms 34908 KB Output is correct
18 Correct 9 ms 35032 KB Output is correct
19 Correct 8 ms 34908 KB Output is correct
20 Correct 9 ms 34876 KB Output is correct
21 Correct 9 ms 34908 KB Output is correct
22 Correct 9 ms 34908 KB Output is correct
23 Correct 8 ms 34908 KB Output is correct
24 Correct 8 ms 34948 KB Output is correct
25 Correct 76 ms 37924 KB Output is correct
26 Correct 19 ms 35404 KB Output is correct
27 Correct 110 ms 39252 KB Output is correct
28 Correct 120 ms 39252 KB Output is correct
29 Correct 76 ms 37968 KB Output is correct
30 Correct 75 ms 37712 KB Output is correct
31 Correct 83 ms 38740 KB Output is correct
32 Correct 113 ms 39252 KB Output is correct
33 Correct 97 ms 38992 KB Output is correct
34 Correct 56 ms 37028 KB Output is correct
35 Correct 125 ms 39252 KB Output is correct
36 Correct 108 ms 39256 KB Output is correct
37 Correct 78 ms 36688 KB Output is correct
38 Correct 110 ms 38224 KB Output is correct
39 Correct 23 ms 35416 KB Output is correct
40 Correct 127 ms 38300 KB Output is correct
41 Correct 78 ms 37200 KB Output is correct
42 Correct 130 ms 38228 KB Output is correct
43 Correct 40 ms 35972 KB Output is correct
44 Correct 104 ms 38324 KB Output is correct
45 Correct 25 ms 35420 KB Output is correct
46 Correct 110 ms 38340 KB Output is correct
47 Correct 33 ms 35720 KB Output is correct
48 Correct 106 ms 38168 KB Output is correct
49 Correct 234 ms 50516 KB Output is correct
50 Correct 244 ms 50996 KB Output is correct
51 Correct 175 ms 50004 KB Output is correct
52 Correct 266 ms 50924 KB Output is correct
53 Correct 100 ms 42880 KB Output is correct
54 Correct 288 ms 51028 KB Output is correct
55 Correct 209 ms 50404 KB Output is correct
56 Correct 296 ms 50768 KB Output is correct
57 Correct 36 ms 37668 KB Output is correct
58 Correct 258 ms 50936 KB Output is correct
59 Correct 151 ms 43492 KB Output is correct
60 Correct 253 ms 50768 KB Output is correct
61 Correct 179 ms 49272 KB Output is correct
62 Correct 151 ms 49440 KB Output is correct
63 Correct 141 ms 49224 KB Output is correct
64 Correct 160 ms 50072 KB Output is correct
65 Correct 150 ms 49520 KB Output is correct
66 Correct 141 ms 49840 KB Output is correct
67 Correct 143 ms 49176 KB Output is correct
68 Correct 141 ms 49472 KB Output is correct
69 Correct 147 ms 49220 KB Output is correct
70 Correct 181 ms 49376 KB Output is correct
71 Correct 149 ms 49392 KB Output is correct
72 Correct 125 ms 49252 KB Output is correct
73 Correct 444 ms 60848 KB Output is correct
74 Correct 283 ms 56328 KB Output is correct
75 Correct 400 ms 60888 KB Output is correct
76 Correct 541 ms 63828 KB Output is correct
77 Correct 259 ms 50460 KB Output is correct
78 Correct 446 ms 61264 KB Output is correct
79 Correct 532 ms 62376 KB Output is correct
80 Correct 564 ms 63684 KB Output is correct
81 Correct 180 ms 44880 KB Output is correct
82 Correct 395 ms 59728 KB Output is correct
83 Correct 418 ms 54096 KB Output is correct
84 Correct 553 ms 63700 KB Output is correct
85 Correct 303 ms 58008 KB Output is correct
86 Correct 358 ms 61208 KB Output is correct
87 Correct 193 ms 54940 KB Output is correct
88 Correct 350 ms 61520 KB Output is correct
89 Correct 334 ms 59368 KB Output is correct
90 Correct 403 ms 61556 KB Output is correct
91 Correct 236 ms 56256 KB Output is correct
92 Correct 374 ms 61208 KB Output is correct
93 Correct 191 ms 55084 KB Output is correct
94 Correct 358 ms 61036 KB Output is correct
95 Correct 236 ms 55892 KB Output is correct
96 Correct 421 ms 60912 KB Output is correct