QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#535600 | #9229. Juliet Unifies Ones | thangthang# | WA | 0ms | 3580kb | C++20 | 552b | 2024-08-28 10:53:13 | 2024-08-28 10:53:14 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
void solve(){
string s; cin >> s; int n = s.size(); s = ' ' + s;
vector <int> pref(n + 1, 0); int ans = n;
for (int i = 1; i <= n; ++ i){
pref[i] = pref[i - 1] + (s[i] - '0');
}
for (int l = 1; l <= n; ++ l) for (int r = l; r <= n; ++ r) ans = min(ans, r - l + 1 - pref[r] + pref[l - 1] + pref[n] - pref[r] + pref[l - 1]);
cout << ans;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3552kb
input:
00011011001
output:
2
result:
ok 1 number(s): "2"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3560kb
input:
11101111111111111101001011110111111110011101010110
output:
11
result:
ok 1 number(s): "11"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
00000000100000000000100000010001000
output:
3
result:
ok 1 number(s): "3"
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 3500kb
input:
00000000000000000000000000000000000000000000000000
output:
1
result:
wrong answer 1st numbers differ - expected: '0', found: '1'