QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#529411 | #9229. Juliet Unifies Ones | ucup-team3474# | WA | 0ms | 3744kb | C++23 | 962b | 2024-08-24 13:07:26 | 2024-08-24 13:07:27 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=1919810;
typedef long long ll;
typedef pair<ll,ll> PII;
int n,m,k;
ll a[N],b[N];
char s[N];
void __(){
scanf("%s",s+1);
n=strlen(s+1);
vector<PII> v;
int now=s[1]-'0';
int cnt=0;
for(int i=1;i<=n;i++){
int t=s[i]-'0';
if(t==now){
cnt++;
}else{
v.push_back({now,cnt});
cnt=1;
now=t;
}
}
v.push_back({now,cnt});
int ans=n+1;
int now1=0,now2=0;
bool flag=0;
for(int i=0;i<v.size();i++){
int t=v[i].first;
now1+=v[i].second;
if(t==1){
flag=1;
ans=min(ans,n-now1+now2);
}else{
ans=min(ans,n-now1+now2);
if(flag) now2+=v[i].second;
}
}
cout<<ans<<endl;
}
int main(){
int _=1;
// cin>>_;
while(_--){
__();
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3744kb
input:
00011011001
output:
2
result:
ok 1 number(s): "2"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3704kb
input:
11101111111111111101001011110111111110011101010110
output:
11
result:
ok 1 number(s): "11"
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3676kb
input:
00000000100000000000100000010001000
output:
15
result:
wrong answer 1st numbers differ - expected: '3', found: '15'