oj.uz

Submission #992267

# Submission time Handle Problem Language Result Execution time Memory
992267 2024-06-04T08:01:39 Z imarn Fish 3 (JOI24_fish3) C++14
0 / 100
 389 ms 55988 KB 
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#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 id=i;
        while(!g.empty()&&a[i]-pf[i]<g.back().f)id=g.back().s,g.pop_back();
        g.pb({a[i]-pf[i],id});update(1,1,n,id,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)<0)ans[it.s]=-1;
        }
    }
    for(int i=1;i<=q;i++)cout<<ans[i]<<'\n';
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Incorrect 0 ms 2396 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 382 ms 55988 KB Output is correct
2 Correct 389 ms 55984 KB Output is correct
3 Incorrect 157 ms 12624 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 142 ms 12352 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 387 ms 46912 KB Output is correct
2 Correct 367 ms 55248 KB Output is correct
3 Incorrect 231 ms 23728 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Incorrect 0 ms 2396 KB Output isn't correct
4 Halted 0 ms 0 KB -