230182026-01-16 10:46:30PKBTakaros Sorozat (80 pont)cpp17Wrong answer 0/804ms564 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 << " ";
	cout << minimum - minimum / 2;
}
SubtaskSumTestVerdictTimeMemory
base0/80
1Wrong answer0/01ms316 KiB
2Wrong answer0/04ms564 KiB
3Wrong answer0/41ms316 KiB
4Wrong answer0/41ms316 KiB
5Wrong answer0/41ms316 KiB
6Wrong answer0/41ms316 KiB
7Wrong answer0/41ms316 KiB
8Wrong answer0/41ms500 KiB
9Wrong answer0/41ms508 KiB
10Wrong answer0/41ms320 KiB
11Wrong answer0/41ms316 KiB
12Wrong answer0/41ms316 KiB
13Wrong answer0/43ms508 KiB
14Wrong answer0/44ms564 KiB
15Wrong answer0/44ms564 KiB
16Wrong answer0/44ms564 KiB
17Wrong answer0/44ms488 KiB
18Wrong answer0/44ms428 KiB
19Wrong answer0/44ms564 KiB
20Wrong answer0/44ms564 KiB
21Wrong answer0/44ms564 KiB
22Wrong answer0/44ms564 KiB