oj.uz

답안 #861978

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
861978 2023-10-17T10:08:13 Z fdnfksd Two Antennas (JOI19_antennas) C++14
100 / 100
 493 ms 58344 KB 
#include<bits/stdc++.h>
#define TASKNAME "codeforce"
#define pb push_back
#define pli pair<int,int>
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
const ll maxN=2e5+10;
const ll inf=1e18;
const ll mod=1e9+7;
ll cc[4*maxN],st[4*maxN],mx[4*maxN];
void down(ll t,ll id)
{
    cc[id*2]=max(cc[id*2],cc[id]);
    mx[id*2]=max(mx[id*2],cc[id]+st[id*2]);
    cc[id*2+1]=max(cc[id*2+1],cc[id]);
    mx[id*2+1]=max(mx[id*2+1],cc[id]+st[id*2+1]);
    cc[id]=-inf;
}
ll n;
void update(ll t,ll pos,ll val,ll id=1,ll l=1,ll r=n)
{
    if(l==r)
    {
        st[id]=val;
        return;
    }
    ll mid=l+r>>1;
    down(t,id);
    if(pos<=mid) update(t,pos,val,id*2,l,mid);
    else update(t,pos,val,id*2+1,mid+1,r);
    st[id]=max(st[id*2],st[id*2+1]);
    mx[id]=max({mx[id],mx[id*2],mx[id*2+1]});
}
void upd(ll t,ll i,ll j,ll v,ll id=1,ll l=1,ll r=n)
{
    if(j<l||r<i)
    {
        return;
    }
    if(i<=l&&r<=j)
    {
        cc[id]=max(cc[id],v);
        mx[id]=max(mx[id],st[id]+v) ;
        return;
    }
    ll mid=l+r>>1;
    down(t,id);
    upd(t,i,j,v,id*2,l,mid);
    upd(t,i,j,v,id*2+1,mid+1,r);
    mx[id]=max({mx[id],mx[id*2],mx[id*2+1]});
}
ll get(ll t,ll i,ll j,ll id=1,ll l=1,ll r=n)
{
    if(j<l||r<i) return -inf;
    if(i<=l&&r<=j) return mx[id];
    ll mid=l+r>>1;
    down(t,id);
    mx[id]=max({mx[id],mx[id*2],mx[id*2+1]});
    return max(get(t,i,j,id*2,l,mid),get(t,i,j,id*2+1,mid+1,r));
}
ll a[maxN],b[maxN],h[maxN],q;
vector<ll>in[maxN],out[maxN];
vector<pli>quer[maxN];
ll ans[maxN];
void solve()
{
    cin >> n;
    for(int i=1;i<=n;i++)
    {
        cin >> h[i] >> a[i] >> b[i];
        ll l,r;
        r=i-a[i];
        l=i-b[i];
        r=max(r,0ll);
        l=max(l,1ll);
        in[r].pb(i);
        out[l-1].pb(i);
    }
    cin >> q;
    for(int i=1;i<=q;i++)
    {
        ll l,r;
        cin >> l >> r;
        quer[l].pb({r,i});
        ans[i]=-inf;
    }
    fill(mx,mx+4*maxN,-inf);
    fill(cc,cc+4*maxN,-inf);
    fill(st,st+4*maxN,-inf);
    for(int i=n;i>=1;i--)
    {
        for(auto j:in[i])
        {
            update(1,j,-h[j]);
        }
        for(auto j:out[i])
        {
            update(1,j,-inf);
        }
        ll l,r;
        l=i+a[i];
        r=i+b[i];
        r=min(r,n);
        upd(1,l,r,h[i]);
        for(auto zz:quer[i])
        {
            ll id=zz.se;
            ll R=zz.fi;
            ans[id]=max(ans[id],get(1,1,R));
        }
    }
    fill(mx,mx+4*maxN,-inf);
    fill(cc,cc+4*maxN,-inf);
    fill(st,st+4*maxN,-inf);
    for(int i=n;i>=1;i--)
    {
        for(auto j:in[i])
        {
            update(2,j,h[j]);
        }
        for(auto j:out[i])
        {
            update(2,j,-inf);
        }
        ll l,r;
        l=i+a[i];
        r=i+b[i];
        r=min(r,n);
        upd(2,l,r,-h[i]);
        for(auto zz:quer[i])
        {
            ll id=zz.se;
            ll R=zz.fi;
            ans[id]=max(ans[id],get(2,1,R));
        }
    }
    for(int i=1;i<=q;i++)
    {
        if(ans[i]<0) cout << -1 << '\n';
        else cout << ans[i] << '\n';
    }
}
int main()
{
    fastio
    //freopen(TASKNAME".INP","r",stdin);
    //freopen(TASKNAME".OUT","w",stdout);
    solve();
}

Compilation message

antennas.cpp: In function 'void update(ll, ll, ll, ll, ll, ll)':
antennas.cpp:30:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   30 |     ll mid=l+r>>1;
      |            ~^~
antennas.cpp: In function 'void upd(ll, ll, ll, ll, ll, ll, ll)':
antennas.cpp:49:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   49 |     ll mid=l+r>>1;
      |            ~^~
antennas.cpp: In function 'll get(ll, ll, ll, ll, ll, ll)':
antennas.cpp:59:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   59 |     ll mid=l+r>>1;
      |            ~^~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 39256 KB Output is correct
2 Correct 9 ms 39260 KB Output is correct
3 Correct 9 ms 39440 KB Output is correct
4 Correct 9 ms 39596 KB Output is correct
5 Correct 11 ms 39288 KB Output is correct
6 Correct 10 ms 39404 KB Output is correct
7 Correct 11 ms 39260 KB Output is correct
8 Correct 9 ms 39452 KB Output is correct
9 Correct 9 ms 39260 KB Output is correct
10 Correct 9 ms 39452 KB Output is correct
11 Correct 9 ms 39412 KB Output is correct
12 Correct 9 ms 39260 KB Output is correct
13 Correct 9 ms 39260 KB Output is correct
14 Correct 9 ms 39408 KB Output is correct
15 Correct 9 ms 39260 KB Output is correct
16 Correct 10 ms 39512 KB Output is correct
17 Correct 10 ms 39452 KB Output is correct
18 Correct 9 ms 39260 KB Output is correct
19 Correct 9 ms 39260 KB Output is correct
20 Correct 9 ms 39260 KB Output is correct
21 Correct 9 ms 39260 KB Output is correct
22 Correct 9 ms 39260 KB Output is correct
23 Correct 9 ms 39260 KB Output is correct
24 Correct 9 ms 39448 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 39256 KB Output is correct
2 Correct 9 ms 39260 KB Output is correct
3 Correct 9 ms 39440 KB Output is correct
4 Correct 9 ms 39596 KB Output is correct
5 Correct 11 ms 39288 KB Output is correct
6 Correct 10 ms 39404 KB Output is correct
7 Correct 11 ms 39260 KB Output is correct
8 Correct 9 ms 39452 KB Output is correct
9 Correct 9 ms 39260 KB Output is correct
10 Correct 9 ms 39452 KB Output is correct
11 Correct 9 ms 39412 KB Output is correct
12 Correct 9 ms 39260 KB Output is correct
13 Correct 9 ms 39260 KB Output is correct
14 Correct 9 ms 39408 KB Output is correct
15 Correct 9 ms 39260 KB Output is correct
16 Correct 10 ms 39512 KB Output is correct
17 Correct 10 ms 39452 KB Output is correct
18 Correct 9 ms 39260 KB Output is correct
19 Correct 9 ms 39260 KB Output is correct
20 Correct 9 ms 39260 KB Output is correct
21 Correct 9 ms 39260 KB Output is correct
22 Correct 9 ms 39260 KB Output is correct
23 Correct 9 ms 39260 KB Output is correct
24 Correct 9 ms 39448 KB Output is correct
25 Correct 62 ms 43776 KB Output is correct
26 Correct 18 ms 40028 KB Output is correct
27 Correct 90 ms 45412 KB Output is correct
28 Correct 92 ms 45512 KB Output is correct
29 Correct 64 ms 43980 KB Output is correct
30 Correct 64 ms 43860 KB Output is correct
31 Correct 71 ms 44880 KB Output is correct
32 Correct 89 ms 45392 KB Output is correct
33 Correct 83 ms 45736 KB Output is correct
34 Correct 49 ms 42328 KB Output is correct
35 Correct 86 ms 45908 KB Output is correct
36 Correct 104 ms 45288 KB Output is correct
37 Correct 66 ms 42584 KB Output is correct
38 Correct 88 ms 44368 KB Output is correct
39 Correct 22 ms 40284 KB Output is correct
40 Correct 88 ms 44404 KB Output is correct
41 Correct 67 ms 43464 KB Output is correct
42 Correct 91 ms 44268 KB Output is correct
43 Correct 36 ms 41296 KB Output is correct
44 Correct 87 ms 44276 KB Output is correct
45 Correct 24 ms 40540 KB Output is correct
46 Correct 87 ms 44408 KB Output is correct
47 Correct 31 ms 40800 KB Output is correct
48 Correct 87 ms 44396 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 266 ms 48312 KB Output is correct
2 Correct 258 ms 49340 KB Output is correct
3 Correct 166 ms 46480 KB Output is correct
4 Correct 240 ms 49604 KB Output is correct
5 Correct 108 ms 43968 KB Output is correct
6 Correct 274 ms 49436 KB Output is correct
7 Correct 234 ms 48180 KB Output is correct
8 Correct 242 ms 49476 KB Output is correct
9 Correct 38 ms 40916 KB Output is correct
10 Correct 249 ms 49340 KB Output is correct
11 Correct 175 ms 45692 KB Output is correct
12 Correct 281 ms 49516 KB Output is correct
13 Correct 174 ms 48320 KB Output is correct
14 Correct 174 ms 48308 KB Output is correct
15 Correct 166 ms 47828 KB Output is correct
16 Correct 157 ms 47752 KB Output is correct
17 Correct 192 ms 48820 KB Output is correct
18 Correct 176 ms 47852 KB Output is correct
19 Correct 176 ms 47804 KB Output is correct
20 Correct 179 ms 47932 KB Output is correct
21 Correct 156 ms 48440 KB Output is correct
22 Correct 202 ms 48112 KB Output is correct
23 Correct 175 ms 48420 KB Output is correct
24 Correct 153 ms 47636 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 39256 KB Output is correct
2 Correct 9 ms 39260 KB Output is correct
3 Correct 9 ms 39440 KB Output is correct
4 Correct 9 ms 39596 KB Output is correct
5 Correct 11 ms 39288 KB Output is correct
6 Correct 10 ms 39404 KB Output is correct
7 Correct 11 ms 39260 KB Output is correct
8 Correct 9 ms 39452 KB Output is correct
9 Correct 9 ms 39260 KB Output is correct
10 Correct 9 ms 39452 KB Output is correct
11 Correct 9 ms 39412 KB Output is correct
12 Correct 9 ms 39260 KB Output is correct
13 Correct 9 ms 39260 KB Output is correct
14 Correct 9 ms 39408 KB Output is correct
15 Correct 9 ms 39260 KB Output is correct
16 Correct 10 ms 39512 KB Output is correct
17 Correct 10 ms 39452 KB Output is correct
18 Correct 9 ms 39260 KB Output is correct
19 Correct 9 ms 39260 KB Output is correct
20 Correct 9 ms 39260 KB Output is correct
21 Correct 9 ms 39260 KB Output is correct
22 Correct 9 ms 39260 KB Output is correct
23 Correct 9 ms 39260 KB Output is correct
24 Correct 9 ms 39448 KB Output is correct
25 Correct 62 ms 43776 KB Output is correct
26 Correct 18 ms 40028 KB Output is correct
27 Correct 90 ms 45412 KB Output is correct
28 Correct 92 ms 45512 KB Output is correct
29 Correct 64 ms 43980 KB Output is correct
30 Correct 64 ms 43860 KB Output is correct
31 Correct 71 ms 44880 KB Output is correct
32 Correct 89 ms 45392 KB Output is correct
33 Correct 83 ms 45736 KB Output is correct
34 Correct 49 ms 42328 KB Output is correct
35 Correct 86 ms 45908 KB Output is correct
36 Correct 104 ms 45288 KB Output is correct
37 Correct 66 ms 42584 KB Output is correct
38 Correct 88 ms 44368 KB Output is correct
39 Correct 22 ms 40284 KB Output is correct
40 Correct 88 ms 44404 KB Output is correct
41 Correct 67 ms 43464 KB Output is correct
42 Correct 91 ms 44268 KB Output is correct
43 Correct 36 ms 41296 KB Output is correct
44 Correct 87 ms 44276 KB Output is correct
45 Correct 24 ms 40540 KB Output is correct
46 Correct 87 ms 44408 KB Output is correct
47 Correct 31 ms 40800 KB Output is correct
48 Correct 87 ms 44396 KB Output is correct
49 Correct 266 ms 48312 KB Output is correct
50 Correct 258 ms 49340 KB Output is correct
51 Correct 166 ms 46480 KB Output is correct
52 Correct 240 ms 49604 KB Output is correct
53 Correct 108 ms 43968 KB Output is correct
54 Correct 274 ms 49436 KB Output is correct
55 Correct 234 ms 48180 KB Output is correct
56 Correct 242 ms 49476 KB Output is correct
57 Correct 38 ms 40916 KB Output is correct
58 Correct 249 ms 49340 KB Output is correct
59 Correct 175 ms 45692 KB Output is correct
60 Correct 281 ms 49516 KB Output is correct
61 Correct 174 ms 48320 KB Output is correct
62 Correct 174 ms 48308 KB Output is correct
63 Correct 166 ms 47828 KB Output is correct
64 Correct 157 ms 47752 KB Output is correct
65 Correct 192 ms 48820 KB Output is correct
66 Correct 176 ms 47852 KB Output is correct
67 Correct 176 ms 47804 KB Output is correct
68 Correct 179 ms 47932 KB Output is correct
69 Correct 156 ms 48440 KB Output is correct
70 Correct 202 ms 48112 KB Output is correct
71 Correct 175 ms 48420 KB Output is correct
72 Correct 153 ms 47636 KB Output is correct
73 Correct 371 ms 55216 KB Output is correct
74 Correct 314 ms 50228 KB Output is correct
75 Correct 319 ms 54732 KB Output is correct
76 Correct 493 ms 58344 KB Output is correct
77 Correct 208 ms 49860 KB Output is correct
78 Correct 361 ms 55808 KB Output is correct
79 Correct 389 ms 56880 KB Output is correct
80 Correct 477 ms 58340 KB Output is correct
81 Correct 153 ms 48020 KB Output is correct
82 Correct 386 ms 54312 KB Output is correct
83 Correct 324 ms 54040 KB Output is correct
84 Correct 426 ms 58328 KB Output is correct
85 Correct 291 ms 53188 KB Output is correct
86 Correct 330 ms 56048 KB Output is correct
87 Correct 196 ms 48704 KB Output is correct
88 Correct 343 ms 55224 KB Output is correct
89 Correct 337 ms 54552 KB Output is correct
90 Correct 351 ms 55512 KB Output is correct
91 Correct 243 ms 50872 KB Output is correct
92 Correct 349 ms 55964 KB Output is correct
93 Correct 190 ms 49968 KB Output is correct
94 Correct 340 ms 55792 KB Output is correct
95 Correct 226 ms 50536 KB Output is correct
96 Correct 352 ms 55312 KB Output is correct