QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #686788 | #9229. Juliet Unifies Ones | _Veritas# | WA | 0ms | 3704kb | C++14 | 476b | 2024-10-29 15:41:13 | 2024-10-29 15:41:14 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
char s[100];
int n,cnt,p[100];
int sum[100];
int main(){
cin>>(s+1);
n=strlen(s+1);
for(int i=1;i<=n;++i) if(s[i]=='1') p[++cnt]=i;
for(int i=1;i<=n;++i) sum[i]=sum[i-1]+(s[i]=='0');
int ans = n;
for(int i=0;i<=cnt;++i){
for(int j=0;i+j<=cnt;++j){
// cout<<i<<" "<<j<<" "<<i+j+sum[p[cnt-j]]-sum[p[i+1]-1]<<endl;
ans = min(ans, i+j+sum[p[cnt-j]]-sum[p[i+1]-1]);
}
}
cout<<ans;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3628kb
input:
00011011001
output:
2
result:
ok 1 number(s): "2"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
11101111111111111101001011110111111110011101010110
output:
11
result:
ok 1 number(s): "11"
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3704kb
input:
00000000100000000000100000010001000
output:
-7
result:
wrong answer 1st numbers differ - expected: '3', found: '-7'