oj.uz

Submission #861940

# Submission time Handle Problem Language Result Execution time Memory
861940 2023-10-17T08:17:20 Z winter0101 Two Antennas (JOI19_antennas) C++17
100 / 100
 446 ms 65956 KB 
#include<bits/stdc++.h>
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
const int maxn=2e5+9;
int h[maxn],a[maxn],b[maxn];
vector<pii>ask[maxn];
long long ans[maxn];
const long long inf=1e9+7;
long long lazymin[maxn*4],lazymax[maxn*4],mn[maxn*4],mx[maxn*4],best[maxn*4];
void build(int id,int l,int r){
lazymin[id]=inf;
lazymax[id]=-inf;
mn[id]=inf;
mx[id]=-inf;
best[id]=-1;
if (l==r)return;
int mid=(l+r)/2;
build(id*2,l,mid);
build(id*2+1,mid+1,r);
}
void push(int id){
if (lazymin[id]<inf){
lazymin[id*2]=min(lazymin[id*2],lazymin[id]);
lazymin[id*2+1]=min(lazymin[id*2+1],lazymin[id]);
lazymin[id]=inf;
}
if (lazymax[id]>-inf){
lazymax[id*2]=max(lazymax[id*2],lazymax[id]);
lazymax[id*2+1]=max(lazymax[id*2+1],lazymax[id]);
lazymax[id]=-inf;
}
best[id*2]=max({best[id*2],lazymax[id*2]-mn[id*2],mx[id*2]-lazymin[id*2]});
best[id*2+1]=max({best[id*2+1],lazymax[id*2+1]-mn[id*2+1],mx[id*2+1]-lazymin[id*2+1]});
}
void updatepoint(int id,int l,int r,int u,int val1,int val2){
if (l>u||r<u){
return;
}
if (l==r){
best[id]=max({best[id],-mn[id]+lazymax[id],-lazymin[id]+mx[id]});
lazymin[id]=1e9+7;
lazymax[id]=-1e9+7;
mn[id]=val1;
mx[id]=val2;
return;
}
push(id);
int mid=(l+r)/2;
updatepoint(id*2,l,mid,u,val1,val2);
updatepoint(id*2+1,mid+1,r,u,val1,val2);
best[id]=max({best[id],best[id*2],best[id*2+1]});
mn[id]=min(mn[id*2],mn[id*2+1]);
mx[id]=max(mx[id*2],mx[id*2+1]);
}
void updaterange(int id,int l,int r,int u,int v,long long val){
if (l>v||r<u||u>v)return;
if (u<=l&&r<=v){
lazymax[id]=max(lazymax[id],val);
lazymin[id]=min(lazymin[id],val);
best[id]=max({best[id],-mn[id]+lazymax[id],-lazymin[id]+mx[id]});
return;
}
int mid=(l+r)/2;
push(id);
updaterange(id*2,l,mid,u,v,val);
updaterange(id*2+1,mid+1,r,u,v,val);
best[id]=max({best[id],best[id*2],best[id*2+1]});
}
long long get(int id,int l,int r,int u,int v){
if (l>v||r<u||u>v)return -1;
if (u<=l&&r<=v)return best[id];
int mid=(l+r)/2;
push(id);
return max(get(id*2,l,mid,u,v),get(id*2+1,mid+1,r,u,v));
}
vector<int>add[maxn];
vector<int>del[maxn];
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen("temp.INP","r",stdin);
    //freopen("temp.OUT","w",stdout);
    int n;
    cin>>n;
    for1(i,1,n)cin>>h[i]>>a[i]>>b[i];
    int q;
    cin>>q;
    for1(i,1,q){
    int l,r;
    cin>>l>>r;
    ask[r].pb({l,i});
    ans[i]=-1;
    }
    for1(i,1,n){
    if (i+a[i]<=n){
    add[i+a[i]].pb(i);
    }
    if (i+b[i]<=n){
    del[i+b[i]+1].pb(i);
    }
    }
    build(1,1,n);
    for1(i,1,n){
    for (auto v:add[i]){
    updatepoint(1,1,n,v,h[v],h[v]);
    }
    for (auto v:del[i]){
    updatepoint(1,1,n,v,inf,-inf);
    }
    int l=max(1,i-b[i]),r=i-a[i];
    if (l<=r){
    updaterange(1,1,n,l,r,h[i]);
    }
    for (auto v:ask[i]){
    ans[v.se]=get(1,1,n,v.fi,i);
    }
    }
    for1(i,1,q)cout<<ans[i]<<'\n';
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 27292 KB Output is correct
2 Correct 5 ms 27228 KB Output is correct
3 Correct 5 ms 27300 KB Output is correct
4 Correct 5 ms 27228 KB Output is correct
5 Correct 5 ms 27228 KB Output is correct
6 Correct 5 ms 27340 KB Output is correct
7 Correct 5 ms 27352 KB Output is correct
8 Correct 5 ms 27228 KB Output is correct
9 Correct 5 ms 27228 KB Output is correct
10 Correct 5 ms 27228 KB Output is correct
11 Correct 5 ms 27224 KB Output is correct
12 Correct 5 ms 27228 KB Output is correct
13 Correct 5 ms 27228 KB Output is correct
14 Correct 5 ms 27228 KB Output is correct
15 Correct 5 ms 27300 KB Output is correct
16 Correct 5 ms 27228 KB Output is correct
17 Correct 5 ms 27228 KB Output is correct
18 Correct 5 ms 27228 KB Output is correct
19 Correct 4 ms 27228 KB Output is correct
20 Correct 5 ms 27228 KB Output is correct
21 Correct 5 ms 27228 KB Output is correct
22 Correct 5 ms 27228 KB Output is correct
23 Correct 5 ms 27228 KB Output is correct
24 Correct 5 ms 27228 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 27292 KB Output is correct
2 Correct 5 ms 27228 KB Output is correct
3 Correct 5 ms 27300 KB Output is correct
4 Correct 5 ms 27228 KB Output is correct
5 Correct 5 ms 27228 KB Output is correct
6 Correct 5 ms 27340 KB Output is correct
7 Correct 5 ms 27352 KB Output is correct
8 Correct 5 ms 27228 KB Output is correct
9 Correct 5 ms 27228 KB Output is correct
10 Correct 5 ms 27228 KB Output is correct
11 Correct 5 ms 27224 KB Output is correct
12 Correct 5 ms 27228 KB Output is correct
13 Correct 5 ms 27228 KB Output is correct
14 Correct 5 ms 27228 KB Output is correct
15 Correct 5 ms 27300 KB Output is correct
16 Correct 5 ms 27228 KB Output is correct
17 Correct 5 ms 27228 KB Output is correct
18 Correct 5 ms 27228 KB Output is correct
19 Correct 4 ms 27228 KB Output is correct
20 Correct 5 ms 27228 KB Output is correct
21 Correct 5 ms 27228 KB Output is correct
22 Correct 5 ms 27228 KB Output is correct
23 Correct 5 ms 27228 KB Output is correct
24 Correct 5 ms 27228 KB Output is correct
25 Correct 64 ms 31404 KB Output is correct
26 Correct 12 ms 27820 KB Output is correct
27 Correct 82 ms 33216 KB Output is correct
28 Correct 82 ms 33284 KB Output is correct
29 Correct 60 ms 31608 KB Output is correct
30 Correct 58 ms 31316 KB Output is correct
31 Correct 62 ms 32336 KB Output is correct
32 Correct 85 ms 33268 KB Output is correct
33 Correct 75 ms 32824 KB Output is correct
34 Correct 43 ms 30036 KB Output is correct
35 Correct 77 ms 33104 KB Output is correct
36 Correct 82 ms 33284 KB Output is correct
37 Correct 50 ms 30288 KB Output is correct
38 Correct 80 ms 32336 KB Output is correct
39 Correct 16 ms 27992 KB Output is correct
40 Correct 82 ms 32340 KB Output is correct
41 Correct 63 ms 31256 KB Output is correct
42 Correct 102 ms 32336 KB Output is correct
43 Correct 30 ms 29008 KB Output is correct
44 Correct 79 ms 32440 KB Output is correct
45 Correct 19 ms 27996 KB Output is correct
46 Correct 90 ms 32520 KB Output is correct
47 Correct 24 ms 28636 KB Output is correct
48 Correct 79 ms 32336 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 56664 KB Output is correct
2 Correct 201 ms 57904 KB Output is correct
3 Correct 120 ms 54672 KB Output is correct
4 Correct 191 ms 57824 KB Output is correct
5 Correct 74 ms 41812 KB Output is correct
6 Correct 188 ms 57748 KB Output is correct
7 Correct 164 ms 56400 KB Output is correct
8 Correct 192 ms 57584 KB Output is correct
9 Correct 26 ms 28776 KB Output is correct
10 Correct 215 ms 57768 KB Output is correct
11 Correct 118 ms 43604 KB Output is correct
12 Correct 230 ms 57816 KB Output is correct
13 Correct 135 ms 55252 KB Output is correct
14 Correct 115 ms 55292 KB Output is correct
15 Correct 116 ms 55524 KB Output is correct
16 Correct 106 ms 55884 KB Output is correct
17 Correct 140 ms 55480 KB Output is correct
18 Correct 116 ms 55916 KB Output is correct
19 Correct 122 ms 55212 KB Output is correct
20 Correct 115 ms 55440 KB Output is correct
21 Correct 121 ms 55252 KB Output is correct
22 Correct 144 ms 55520 KB Output is correct
23 Correct 118 ms 55244 KB Output is correct
24 Correct 112 ms 55432 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 27292 KB Output is correct
2 Correct 5 ms 27228 KB Output is correct
3 Correct 5 ms 27300 KB Output is correct
4 Correct 5 ms 27228 KB Output is correct
5 Correct 5 ms 27228 KB Output is correct
6 Correct 5 ms 27340 KB Output is correct
7 Correct 5 ms 27352 KB Output is correct
8 Correct 5 ms 27228 KB Output is correct
9 Correct 5 ms 27228 KB Output is correct
10 Correct 5 ms 27228 KB Output is correct
11 Correct 5 ms 27224 KB Output is correct
12 Correct 5 ms 27228 KB Output is correct
13 Correct 5 ms 27228 KB Output is correct
14 Correct 5 ms 27228 KB Output is correct
15 Correct 5 ms 27300 KB Output is correct
16 Correct 5 ms 27228 KB Output is correct
17 Correct 5 ms 27228 KB Output is correct
18 Correct 5 ms 27228 KB Output is correct
19 Correct 4 ms 27228 KB Output is correct
20 Correct 5 ms 27228 KB Output is correct
21 Correct 5 ms 27228 KB Output is correct
22 Correct 5 ms 27228 KB Output is correct
23 Correct 5 ms 27228 KB Output is correct
24 Correct 5 ms 27228 KB Output is correct
25 Correct 64 ms 31404 KB Output is correct
26 Correct 12 ms 27820 KB Output is correct
27 Correct 82 ms 33216 KB Output is correct
28 Correct 82 ms 33284 KB Output is correct
29 Correct 60 ms 31608 KB Output is correct
30 Correct 58 ms 31316 KB Output is correct
31 Correct 62 ms 32336 KB Output is correct
32 Correct 85 ms 33268 KB Output is correct
33 Correct 75 ms 32824 KB Output is correct
34 Correct 43 ms 30036 KB Output is correct
35 Correct 77 ms 33104 KB Output is correct
36 Correct 82 ms 33284 KB Output is correct
37 Correct 50 ms 30288 KB Output is correct
38 Correct 80 ms 32336 KB Output is correct
39 Correct 16 ms 27992 KB Output is correct
40 Correct 82 ms 32340 KB Output is correct
41 Correct 63 ms 31256 KB Output is correct
42 Correct 102 ms 32336 KB Output is correct
43 Correct 30 ms 29008 KB Output is correct
44 Correct 79 ms 32440 KB Output is correct
45 Correct 19 ms 27996 KB Output is correct
46 Correct 90 ms 32520 KB Output is correct
47 Correct 24 ms 28636 KB Output is correct
48 Correct 79 ms 32336 KB Output is correct
49 Correct 185 ms 56664 KB Output is correct
50 Correct 201 ms 57904 KB Output is correct
51 Correct 120 ms 54672 KB Output is correct
52 Correct 191 ms 57824 KB Output is correct
53 Correct 74 ms 41812 KB Output is correct
54 Correct 188 ms 57748 KB Output is correct
55 Correct 164 ms 56400 KB Output is correct
56 Correct 192 ms 57584 KB Output is correct
57 Correct 26 ms 28776 KB Output is correct
58 Correct 215 ms 57768 KB Output is correct
59 Correct 118 ms 43604 KB Output is correct
60 Correct 230 ms 57816 KB Output is correct
61 Correct 135 ms 55252 KB Output is correct
62 Correct 115 ms 55292 KB Output is correct
63 Correct 116 ms 55524 KB Output is correct
64 Correct 106 ms 55884 KB Output is correct
65 Correct 140 ms 55480 KB Output is correct
66 Correct 116 ms 55916 KB Output is correct
67 Correct 122 ms 55212 KB Output is correct
68 Correct 115 ms 55440 KB Output is correct
69 Correct 121 ms 55252 KB Output is correct
70 Correct 144 ms 55520 KB Output is correct
71 Correct 118 ms 55244 KB Output is correct
72 Correct 112 ms 55432 KB Output is correct
73 Correct 302 ms 63060 KB Output is correct
74 Correct 209 ms 58452 KB Output is correct
75 Correct 303 ms 62572 KB Output is correct
76 Correct 368 ms 65956 KB Output is correct
77 Correct 174 ms 47444 KB Output is correct
78 Correct 297 ms 63372 KB Output is correct
79 Correct 333 ms 64304 KB Output is correct
80 Correct 415 ms 65948 KB Output is correct
81 Correct 131 ms 35300 KB Output is correct
82 Correct 274 ms 61984 KB Output is correct
83 Correct 273 ms 51284 KB Output is correct
84 Correct 446 ms 65876 KB Output is correct
85 Correct 224 ms 59768 KB Output is correct
86 Correct 285 ms 62324 KB Output is correct
87 Correct 141 ms 56656 KB Output is correct
88 Correct 333 ms 63060 KB Output is correct
89 Correct 252 ms 60680 KB Output is correct
90 Correct 274 ms 63232 KB Output is correct
91 Correct 179 ms 57676 KB Output is correct
92 Correct 278 ms 62748 KB Output is correct
93 Correct 141 ms 56636 KB Output is correct
94 Correct 279 ms 62468 KB Output is correct
95 Correct 172 ms 57436 KB Output is correct
96 Correct 260 ms 62460 KB Output is correct