Submission #14,355

2025-01-10 17:17:50

cpp17

Wrong answer 42/50

18ms

508 KiB

#include <list>
#include <iostream>
#include <vector>
#include <bitset>
#include <algorithm>

using namespace std;

int main() {

    int n, k;
    cin >> n >> k;

    int true_fields = 0;
    int sol = 0;
    for (int i = 0; i < n; i++) {
        bool field;
        cin >> field;

        if (field) {
            true_fields++;
            if (true_fields >= k) sol += true_fields - k + 1;
        }
    }

    cout << sol;

    return 0;
}

// m - k + 1, m - k, 1

	Sum	Test	Verdict		Time	Memory
base	42/50
		1	Accepted	0/0	1ms	508 KiB
		2	Accepted	0/0	1ms	508 KiB
		3	Accepted	0/0	18ms	396 KiB
		4	Accepted	2/2	1ms	316 KiB
		5	Accepted	2/2	1ms	316 KiB
		6	Accepted	2/2	1ms	316 KiB
		7	Accepted	3/3	1ms	316 KiB
		8	Accepted	3/3	1ms	316 KiB
		9	Accepted	3/3	1ms	316 KiB
		10	Accepted	2/2	1ms	316 KiB
		11	Accepted	3/3	1ms	316 KiB
		12	Accepted	2/2	2ms	316 KiB
		13	Accepted	3/3	2ms	316 KiB
		14	Accepted	2/2	17ms	400 KiB
		15	Wrong answer	0/2	17ms	400 KiB
		16	Accepted	3/3	18ms	396 KiB
		17	Accepted	3/3	17ms	316 KiB
		18	Wrong answer	0/3	18ms	400 KiB
		19	Accepted	3/3	18ms	400 KiB
		20	Accepted	3/3	18ms	400 KiB
		21	Accepted	3/3	18ms	508 KiB
		22	Wrong answer	0/3	18ms	316 KiB