QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#548638 | #9229. Juliet Unifies Ones | IceCang_# | WA | 0ms | 3556kb | C++23 | 468b | 2024-09-05 19:41:27 | 2024-09-05 19:41:28 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int pre[60];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int ans = INT_MAX;
string str;
cin>>str;
int l = str.length();
for(int i=0;i<l;i++) {
pre[i+1] = pre[i];
if(str[i]=='1') pre[i+1]++;
}
for(int i=1;i<=l;i++) {
ans = min(ans, i-1-pre[i-1]+pre[l]-pre[i-1]);
}
for(int i=1;i<=l;i++) {
ans = min(ans, pre[i-1]+(l-i+1-pre[l]+pre[i-1]));
}
cout<<ans;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3556kb
input:
00011011001
output:
3
result:
wrong answer 1st numbers differ - expected: '2', found: '3'