QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#600088 | #9229. Juliet Unifies Ones | ucup-team4352# | WA | 0ms | 3648kb | C++23 | 590b | 2024-09-29 14:35:23 | 2024-09-29 14:35:24 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
#define pii pair<ll,ll>
#define lowbit(x) (x&-x)
#define log(x) (31^__builtin_clz(x))
using namespace std;
int t[55];
void solve(){
string s;
cin>>s;
int n=s.length();
s=" "+s;
for(int i=1;i<=n;i++){
t[i]=s[i]-48;
t[i]+=t[i-1];
}
int ans=n;
for(int i=1;i<=n;i++){
for(int j=i;j<=n;j++){
ans=min(ans,t[i-1]+t[n]-t[j]+(j-i+1-(t[j]-t[i-1])));
}
}
cout<<ans<<"\n";
}
int main(){
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t=1;
//cin>>t;
while(t--)solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3648kb
input:
00011011001
output:
2
result:
ok 1 number(s): "2"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3500kb
input:
11101111111111111101001011110111111110011101010110
output:
11
result:
ok 1 number(s): "11"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3520kb
input:
00000000100000000000100000010001000
output:
3
result:
ok 1 number(s): "3"
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 3556kb
input:
00000000000000000000000000000000000000000000000000
output:
1
result:
wrong answer 1st numbers differ - expected: '0', found: '1'