oj.uz

Submission #992280

# Submission time Handle Problem Language Result Execution time Memory
992280 2024-06-04T08:18:26 Z imarn Fish 3 (JOI24_fish3) C++14
100 / 100
 1330 ms 55632 KB 
#include<bits/stdc++.h>
#define ll long long
#define pii pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
const int mxn=3e5+5;
ll t[4*mxn]{0},lz[4*mxn]{0};
void push(int i,int l,int r){
    if(lz[i]==1e16)return;
    t[i]=lz[i]*(r-l+1);
    if(l<r)lz[2*i]=lz[i],lz[2*i+1]=lz[i];
    lz[i]=1e16;
}
void update(int i,int l,int r,int tl,int tr,ll v){
    push(i,l,r);
    if(r<tl||l>tr)return;
    if(r<=tr&&l>=tl){
        lz[i]=v;push(i,l,r);return;
    }int m=(l+r)>>1;
    update(2*i,l,m,tl,tr,v);update(2*i+1,m+1,r,tl,tr,v);
    t[i]=t[2*i]+t[2*i+1];
}
ll query(int i,int l,int r,int tl,int tr){
    push(i,l,r);
    if(r<tl||l>tr)return 0;
    if(r<=tr&&l>=tl)return t[i];
    int m=(l+r)>>1;
    return query(2*i,l,m,tl,tr)+query(2*i+1,m+1,r,tl,tr);
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n;ll d;cin>>n>>d;ll c[n+1],a[n+1],b[n+1],qa[n+1];
    for(int i=1;i<=4*n;i++)lz[i]=1e16;
    for(int i=1;i<=n;i++){
        cin>>c[i];b[i]=c[i]%d,a[i]=c[i]/d;
    }ll pf[n+1]={0},spf[n+1]={0};
    for(int i=2;i<=n;i++)pf[i]=pf[i-1]+(b[i]<b[i-1]);
    for(int i=1;i<=n;i++)spf[i]=spf[i-1]+pf[i],qa[i]=qa[i-1]+a[i];
    vector<pii>qr[n+1];int q;cin>>q;ll ans[q+1]={0};
    for(int i=1;i<=q;i++){
        int l,r;cin>>l>>r;qr[r].pb({l,i});
    }vector<pii>g;
    for(int i=1;i<=n;i++){
        int l=1,r=i;
        while(l<r){
            int m=(l+r)>>1;
            if(query(1,1,n,m,m)>a[i]-pf[i])r=m;
            else l=m+1;
        }update(1,1,n,l,i,a[i]-pf[i]);
        for(auto it : qr[i]){
            ans[it.s]=qa[i]-qa[it.f-1];
            ans[it.s]-=query(1,1,n,it.f,i);
            ans[it.s]-=spf[i]-spf[it.f-1];
            if(query(1,1,n,it.f,it.f)+pf[it.f]<0)ans[it.s]=-1;
        }
    }
    for(int i=1;i<=q;i++)cout<<ans[i]<<'\n';
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 6 ms 2908 KB Output is correct
5 Correct 6 ms 2904 KB Output is correct
6 Correct 4 ms 2652 KB Output is correct
7 Correct 4 ms 2652 KB Output is correct
8 Correct 8 ms 2908 KB Output is correct
9 Correct 7 ms 2924 KB Output is correct
10 Correct 6 ms 2924 KB Output is correct
11 Correct 6 ms 2928 KB Output is correct
12 Correct 6 ms 2924 KB Output is correct
13 Correct 5 ms 2908 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1112 ms 52304 KB Output is correct
2 Correct 1081 ms 51452 KB Output is correct
3 Correct 146 ms 13908 KB Output is correct
4 Correct 1161 ms 51284 KB Output is correct
5 Correct 1197 ms 51200 KB Output is correct
6 Correct 1052 ms 51004 KB Output is correct
7 Correct 1087 ms 51020 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 17492 KB Output is correct
2 Correct 1086 ms 55540 KB Output is correct
3 Correct 1179 ms 55544 KB Output is correct
4 Correct 1174 ms 55536 KB Output is correct
5 Correct 1192 ms 55632 KB Output is correct
6 Correct 1117 ms 52464 KB Output is correct
7 Correct 1099 ms 52304 KB Output is correct
8 Correct 1106 ms 52564 KB Output is correct
9 Correct 1108 ms 52308 KB Output is correct
10 Correct 1097 ms 51032 KB Output is correct
11 Correct 1193 ms 50924 KB Output is correct
12 Correct 1137 ms 53992 KB Output is correct
13 Correct 1162 ms 54112 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1016 ms 44400 KB Output is correct
2 Correct 1204 ms 52052 KB Output is correct
3 Correct 378 ms 23124 KB Output is correct
4 Correct 1250 ms 52052 KB Output is correct
5 Correct 1109 ms 52820 KB Output is correct
6 Correct 1210 ms 55552 KB Output is correct
7 Correct 999 ms 46848 KB Output is correct
8 Correct 1330 ms 55376 KB Output is correct
9 Correct 1245 ms 51448 KB Output is correct
10 Correct 1213 ms 51180 KB Output is correct
11 Correct 1192 ms 52220 KB Output is correct
12 Correct 1293 ms 51544 KB Output is correct
13 Correct 1253 ms 55280 KB Output is correct
14 Correct 1241 ms 51284 KB Output is correct
15 Correct 1263 ms 55292 KB Output is correct
16 Correct 1275 ms 51264 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 6 ms 2908 KB Output is correct
5 Correct 6 ms 2904 KB Output is correct
6 Correct 4 ms 2652 KB Output is correct
7 Correct 4 ms 2652 KB Output is correct
8 Correct 8 ms 2908 KB Output is correct
9 Correct 7 ms 2924 KB Output is correct
10 Correct 6 ms 2924 KB Output is correct
11 Correct 6 ms 2928 KB Output is correct
12 Correct 6 ms 2924 KB Output is correct
13 Correct 5 ms 2908 KB Output is correct
14 Correct 1112 ms 52304 KB Output is correct
15 Correct 1081 ms 51452 KB Output is correct
16 Correct 146 ms 13908 KB Output is correct
17 Correct 1161 ms 51284 KB Output is correct
18 Correct 1197 ms 51200 KB Output is correct
19 Correct 1052 ms 51004 KB Output is correct
20 Correct 1087 ms 51020 KB Output is correct
21 Correct 143 ms 17492 KB Output is correct
22 Correct 1086 ms 55540 KB Output is correct
23 Correct 1179 ms 55544 KB Output is correct
24 Correct 1174 ms 55536 KB Output is correct
25 Correct 1192 ms 55632 KB Output is correct
26 Correct 1117 ms 52464 KB Output is correct
27 Correct 1099 ms 52304 KB Output is correct
28 Correct 1106 ms 52564 KB Output is correct
29 Correct 1108 ms 52308 KB Output is correct
30 Correct 1097 ms 51032 KB Output is correct
31 Correct 1193 ms 50924 KB Output is correct
32 Correct 1137 ms 53992 KB Output is correct
33 Correct 1162 ms 54112 KB Output is correct
34 Correct 1016 ms 44400 KB Output is correct
35 Correct 1204 ms 52052 KB Output is correct
36 Correct 378 ms 23124 KB Output is correct
37 Correct 1250 ms 52052 KB Output is correct
38 Correct 1109 ms 52820 KB Output is correct
39 Correct 1210 ms 55552 KB Output is correct
40 Correct 999 ms 46848 KB Output is correct
41 Correct 1330 ms 55376 KB Output is correct
42 Correct 1245 ms 51448 KB Output is correct
43 Correct 1213 ms 51180 KB Output is correct
44 Correct 1192 ms 52220 KB Output is correct
45 Correct 1293 ms 51544 KB Output is correct
46 Correct 1253 ms 55280 KB Output is correct
47 Correct 1241 ms 51284 KB Output is correct
48 Correct 1263 ms 55292 KB Output is correct
49 Correct 1275 ms 51264 KB Output is correct
50 Correct 1238 ms 55544 KB Output is correct
51 Correct 1239 ms 52472 KB Output is correct
52 Correct 1208 ms 52476 KB Output is correct
53 Correct 1297 ms 50936 KB Output is correct
54 Correct 1239 ms 54008 KB Output is correct
55 Correct 1247 ms 55384 KB Output is correct
56 Correct 1308 ms 51212 KB Output is correct
57 Correct 1251 ms 51192 KB Output is correct
58 Correct 1185 ms 51212 KB Output is correct
59 Correct 1252 ms 53332 KB Output is correct
60 Correct 1225 ms 51196 KB Output is correct
61 Correct 1120 ms 50884 KB Output is correct
62 Correct 1138 ms 50944 KB Output is correct
63 Correct 1094 ms 53748 KB Output is correct
64 Correct 1194 ms 51284 KB Output is correct