QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#724738 | #9229. Juliet Unifies Ones | Okuchiri# | WA | 0ms | 3704kb | C++20 | 687b | 2024-11-08 14:51:02 | 2024-11-08 14:51:03 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
using namespace std;
string s;
ll ans=1e18;
ll q[101];
void solve()
{
cin>>s;
ll n=s.length();
for(int i=1;i<=n;i++)
{
q[i]=q[i-1]+(s[i]=='1');
}
if(q[n]==0)
{
cout<<0;
return;
}
for(int i=1;i<=n;i++)
{
for(int j=i;j<=n;j++)
{
ll len=j-i+1;
ans=min(ans,len-(q[j]-q[i-1])+q[n]-(q[j]-q[i-1]));
}
}
cout<<ans;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll T = 1;
// cin >> T;
while(T--)
{
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3684kb
input:
00011011001
output:
2
result:
ok 1 number(s): "2"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3552kb
input:
11101111111111111101001011110111111110011101010110
output:
11
result:
ok 1 number(s): "11"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
00000000100000000000100000010001000
output:
3
result:
ok 1 number(s): "3"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3704kb
input:
00000000000000000000000000000000000000000000000000
output:
0
result:
ok 1 number(s): "0"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
00000000100000000000100000011000
output:
2
result:
ok 1 number(s): "2"
Test #6:
score: -100
Wrong Answer
time: 0ms
memory: 3556kb
input:
11000010100100000011101100000001000100000000000000
output:
7
result:
wrong answer 1st numbers differ - expected: '8', found: '7'