QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #534008 | #9229. Juliet Unifies Ones | xiachi | WA | 1ms | 3596kb | C++14 | 730b | 2024-08-26 18:31:01 | 2024-08-26 18:31:02 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
while (!s.empty() && ~s.back() & 1) s.pop_back();
reverse(s.begin(), s.end());
while (!s.empty() && ~s.back() & 1) s.pop_back();
if (!s.empty()) {
int n = s.size();
vector<int> pre(n + 1);
for (int i = 1; i <= n; i++) {
pre[i] = pre[i - 1] + (s[i - 1] & 1);
}
int res = min(pre[n], n - pre[n]);
for (int i = 1; i < n; i++) {
res = min(res, pre[i] + (n - i - (pre[n] - pre[i])));
res = min(res, (i - pre[i]) + (pre[n] - pre[i]));
}
cout << res;
} else {
cout << 0;
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3528kb
input:
00011011001
output:
2
result:
ok 1 number(s): "2"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
11101111111111111101001011110111111110011101010110
output:
11
result:
ok 1 number(s): "11"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3508kb
input:
00000000100000000000100000010001000
output:
3
result:
ok 1 number(s): "3"
Test #4:
score: 0
Accepted
time: 1ms
memory: 3592kb
input:
00000000000000000000000000000000000000000000000000
output:
0
result:
ok 1 number(s): "0"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
00000000100000000000100000011000
output:
2
result:
ok 1 number(s): "2"
Test #6:
score: -100
Wrong Answer
time: 0ms
memory: 3592kb
input:
11000010100100000011101100000001000100000000000000
output:
10
result:
wrong answer 1st numbers differ - expected: '8', found: '10'