Submission #73485796

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a)  (a).begin(),(a).end()

using P=pair<ll,ll>;
using T=tuple<ll,ll,ll>;

#include <atcoder/all> 
using namespace atcoder;
// using mint=modint998244353;
// using mint=modint1000000007;
// int op(int a,int b){return (a+b);}
// int e(){return 0;}

int cnt(deque<P> q){
    int ret=0;
    while(!q.empty()){
      auto [c,j]=q.front();
      q.pop_front();
      ret+=c;
    }
    return ret;
}

int main() {
  int t;cin>>t;

  

  while(t--){
    int n,d;cin>>n>>d;
    deque<P> q;
    vector<int> a(n),b(n);
    rep(i,n)cin>>a[i];
    rep(i,n)cin>>b[i];

    rep(i,n){
      q.push_back({a[i],i});

      while(!q.empty()){
        auto [c,j]=q.front();
        q.pop_front();
        if(c>b[i]){
          c-=b[i];
          q.push_front({c,j});
          break;
        }
        else{
          b[i]-=c;
        }
      }

      if(!q.empty()){
        auto [c,j]=q.front();
        if(j+d==i)q.pop_front();
      }

      // cout<<cnt(q)<<endl;
    }

    int ans=cnt(q);
    

    cout<<ans<<endl;
  }
}

Submission Info

Judge Result