230202026-01-16 10:47:48PKBTakaros Sorozat (80 pont)cpp17Wrong answer 64/804ms568 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
	string s;
	cin >> n >> s;
	int o_veg = count(s.begin(), s.end(), '0');



	int I_kezdes = 0;

	int minimum = o_veg;


	for (int i = 0; i < n; i++) {
		if (s[i] == '1') {
            I_kezdes++;
		} else {
		    o_veg--;
		}

		if (I_kezdes + o_veg < minimum) {
            minimum = I_kezdes + o_veg;
		}
	}

	cout << minimum << "\n";
	cout << minimum - minimum / 2;
}
SubtaskSumTestVerdictTimeMemory
base64/80
1Accepted0/01ms316 KiB
2Wrong answer0/04ms564 KiB
3Accepted4/41ms316 KiB
4Accepted4/41ms316 KiB
5Accepted4/41ms316 KiB
6Accepted4/41ms316 KiB
7Accepted4/41ms528 KiB
8Partially correct2/41ms316 KiB
9Accepted4/41ms560 KiB
10Partially correct2/41ms316 KiB
11Accepted4/41ms316 KiB
12Accepted4/41ms316 KiB
13Accepted4/43ms564 KiB
14Accepted4/43ms564 KiB
15Accepted4/44ms504 KiB
16Accepted4/44ms564 KiB
17Partially correct2/44ms564 KiB
18Partially correct2/44ms456 KiB
19Partially correct2/43ms568 KiB
20Partially correct2/44ms428 KiB
21Partially correct2/44ms564 KiB
22Partially correct2/44ms456 KiB