Submission #73496102

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
struct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); cout << setprecision(13); } }init;
using ll = long long;
using pll = pair<ll, ll>;
const int inf = 1073741823;
const long long INF = 1LL << 60;
#define el '\n'
#define spa " "
#define pb emplace_back
#define rep(i, s, n) for(int i = (s); i < (int)(n); i++)
#define rrep(i, s, n) for(int i = (int)(n) - 1; i >= (s); i--)
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define unless(c) if(!(c))
#define until(c) while(!(c))

int sub(){
    return 0;
}

int solve() {
    ll n, d;
    cin >> n >> d;
    vector<ll> a(n);
    vector<ll> b(n);
    ll z = 0;
    rep(i, 0, n){
        cin >> a[i];
    }
    rep(i, 0, n){
        cin >> b[i];
    }
    rep(i, 0, n){
        rep(j, z, n){
            a[j] -= b[i];
            b[i] = 0;
            if(a[j] == 0){
                z = j+1;
            }
            else if(a[j] < 0){
                b[i] = (-a[j]);
                z = j+1;
                a[j] = 0;
            }
            if(b[i] == 0){
                break;
            }
        }

        if(z == i-d){
            a[z] = 0;
            z++;
        }
    }

    ll ans = 0;
    rep(i, z, n){
        ans += a[i];
    }
    cout << ans << el;
    return 0;
}

int main() {
    int t = 1;
    cin >> t;
    rep(i, 0, t) {
        solve();
    }
    return 0;
}

Submission Info

Judge Result