Submission #73483854

---

Source Code Expand

#include <bits/stdc++.h>
#define endl '\n'
using namespace std;

using ll=long long;
using ull=unsigned long long;

void solve(){
    ll N, D; cin>>N>>D;
    vector<ll> A(N), B(N);
    for(int i=0; i<N; ++i)cin>>A[i];
    for(int i=0; i<N; ++i)cin>>B[i];

    queue<pair<ll, ll>> Q;
    for(int i=0; i<N; ++i){
        Q.push({i, A[i]});

        int b=B[i];
        while(b>0){
            auto [d, n]=Q.front();
            if(b>=n){
                Q.pop();
                b-=n;
            }else{
                Q.front().second-=b;
                b=0;
            }
        }

        while(!Q.empty()&&i-Q.front().first>=D)Q.pop();
    }

    ll ans=0;
    while(!Q.empty()){
        ans+=Q.front().second;
        Q.pop();
    }
    cout<<ans<<endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    //cout<<fixed<<setprecision(17);
    int T=1; cin>>T;
    while(T--)solve();
    return 0;
}

Submission Info

Judge Result