QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#872043 | #9229. Juliet Unifies Ones | anahartmann | WA | 1ms | 3712kb | C++14 | 1.2kb | 2025-01-25 23:25:39 | 2025-01-25 23:25:40 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
int qt = 0, um = 0, zero = 0;
for (int i = 0; i < (int)s.size(); i++)
{
if (s[i] == '1' && um == 0)
{
um = 1;
zero = 0;
}
else if (s[i] == '1' && zero > 0)
{
qt += min(um, zero);
zero = 0;
}
else if (s[i] == '1')
{
um++;
}
else if (s[i] == '0')
{
zero++;
}
}
int qt2 = 0;
um = zero = 0;
for (int i = (int)s.size() - 1; i >= 0; i--)
{
if (s[i] == '1' && um == 0)
{
um += 1;
zero = 0;
}
else if (s[i] == '1' && zero > 0)
{
qt2 += min(um, zero);
// cout << i << " " << qt2 << "\n";
zero = 0;
}
else if (s[i] == '1')
{
um++;
}
else if (s[i] == '0')
{
zero++;
}
}
qt = min(qt, qt2);
cout << qt << "\n";
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3584kb
input:
00011011001
output:
2
result:
ok 1 number(s): "2"
Test #2:
score: 0
Accepted
time: 1ms
memory: 3712kb
input:
11101111111111111101001011110111111110011101010110
output:
11
result:
ok 1 number(s): "11"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
00000000100000000000100000010001000
output:
3
result:
ok 1 number(s): "3"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3712kb
input:
00000000000000000000000000000000000000000000000000
output:
0
result:
ok 1 number(s): "0"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3712kb
input:
00000000100000000000100000011000
output:
2
result:
ok 1 number(s): "2"
Test #6:
score: -100
Wrong Answer
time: 0ms
memory: 3712kb
input:
11000010100100000011101100000001000100000000000000
output:
14
result:
wrong answer 1st numbers differ - expected: '8', found: '14'