oj.uz

Submission #998703

# Submission time Handle Problem Language Result Execution time Memory
998703 2024-06-14T14:26:05 Z tosivanmak Fish 3 (JOI24_fish3) C++17
100 / 100
 617 ms 189508 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long

ll lg[300005];
struct ST{
  vector<vector<ll> >st;
  vector<ll>arr;
    void init(ll n){
        arr.resize(n+5),st.resize(n+5);
        for(int i=0;i<n+5;i++){
            st[i].resize(21);
        }
    }
    void build(ll n){
        for(int i=1;i<=n;i++){
            st[i][0]=arr[i];
        }
        for(int j=1;j<=20;j++){
             for(int i=1;i<=n;i++){
                 if(i+(1<<(j-1))<=n){
                     st[i][j]=min(st[i][j-1],st[i+(1<<(j-1))][j-1]);
                 }
             }   
        }
    }
    ll qry(ll ql, ll qr){
        ll rng=lg[qr-ql+1];
        return min(st[ql][rng],st[qr-(1<<rng)+1][rng]);
    }
}st;
stack<pair<ll,ll> >s;
pair<ll,ll>jmp[300005][21];
ll psum[300005],arr[300005],a[300005],c[300005];
ll n,d;
ll qry(ll ql, ll qr){
    ll ans=0;
    ll redu=a[ql];
    ll real=c[ql]%d;
    ll add=redu-real;
    ll mini=st.qry(ql,qr)+add;
    // cout<<st.qry(ql,qr)<<' ';
    if(mini<0)return -1;
    for(int i=20;i>=0;i--){
        if(jmp[qr][i].first>=ql){
            ans+=jmp[qr][i].second;
            qr=jmp[qr][i].first;
        }
    }
    ans+=(psum[qr]-psum[ql-1]-(qr-ql+1)*arr[qr])/d;
    return ans;
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin>>n>>d;
    for(int i=2;i<=300000;i*=2)lg[i]=1;
    for(int i=3;i<=300000;i++)lg[i]+=lg[i-1];
    for(int i=1;i<=n;i++){
       cin>>c[i];
    }
    st.init(n);
    for(int i=1;i<=n;i++){
        ll prev=c[i-1]%d,cur=c[i]%d;
        if(cur>=prev){
            a[i]=a[i-1]+cur-prev;
        }
        else{
            a[i]=a[i-1]+cur-prev+d;
        }
    }
    for(int i=1;i<=n;i++){
        arr[i]=c[i]-a[i];
        // cout<<arr[i]<<" ";
        psum[i]=psum[i-1]+arr[i];
        st.arr[i]=arr[i];
    }
    st.build(n);
    for(int i=n;i>=1;i--){
        while(s.size()){
            if(arr[i]<s.top().first){
                jmp[s.top().second][0]={i,(psum[s.top().second]-psum[i]-s.top().first*(s.top().second-i))/d};
                s.pop();
            }
            else{
                break;
            }
        }
        s.push({arr[i],i});
    }
    for(int j=1;j<=20;j++){
        for(int i=1;i<=n;i++){
            ll nxt=jmp[i][j-1].first;
            jmp[i][j]={jmp[nxt][j-1].first,jmp[i][j-1].second+jmp[nxt][j-1].second};
        }
    }
    ll q;
    cin>>q;
    while(q--){
        ll l,r;
        cin>>l>>r;
        cout<<qry(l,r)<<'\n';
    }
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5980 KB Output is correct
2 Correct 1 ms 5980 KB Output is correct
3 Correct 2 ms 8028 KB Output is correct
4 Correct 3 ms 8796 KB Output is correct
5 Correct 4 ms 8796 KB Output is correct
6 Correct 3 ms 8540 KB Output is correct
7 Correct 4 ms 6976 KB Output is correct
8 Correct 3 ms 8796 KB Output is correct
9 Correct 4 ms 7784 KB Output is correct
10 Correct 3 ms 8796 KB Output is correct
11 Correct 4 ms 7772 KB Output is correct
12 Correct 4 ms 8796 KB Output is correct
13 Correct 4 ms 7652 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 398 ms 180460 KB Output is correct
2 Correct 350 ms 179852 KB Output is correct
3 Correct 49 ms 10444 KB Output is correct
4 Correct 290 ms 182112 KB Output is correct
5 Correct 302 ms 181948 KB Output is correct
6 Correct 334 ms 181840 KB Output is correct
7 Correct 341 ms 181844 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 15696 KB Output is correct
2 Correct 350 ms 184700 KB Output is correct
3 Correct 353 ms 184700 KB Output is correct
4 Correct 382 ms 184916 KB Output is correct
5 Correct 353 ms 184856 KB Output is correct
6 Correct 354 ms 179028 KB Output is correct
7 Correct 341 ms 178788 KB Output is correct
8 Correct 355 ms 181924 KB Output is correct
9 Correct 353 ms 182096 KB Output is correct
10 Correct 605 ms 180112 KB Output is correct
11 Correct 617 ms 179992 KB Output is correct
12 Correct 560 ms 183252 KB Output is correct
13 Correct 576 ms 183176 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 321 ms 154844 KB Output is correct
2 Correct 377 ms 183160 KB Output is correct
3 Correct 135 ms 51284 KB Output is correct
4 Correct 357 ms 186196 KB Output is correct
5 Correct 337 ms 169808 KB Output is correct
6 Correct 378 ms 189464 KB Output is correct
7 Correct 299 ms 153888 KB Output is correct
8 Correct 353 ms 189508 KB Output is correct
9 Correct 306 ms 182356 KB Output is correct
10 Correct 275 ms 182100 KB Output is correct
11 Correct 334 ms 186192 KB Output is correct
12 Correct 320 ms 185424 KB Output is correct
13 Correct 349 ms 189264 KB Output is correct
14 Correct 261 ms 185368 KB Output is correct
15 Correct 322 ms 189268 KB Output is correct
16 Correct 257 ms 185172 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5980 KB Output is correct
2 Correct 1 ms 5980 KB Output is correct
3 Correct 2 ms 8028 KB Output is correct
4 Correct 3 ms 8796 KB Output is correct
5 Correct 4 ms 8796 KB Output is correct
6 Correct 3 ms 8540 KB Output is correct
7 Correct 4 ms 6976 KB Output is correct
8 Correct 3 ms 8796 KB Output is correct
9 Correct 4 ms 7784 KB Output is correct
10 Correct 3 ms 8796 KB Output is correct
11 Correct 4 ms 7772 KB Output is correct
12 Correct 4 ms 8796 KB Output is correct
13 Correct 4 ms 7652 KB Output is correct
14 Correct 398 ms 180460 KB Output is correct
15 Correct 350 ms 179852 KB Output is correct
16 Correct 49 ms 10444 KB Output is correct
17 Correct 290 ms 182112 KB Output is correct
18 Correct 302 ms 181948 KB Output is correct
19 Correct 334 ms 181840 KB Output is correct
20 Correct 341 ms 181844 KB Output is correct
21 Correct 70 ms 15696 KB Output is correct
22 Correct 350 ms 184700 KB Output is correct
23 Correct 353 ms 184700 KB Output is correct
24 Correct 382 ms 184916 KB Output is correct
25 Correct 353 ms 184856 KB Output is correct
26 Correct 354 ms 179028 KB Output is correct
27 Correct 341 ms 178788 KB Output is correct
28 Correct 355 ms 181924 KB Output is correct
29 Correct 353 ms 182096 KB Output is correct
30 Correct 605 ms 180112 KB Output is correct
31 Correct 617 ms 179992 KB Output is correct
32 Correct 560 ms 183252 KB Output is correct
33 Correct 576 ms 183176 KB Output is correct
34 Correct 321 ms 154844 KB Output is correct
35 Correct 377 ms 183160 KB Output is correct
36 Correct 135 ms 51284 KB Output is correct
37 Correct 357 ms 186196 KB Output is correct
38 Correct 337 ms 169808 KB Output is correct
39 Correct 378 ms 189464 KB Output is correct
40 Correct 299 ms 153888 KB Output is correct
41 Correct 353 ms 189508 KB Output is correct
42 Correct 306 ms 182356 KB Output is correct
43 Correct 275 ms 182100 KB Output is correct
44 Correct 334 ms 186192 KB Output is correct
45 Correct 320 ms 185424 KB Output is correct
46 Correct 349 ms 189264 KB Output is correct
47 Correct 261 ms 185368 KB Output is correct
48 Correct 322 ms 189268 KB Output is correct
49 Correct 257 ms 185172 KB Output is correct
50 Correct 310 ms 184916 KB Output is correct
51 Correct 298 ms 178844 KB Output is correct
52 Correct 319 ms 182156 KB Output is correct
53 Correct 532 ms 180052 KB Output is correct
54 Correct 498 ms 183124 KB Output is correct
55 Correct 337 ms 184660 KB Output is correct
56 Correct 282 ms 185172 KB Output is correct
57 Correct 257 ms 180820 KB Output is correct
58 Correct 260 ms 182096 KB Output is correct
59 Correct 307 ms 185096 KB Output is correct
60 Correct 274 ms 185172 KB Output is correct
61 Correct 538 ms 180092 KB Output is correct
62 Correct 316 ms 184972 KB Output is correct
63 Correct 447 ms 182864 KB Output is correct
64 Correct 281 ms 185424 KB Output is correct