QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#618690 | #9229. Juliet Unifies Ones | kkzyr | WA | 1ms | 3812kb | C++17 | 711b | 2024-10-07 06:59:18 | 2024-10-07 06:59:19 |
Judging History
answer
#include <iostream>
#include <string>
using namespace std;
int n;
string s;
int main(){
cin >> s;
n = (int)s.size();
s = 'a' + s;
int ans = 1e9;
for (int i = 1;i <= n;i++){
for (int j = i;j <= n;j++){
int cnt = 0;
for (int k = 1;k <= n;k++){
if (k >= i and k <= j){
if (s[k] == '0'){
cnt++;
}
}
else{
if (s[k] == '1'){
cnt++;
}
}
}
ans = min(ans, cnt);
}
}
cout << ans << '\n';
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3796kb
input:
00011011001
output:
2
result:
ok 1 number(s): "2"
Test #2:
score: 0
Accepted
time: 1ms
memory: 3812kb
input:
11101111111111111101001011110111111110011101010110
output:
11
result:
ok 1 number(s): "11"
Test #3:
score: 0
Accepted
time: 1ms
memory: 3516kb
input:
00000000100000000000100000010001000
output:
3
result:
ok 1 number(s): "3"
Test #4:
score: -100
Wrong Answer
time: 1ms
memory: 3468kb
input:
00000000000000000000000000000000000000000000000000
output:
1
result:
wrong answer 1st numbers differ - expected: '0', found: '1'