oj.uz

답안 #751959

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
751959 2023-06-01T23:53:10 Z grogu Two Antennas (JOI19_antennas) C++14
100 / 100
 1294 ms 55008 KB 
#define here cerr<<"===========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#include "bits/stdc++.h"
#define ld double
#define ll long long
#define llinf 1000000000000000000LL 
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) (ll)(a.size())
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {cerr<<#a<<": ";for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define cer(a) {cerr<<#a<<": ";for(ll x_ : a) cerr<<x_<< " ";cerr<<endl;}

using namespace std;

#define maxn 200005
ll n,q;
ll h[maxn],a[maxn],b[maxn];
pll v[maxn];
ll t[4*maxn],t2[4*maxn],lazy[4*maxn];
ll ans[maxn];
vector<pll> kv[maxn];
vector<ll> add[maxn],del[maxn];
ll ls[4*maxn],rs[4*maxn],tsz = 0,root = 0;
void init(ll &v,ll tl,ll tr){
  v = ++tsz;
  t[v] = t2[v] = lazy[v] = -llinf;
  if(tl==tr) return;
  ll mid = (tl+tr)/2;
  init(ls[v],tl,mid);
  init(rs[v],mid+1,tr);
}
void push(ll v){
  if(lazy[v]!=-llinf){
    t[v] = max(t[v],t2[v]+lazy[v]);
    if(ls[v]) lazy[ls[v]] = max(lazy[ls[v]],lazy[v]);
    if(rs[v]) lazy[rs[v]] = max(lazy[rs[v]],lazy[v]);
    lazy[v] = -llinf;
  }
}
void upd2(ll v,ll tl,ll tr,ll i,ll x){
  push(v);
  if(tl==tr){t2[v] = x;return;}
  ll mid = (tl+tr)/2;
  if(i<=mid) upd2(ls[v],tl,mid,i,x);
  else upd2(rs[v],mid+1,tr,i,x);
  t2[v] = max(t2[ls[v]],t2[rs[v]]);
}
void upd(ll v,ll tl,ll tr,ll l,ll r,ll x){
  push(v);
  if(tl>tr||r<tl||l>tr) return;
  if(tl>=l&&tr<=r){lazy[v] = x;push(v);return;}
  ll mid = (tl+tr)/2;
  upd(ls[v],tl,mid,l,r,x);
  upd(rs[v],mid+1,tr,l,r,x);
  t[v] = max(t[ls[v]],t[rs[v]]);
}
ll get(ll v,ll tl,ll tr,ll l,ll r){
  push(v);
  if(l>r) return -llinf;
  if(tl==l&&tr==r) return t[v];
  ll mid = (tl+tr)/2;
  return max(get(ls[v],tl,mid,l,min(mid,r)),get(rs[v],mid+1,tr,max(mid+1,l),r));
}
void solve(){
  init(root,1,n);
  for(ll i = 1;i<=n;i++){
    ll l = min(n+1,i+a[i]);
    ll r = min(n+1,i+b[i]);
    add[l].pb(i);
    del[r].pb(i);
    for(ll j : add[i]) upd2(root,1,n,j,h[j]);
    upd(root,1,n,i-b[i],i-a[i],-h[i]);
    for(pll p : kv[i]) ans[p.sc] = max(ans[p.sc],get(root,1,n,p.fi,i));
    for(ll j : del[i]) upd2(root,1,n,j,-llinf);
    add[i].clear();
    del[i].clear();
  }
  for(ll i = 0;i<=tsz;i++) rs[i] = ls[i] = 0;
  root = tsz = 0;
}
void tc(){
  cin >> n;
  for(ll i = 1;i<=n;i++) cin >> h[i] >> a[i] >> b[i];
  cin >> q;
  for(ll i = 1;i<=q;i++) cin >> v[i].fi >> v[i].sc;
  for(ll i = 1;i<=q;i++) kv[v[i].sc].pb({v[i].fi,i}),ans[i] = -1;
  solve();
  for(ll i = 1;i<=n;i++) h[i] = -h[i];
  solve();
  for(ll i = 1;i<=q;i++) cout<<ans[i]<<endl;
}
int main(){
  int t; t = 1;
  while(t--){
    tc();
  }
  return 0;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14420 KB Output is correct
2 Correct 9 ms 14536 KB Output is correct
3 Correct 8 ms 14484 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 9 ms 14404 KB Output is correct
6 Correct 9 ms 14496 KB Output is correct
7 Correct 8 ms 14404 KB Output is correct
8 Correct 9 ms 14420 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 8 ms 14404 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 9 ms 14420 KB Output is correct
14 Correct 9 ms 14488 KB Output is correct
15 Correct 9 ms 14420 KB Output is correct
16 Correct 8 ms 14420 KB Output is correct
17 Correct 9 ms 14400 KB Output is correct
18 Correct 10 ms 14420 KB Output is correct
19 Correct 9 ms 14488 KB Output is correct
20 Correct 8 ms 14468 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 10 ms 14408 KB Output is correct
23 Correct 9 ms 14404 KB Output is correct
24 Correct 10 ms 14424 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14420 KB Output is correct
2 Correct 9 ms 14536 KB Output is correct
3 Correct 8 ms 14484 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 9 ms 14404 KB Output is correct
6 Correct 9 ms 14496 KB Output is correct
7 Correct 8 ms 14404 KB Output is correct
8 Correct 9 ms 14420 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 8 ms 14404 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 9 ms 14420 KB Output is correct
14 Correct 9 ms 14488 KB Output is correct
15 Correct 9 ms 14420 KB Output is correct
16 Correct 8 ms 14420 KB Output is correct
17 Correct 9 ms 14400 KB Output is correct
18 Correct 10 ms 14420 KB Output is correct
19 Correct 9 ms 14488 KB Output is correct
20 Correct 8 ms 14468 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 10 ms 14408 KB Output is correct
23 Correct 9 ms 14404 KB Output is correct
24 Correct 10 ms 14424 KB Output is correct
25 Correct 132 ms 23640 KB Output is correct
26 Correct 27 ms 15700 KB Output is correct
27 Correct 253 ms 26776 KB Output is correct
28 Correct 232 ms 26840 KB Output is correct
29 Correct 169 ms 23704 KB Output is correct
30 Correct 137 ms 23120 KB Output is correct
31 Correct 153 ms 25856 KB Output is correct
32 Correct 248 ms 26956 KB Output is correct
33 Correct 192 ms 26208 KB Output is correct
34 Correct 111 ms 20940 KB Output is correct
35 Correct 198 ms 26752 KB Output is correct
36 Correct 248 ms 26936 KB Output is correct
37 Correct 125 ms 21644 KB Output is correct
38 Correct 199 ms 25876 KB Output is correct
39 Correct 40 ms 16364 KB Output is correct
40 Correct 211 ms 25836 KB Output is correct
41 Correct 145 ms 23024 KB Output is correct
42 Correct 203 ms 25860 KB Output is correct
43 Correct 74 ms 18636 KB Output is correct
44 Correct 229 ms 25896 KB Output is correct
45 Correct 43 ms 16668 KB Output is correct
46 Correct 193 ms 25956 KB Output is correct
47 Correct 59 ms 17724 KB Output is correct
48 Correct 216 ms 26020 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 661 ms 42144 KB Output is correct
2 Correct 732 ms 45128 KB Output is correct
3 Correct 457 ms 35932 KB Output is correct
4 Correct 695 ms 45128 KB Output is correct
5 Correct 271 ms 29336 KB Output is correct
6 Correct 749 ms 45292 KB Output is correct
7 Correct 643 ms 39952 KB Output is correct
8 Correct 740 ms 45256 KB Output is correct
9 Correct 75 ms 19784 KB Output is correct
10 Correct 740 ms 45152 KB Output is correct
11 Correct 400 ms 33256 KB Output is correct
12 Correct 723 ms 45300 KB Output is correct
13 Correct 355 ms 41176 KB Output is correct
14 Correct 346 ms 41324 KB Output is correct
15 Correct 388 ms 41336 KB Output is correct
16 Correct 306 ms 41760 KB Output is correct
17 Correct 354 ms 41252 KB Output is correct
18 Correct 345 ms 41672 KB Output is correct
19 Correct 358 ms 40852 KB Output is correct
20 Correct 364 ms 41528 KB Output is correct
21 Correct 367 ms 42276 KB Output is correct
22 Correct 345 ms 41692 KB Output is correct
23 Correct 349 ms 41124 KB Output is correct
24 Correct 307 ms 41508 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14420 KB Output is correct
2 Correct 9 ms 14536 KB Output is correct
3 Correct 8 ms 14484 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 9 ms 14404 KB Output is correct
6 Correct 9 ms 14496 KB Output is correct
7 Correct 8 ms 14404 KB Output is correct
8 Correct 9 ms 14420 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 8 ms 14404 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 9 ms 14420 KB Output is correct
14 Correct 9 ms 14488 KB Output is correct
15 Correct 9 ms 14420 KB Output is correct
16 Correct 8 ms 14420 KB Output is correct
17 Correct 9 ms 14400 KB Output is correct
18 Correct 10 ms 14420 KB Output is correct
19 Correct 9 ms 14488 KB Output is correct
20 Correct 8 ms 14468 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 10 ms 14408 KB Output is correct
23 Correct 9 ms 14404 KB Output is correct
24 Correct 10 ms 14424 KB Output is correct
25 Correct 132 ms 23640 KB Output is correct
26 Correct 27 ms 15700 KB Output is correct
27 Correct 253 ms 26776 KB Output is correct
28 Correct 232 ms 26840 KB Output is correct
29 Correct 169 ms 23704 KB Output is correct
30 Correct 137 ms 23120 KB Output is correct
31 Correct 153 ms 25856 KB Output is correct
32 Correct 248 ms 26956 KB Output is correct
33 Correct 192 ms 26208 KB Output is correct
34 Correct 111 ms 20940 KB Output is correct
35 Correct 198 ms 26752 KB Output is correct
36 Correct 248 ms 26936 KB Output is correct
37 Correct 125 ms 21644 KB Output is correct
38 Correct 199 ms 25876 KB Output is correct
39 Correct 40 ms 16364 KB Output is correct
40 Correct 211 ms 25836 KB Output is correct
41 Correct 145 ms 23024 KB Output is correct
42 Correct 203 ms 25860 KB Output is correct
43 Correct 74 ms 18636 KB Output is correct
44 Correct 229 ms 25896 KB Output is correct
45 Correct 43 ms 16668 KB Output is correct
46 Correct 193 ms 25956 KB Output is correct
47 Correct 59 ms 17724 KB Output is correct
48 Correct 216 ms 26020 KB Output is correct
49 Correct 661 ms 42144 KB Output is correct
50 Correct 732 ms 45128 KB Output is correct
51 Correct 457 ms 35932 KB Output is correct
52 Correct 695 ms 45128 KB Output is correct
53 Correct 271 ms 29336 KB Output is correct
54 Correct 749 ms 45292 KB Output is correct
55 Correct 643 ms 39952 KB Output is correct
56 Correct 740 ms 45256 KB Output is correct
57 Correct 75 ms 19784 KB Output is correct
58 Correct 740 ms 45152 KB Output is correct
59 Correct 400 ms 33256 KB Output is correct
60 Correct 723 ms 45300 KB Output is correct
61 Correct 355 ms 41176 KB Output is correct
62 Correct 346 ms 41324 KB Output is correct
63 Correct 388 ms 41336 KB Output is correct
64 Correct 306 ms 41760 KB Output is correct
65 Correct 354 ms 41252 KB Output is correct
66 Correct 345 ms 41672 KB Output is correct
67 Correct 358 ms 40852 KB Output is correct
68 Correct 364 ms 41528 KB Output is correct
69 Correct 367 ms 42276 KB Output is correct
70 Correct 345 ms 41692 KB Output is correct
71 Correct 349 ms 41124 KB Output is correct
72 Correct 307 ms 41508 KB Output is correct
73 Correct 1071 ms 50104 KB Output is correct
74 Correct 822 ms 45860 KB Output is correct
75 Correct 935 ms 46564 KB Output is correct
76 Correct 1294 ms 55008 KB Output is correct
77 Correct 625 ms 36544 KB Output is correct
78 Correct 1167 ms 51140 KB Output is correct
79 Correct 1183 ms 50620 KB Output is correct
80 Correct 1291 ms 54944 KB Output is correct
81 Correct 389 ms 30152 KB Output is correct
82 Correct 1050 ms 49448 KB Output is correct
83 Correct 872 ms 43856 KB Output is correct
84 Correct 1275 ms 54844 KB Output is correct
85 Correct 647 ms 46792 KB Output is correct
86 Correct 769 ms 51312 KB Output is correct
87 Correct 431 ms 42104 KB Output is correct
88 Correct 869 ms 51532 KB Output is correct
89 Correct 656 ms 48132 KB Output is correct
90 Correct 827 ms 51080 KB Output is correct
91 Correct 503 ms 43948 KB Output is correct
92 Correct 784 ms 51548 KB Output is correct
93 Correct 449 ms 43568 KB Output is correct
94 Correct 855 ms 51744 KB Output is correct
95 Correct 524 ms 43332 KB Output is correct
96 Correct 772 ms 51804 KB Output is correct