Submission #1357948

#TimeUsernameProblemLanguageResultExecution timeMemory
1357948naneosmicLegendary Dango Eater (JOI26_dango)C++20
5 / 100
94 ms13568 KiB
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
int k;
void solve(){
    int n,q;
    cin>>n>>q>>k;
    vector<int>v(n);
    for(int i=0;i<n;i++){
        cin>>v[i];
    }
    if(n%2!=0){
        v.push_back(0);
        n++;
    }
    vector<int>pref((n/2)+1);
    pref[0]=0;
    for(int i=0;i<n/2;i++){
        int num=v[2*i]/k;
        int remain=v[2*i]%k;
        remain-=v[1*i+1];
        remain=max(remain,0LL);
        pref[i+1]=pref[i]+((k*num)+remain);
    }
    for(int i=0;i<q;i++){
        int l,r;
        cin>>l>>r;
        l--;
        r--;
        if(l%2!=0)l++;
        l/=2;
        r/=2;
        cout<<(pref[r+1]-pref[l])/k<<endl;
    }
}
signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t=1;
    //cin>>t;
    while(t--)solve();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...