Submission #14,345

2025-01-10 16:54:50

cpp17

Accepted 50/50

18ms

404 KiB

#include <iostream>
#include <algorithm>
using namespace std;

int main() {
	long long n, k, f = 0, routes = 0;
	cin >> n >> k;
	for (int i = 0; i < n; i++) {
		int b;
		cin >> b;
		if (b) f++;
	}
	for (int i = 1; i <= f; i++) {
		routes += max((long long)0, f - i - k + 2);
	}
	cout << routes;
	return 0;
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	1ms	316 KiB
		3	Accepted	0/0	18ms	316 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	1ms	316 KiB
		13	Accepted	3/3	1ms	328 KiB
		14	Accepted	2/2	17ms	400 KiB
		15	Accepted	2/2	17ms	404 KiB
		16	Accepted	3/3	17ms	396 KiB
		17	Accepted	3/3	17ms	400 KiB
		18	Accepted	3/3	18ms	404 KiB
		19	Accepted	3/3	18ms	400 KiB
		20	Accepted	3/3	18ms	316 KiB
		21	Accepted	3/3	18ms	400 KiB
		22	Accepted	3/3	17ms	316 KiB