oj.uz

Submission #298805

# Submission time Handle Problem Language Result Execution time Memory
298805 2020-09-14T05:38:57 Z YJU Two Antennas (JOI19_antennas) C++14
100 / 100
 1237 ms 97912 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=4e5+5;
const ll K=350;
const ld pi=3.14159265359;
const ll INF=(1LL<<40);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

ll seg[4*N],ma[4*N],val[4*N];
ll n,q,L[N],R[N],h[N],a[N],b[N],ans[N];
vector<ll> add[N],rem[N],Q[N];

void push(ll id,ll l,ll r){
	val[id]=max(val[id],ma[id]+seg[id]);
	if(l!=r-1){
		ma[id*2]=max(ma[id*2],ma[id]);
		ma[id*2+1]=max(ma[id*2+1],ma[id]);
	}
	ma[id]=-INF;
}

void ins(ll id,ll l,ll r,ll to,ll vl){
	push(id,l,r);
	if(l==r-1){
		seg[id]=vl;val[id]=max(val[id],ma[id]+seg[id]);
		return ;
	}
	ll mid=(l+r)/2;
	if(to<mid){
		ins(id*2,l,mid,to,vl);
	}else{
		ins(id*2+1,mid,r,to,vl);
	}
    val[id]=max({val[id],val[id*2],val[id*2+1]});
    seg[id]=max(seg[id*2],seg[id*2+1]);
}

void upd(ll id,ll l,ll r,ll ql,ll qr,ll vl){
	push(id,l,r);
	if(l>=ql&&r<=qr){ma[id]=vl;push(id,l,r);return ;}
	if(l>=qr||r<=ql)return ;
	ll mid=(l+r)/2;
    upd(id*2,l,mid,ql,qr,vl);
    upd(id*2+1,mid,r,ql,qr,vl);
	val[id]=max(val[id],max(val[id*2],val[id*2+1]));
}

ll query(ll id,ll l,ll r,ll ql,ll qr){
	push(id,l,r);
    if(l>=ql&&r<=qr)return val[id];
    if(l>=qr||r<=ql)return -INF;
    ll mid=(l+r)/2;
    return max(query(id*2,l,mid,ql,qr),query(id*2+1,mid,r,ql,qr));
}

void solve(){
    //reset
    REP(i,4*N)ma[i]=seg[i]=val[i]=-INF;
    //end
	REP1(i,n){
        for(auto j:add[i])ins(1,1,n+1,j,-h[j]);
        for(auto j:rem[i])ins(1,1,n+1,j,-INF);
        ll tmpl=max(1LL,i-b[i]),tmpr=max(1LL,i-a[i]+1);
        upd(1,1,n+1,tmpl,tmpr,h[i]);
        for(auto j:Q[i])ans[j]=max(ans[j],query(1,1,n+1,L[j],R[j]+1));
	}
}

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n;
	REP1(i,n){
		cin>>h[i]>>a[i]>>b[i];
        add[i+a[i]].pb(i);
        rem[i+b[i]+1].pb(i);
	}
	cin>>q;
	REP1(i,q){
		cin>>L[i]>>R[i];
        Q[R[i]].pb(i);
        ans[i]=-INF;
	}
	solve();
	REP1(i,n)h[i]=-h[i];
	solve();
	REP1(i,q){
		cout<<(ans[i]<0?-1:ans[i])<<"\n";
	}
	return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 66168 KB Output is correct
2 Correct 46 ms 66168 KB Output is correct
3 Correct 46 ms 66168 KB Output is correct
4 Correct 48 ms 66200 KB Output is correct
5 Correct 48 ms 66168 KB Output is correct
6 Correct 46 ms 66144 KB Output is correct
7 Correct 46 ms 66168 KB Output is correct
8 Correct 46 ms 66364 KB Output is correct
9 Correct 46 ms 66168 KB Output is correct
10 Correct 46 ms 66176 KB Output is correct
11 Correct 46 ms 66176 KB Output is correct
12 Correct 45 ms 66168 KB Output is correct
13 Correct 46 ms 66168 KB Output is correct
14 Correct 46 ms 66168 KB Output is correct
15 Correct 46 ms 66168 KB Output is correct
16 Correct 45 ms 66168 KB Output is correct
17 Correct 46 ms 66168 KB Output is correct
18 Correct 45 ms 66172 KB Output is correct
19 Correct 46 ms 66168 KB Output is correct
20 Correct 46 ms 66168 KB Output is correct
21 Correct 46 ms 66168 KB Output is correct
22 Correct 45 ms 66176 KB Output is correct
23 Correct 46 ms 66168 KB Output is correct
24 Correct 45 ms 66168 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 66168 KB Output is correct
2 Correct 46 ms 66168 KB Output is correct
3 Correct 46 ms 66168 KB Output is correct
4 Correct 48 ms 66200 KB Output is correct
5 Correct 48 ms 66168 KB Output is correct
6 Correct 46 ms 66144 KB Output is correct
7 Correct 46 ms 66168 KB Output is correct
8 Correct 46 ms 66364 KB Output is correct
9 Correct 46 ms 66168 KB Output is correct
10 Correct 46 ms 66176 KB Output is correct
11 Correct 46 ms 66176 KB Output is correct
12 Correct 45 ms 66168 KB Output is correct
13 Correct 46 ms 66168 KB Output is correct
14 Correct 46 ms 66168 KB Output is correct
15 Correct 46 ms 66168 KB Output is correct
16 Correct 45 ms 66168 KB Output is correct
17 Correct 46 ms 66168 KB Output is correct
18 Correct 45 ms 66172 KB Output is correct
19 Correct 46 ms 66168 KB Output is correct
20 Correct 46 ms 66168 KB Output is correct
21 Correct 46 ms 66168 KB Output is correct
22 Correct 45 ms 66176 KB Output is correct
23 Correct 46 ms 66168 KB Output is correct
24 Correct 45 ms 66168 KB Output is correct
25 Correct 200 ms 73848 KB Output is correct
26 Correct 65 ms 67192 KB Output is correct
27 Correct 281 ms 76924 KB Output is correct
28 Correct 278 ms 77176 KB Output is correct
29 Correct 197 ms 73848 KB Output is correct
30 Correct 193 ms 73336 KB Output is correct
31 Correct 216 ms 76024 KB Output is correct
32 Correct 287 ms 76920 KB Output is correct
33 Correct 256 ms 76280 KB Output is correct
34 Correct 153 ms 71672 KB Output is correct
35 Correct 277 ms 76820 KB Output is correct
36 Correct 283 ms 76920 KB Output is correct
37 Correct 187 ms 71928 KB Output is correct
38 Correct 283 ms 76024 KB Output is correct
39 Correct 77 ms 67836 KB Output is correct
40 Correct 275 ms 76024 KB Output is correct
41 Correct 208 ms 73336 KB Output is correct
42 Correct 276 ms 76024 KB Output is correct
43 Correct 115 ms 69496 KB Output is correct
44 Correct 281 ms 76152 KB Output is correct
45 Correct 83 ms 67960 KB Output is correct
46 Correct 275 ms 76028 KB Output is correct
47 Correct 100 ms 68728 KB Output is correct
48 Correct 296 ms 76152 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 571 ms 82936 KB Output is correct
2 Correct 633 ms 84728 KB Output is correct
3 Correct 418 ms 79224 KB Output is correct
4 Correct 624 ms 84856 KB Output is correct
5 Correct 267 ms 74744 KB Output is correct
6 Correct 611 ms 84856 KB Output is correct
7 Correct 519 ms 82296 KB Output is correct
8 Correct 623 ms 84856 KB Output is correct
9 Correct 105 ms 69112 KB Output is correct
10 Correct 638 ms 84856 KB Output is correct
11 Correct 361 ms 77996 KB Output is correct
12 Correct 627 ms 84856 KB Output is correct
13 Correct 380 ms 81904 KB Output is correct
14 Correct 355 ms 81600 KB Output is correct
15 Correct 352 ms 82160 KB Output is correct
16 Correct 297 ms 82756 KB Output is correct
17 Correct 383 ms 81724 KB Output is correct
18 Correct 343 ms 81864 KB Output is correct
19 Correct 364 ms 81516 KB Output is correct
20 Correct 353 ms 81896 KB Output is correct
21 Correct 348 ms 81636 KB Output is correct
22 Correct 354 ms 81768 KB Output is correct
23 Correct 360 ms 81648 KB Output is correct
24 Correct 306 ms 82284 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 66168 KB Output is correct
2 Correct 46 ms 66168 KB Output is correct
3 Correct 46 ms 66168 KB Output is correct
4 Correct 48 ms 66200 KB Output is correct
5 Correct 48 ms 66168 KB Output is correct
6 Correct 46 ms 66144 KB Output is correct
7 Correct 46 ms 66168 KB Output is correct
8 Correct 46 ms 66364 KB Output is correct
9 Correct 46 ms 66168 KB Output is correct
10 Correct 46 ms 66176 KB Output is correct
11 Correct 46 ms 66176 KB Output is correct
12 Correct 45 ms 66168 KB Output is correct
13 Correct 46 ms 66168 KB Output is correct
14 Correct 46 ms 66168 KB Output is correct
15 Correct 46 ms 66168 KB Output is correct
16 Correct 45 ms 66168 KB Output is correct
17 Correct 46 ms 66168 KB Output is correct
18 Correct 45 ms 66172 KB Output is correct
19 Correct 46 ms 66168 KB Output is correct
20 Correct 46 ms 66168 KB Output is correct
21 Correct 46 ms 66168 KB Output is correct
22 Correct 45 ms 66176 KB Output is correct
23 Correct 46 ms 66168 KB Output is correct
24 Correct 45 ms 66168 KB Output is correct
25 Correct 200 ms 73848 KB Output is correct
26 Correct 65 ms 67192 KB Output is correct
27 Correct 281 ms 76924 KB Output is correct
28 Correct 278 ms 77176 KB Output is correct
29 Correct 197 ms 73848 KB Output is correct
30 Correct 193 ms 73336 KB Output is correct
31 Correct 216 ms 76024 KB Output is correct
32 Correct 287 ms 76920 KB Output is correct
33 Correct 256 ms 76280 KB Output is correct
34 Correct 153 ms 71672 KB Output is correct
35 Correct 277 ms 76820 KB Output is correct
36 Correct 283 ms 76920 KB Output is correct
37 Correct 187 ms 71928 KB Output is correct
38 Correct 283 ms 76024 KB Output is correct
39 Correct 77 ms 67836 KB Output is correct
40 Correct 275 ms 76024 KB Output is correct
41 Correct 208 ms 73336 KB Output is correct
42 Correct 276 ms 76024 KB Output is correct
43 Correct 115 ms 69496 KB Output is correct
44 Correct 281 ms 76152 KB Output is correct
45 Correct 83 ms 67960 KB Output is correct
46 Correct 275 ms 76028 KB Output is correct
47 Correct 100 ms 68728 KB Output is correct
48 Correct 296 ms 76152 KB Output is correct
49 Correct 571 ms 82936 KB Output is correct
50 Correct 633 ms 84728 KB Output is correct
51 Correct 418 ms 79224 KB Output is correct
52 Correct 624 ms 84856 KB Output is correct
53 Correct 267 ms 74744 KB Output is correct
54 Correct 611 ms 84856 KB Output is correct
55 Correct 519 ms 82296 KB Output is correct
56 Correct 623 ms 84856 KB Output is correct
57 Correct 105 ms 69112 KB Output is correct
58 Correct 638 ms 84856 KB Output is correct
59 Correct 361 ms 77996 KB Output is correct
60 Correct 627 ms 84856 KB Output is correct
61 Correct 380 ms 81904 KB Output is correct
62 Correct 355 ms 81600 KB Output is correct
63 Correct 352 ms 82160 KB Output is correct
64 Correct 297 ms 82756 KB Output is correct
65 Correct 383 ms 81724 KB Output is correct
66 Correct 343 ms 81864 KB Output is correct
67 Correct 364 ms 81516 KB Output is correct
68 Correct 353 ms 81896 KB Output is correct
69 Correct 348 ms 81636 KB Output is correct
70 Correct 354 ms 81768 KB Output is correct
71 Correct 360 ms 81648 KB Output is correct
72 Correct 306 ms 82284 KB Output is correct
73 Correct 1022 ms 92792 KB Output is correct
74 Correct 682 ms 85928 KB Output is correct
75 Correct 940 ms 91760 KB Output is correct
76 Correct 1223 ms 97784 KB Output is correct
77 Correct 619 ms 83844 KB Output is correct
78 Correct 1016 ms 93688 KB Output is correct
79 Correct 1089 ms 95224 KB Output is correct
80 Correct 1198 ms 97912 KB Output is correct
81 Correct 466 ms 80432 KB Output is correct
82 Correct 916 ms 91516 KB Output is correct
83 Correct 902 ms 90208 KB Output is correct
84 Correct 1237 ms 97784 KB Output is correct
85 Correct 784 ms 89064 KB Output is correct
86 Correct 960 ms 93360 KB Output is correct
87 Correct 446 ms 83952 KB Output is correct
88 Correct 886 ms 94612 KB Output is correct
89 Correct 842 ms 90480 KB Output is correct
90 Correct 939 ms 93652 KB Output is correct
91 Correct 579 ms 85888 KB Output is correct
92 Correct 958 ms 93544 KB Output is correct
93 Correct 463 ms 83812 KB Output is correct
94 Correct 973 ms 93672 KB Output is correct
95 Correct 531 ms 84964 KB Output is correct
96 Correct 907 ms 94064 KB Output is correct