QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #555359 | #9229. Juliet Unifies Ones | yg# | WA | 0ms | 3796kb | C++14 | 684b | 2024-09-09 22:05:17 | 2024-09-09 22:05:17 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int a[51];
int main(){
string s;
cin>>s;
int cnt1=0,cnt2=0;
int tmp=0;
bool flag=0;
for(int i=0;s[i]!='\0';i++){
if((s[i]=='1'&&s[i-1]=='0'&&i>0)||(s[i]=='0'&&s[i-1]=='1'&&i>0)){
tmp++;
}
a[tmp]++;
}
int ans=0,sum=0;
//cout<<s.back()<<endl;
if(s.back()=='0'){
tmp--;
}
int i=0;
if(s[0]=='0'){
i=1;
}
else{
i=0;
}
for(i;i<=tmp;i+=2){
sum+=a[i];
if(tmp-i==2){
ans+=min(min(sum,a[tmp-1]),a[tmp]);
break;
}
else if(tmp-i>2){
if(sum<=a[i+1]){
sum=0;
ans+=a[i];
}
else{
ans+=a[i+1];
}
}
}
cout<<ans<<endl;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3504kb
input:
00011011001
output:
2
result:
ok 1 number(s): "2"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
11101111111111111101001011110111111110011101010110
output:
11
result:
ok 1 number(s): "11"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3568kb
input:
00000000100000000000100000010001000
output:
3
result:
ok 1 number(s): "3"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3460kb
input:
00000000000000000000000000000000000000000000000000
output:
0
result:
ok 1 number(s): "0"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3796kb
input:
00000000100000000000100000011000
output:
2
result:
ok 1 number(s): "2"
Test #6:
score: -100
Wrong Answer
time: 0ms
memory: 3536kb
input:
11000010100100000011101100000001000100000000000000
output:
9
result:
wrong answer 1st numbers differ - expected: '8', found: '9'