Submission #8,252

2024-01-13 20:38:57

cpp17

Accepted 50/50

13ms

5724 KiB

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int MAXN = 200'001;

int a[MAXN], pref[MAXN];

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n, k; cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) {
        pref[i] = pref[i-1] + a[i];
    }
    ll ans = 0; int l = 0;
    for (int i = 1; i <= n; i++) {
        while (l <= i && pref[l] + k <= pref[i]) {
            l++;
        }
        if (a[i])
            ans += pref[l];
    }
    cout << ans << "\n";
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	3ms	1960 KiB
		2	Accepted	0/0	3ms	2104 KiB
		3	Accepted	0/0	12ms	4008 KiB
		4	Accepted	2/2	3ms	2480 KiB
		5	Accepted	2/2	3ms	2788 KiB
		6	Accepted	2/2	3ms	2864 KiB
		7	Accepted	3/3	3ms	3068 KiB
		8	Accepted	3/3	3ms	3268 KiB
		9	Accepted	3/3	2ms	3280 KiB
		10	Accepted	2/2	2ms	3276 KiB
		11	Accepted	3/3	3ms	3376 KiB
		12	Accepted	2/2	3ms	3360 KiB
		13	Accepted	3/3	3ms	3280 KiB
		14	Accepted	2/2	10ms	4904 KiB
		15	Accepted	2/2	9ms	5004 KiB
		16	Accepted	3/3	13ms	5016 KiB
		17	Accepted	3/3	10ms	5000 KiB
		18	Accepted	3/3	12ms	5144 KiB
		19	Accepted	3/3	10ms	5320 KiB
		20	Accepted	3/3	10ms	5256 KiB
		21	Accepted	3/3	13ms	5512 KiB
		22	Accepted	3/3	10ms	5724 KiB