Submission #23,226

2026-01-16 18:02:54

python3

Accepted 50/50

97ms

4960 KiB

_, minFlowers = map(int, input().split())
possibleFields = list(map(int, input().split()))
resultCounter = 0
procFields = []
for i in range(0, len(possibleFields)):
    if possibleFields[i] == 1:
        procFields.append(1)
for i in range(0, len(procFields)):
    if i >= len(procFields) - minFlowers + 1:
        continue
    resultCounter += len(procFields) - i - minFlowers + 1
print(resultCounter)

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	16ms	3056 KiB
		2	Accepted	0/0	16ms	2864 KiB
		3	Accepted	0/0	50ms	4952 KiB
		4	Accepted	2/2	14ms	2880 KiB
		5	Accepted	2/2	16ms	3068 KiB
		6	Accepted	2/2	16ms	3092 KiB
		7	Accepted	3/3	14ms	2868 KiB
		8	Accepted	3/3	17ms	2972 KiB
		9	Accepted	3/3	17ms	2868 KiB
		10	Accepted	2/2	17ms	3072 KiB
		11	Accepted	3/3	16ms	3012 KiB
		12	Accepted	2/2	16ms	2992 KiB
		13	Accepted	3/3	16ms	2980 KiB
		14	Accepted	2/2	65ms	4568 KiB
		15	Accepted	2/2	92ms	4652 KiB
		16	Accepted	3/3	65ms	4716 KiB
		17	Accepted	3/3	50ms	4572 KiB
		18	Accepted	3/3	82ms	4820 KiB
		19	Accepted	3/3	45ms	4960 KiB
		20	Accepted	3/3	68ms	4948 KiB
		21	Accepted	3/3	61ms	4916 KiB
		22	Accepted	3/3	97ms	4960 KiB