QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #532294 | #9229. Juliet Unifies Ones | ucup-team3695# | WA | 20ms | 10620kb | Python3 | 203b | 2024-08-25 02:12:48 | 2024-08-25 02:12:49 |
Judging History
answer
s=input();n=len(s)
best=n
for i in range(n):
for j in range(i,n):
t=0
for k in range(n):
if i<=k<=j:
if s[k]=='0':t+=1
else:
if s[k]=='1':t+=1
best=min(best,t)
print(best)
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 8ms
memory: 10588kb
input:
00011011001
output:
2
result:
ok 1 number(s): "2"
Test #2:
score: 0
Accepted
time: 20ms
memory: 10584kb
input:
11101111111111111101001011110111111110011101010110
output:
11
result:
ok 1 number(s): "11"
Test #3:
score: 0
Accepted
time: 6ms
memory: 10464kb
input:
00000000100000000000100000010001000
output:
3
result:
ok 1 number(s): "3"
Test #4:
score: -100
Wrong Answer
time: 16ms
memory: 10620kb
input:
00000000000000000000000000000000000000000000000000
output:
1
result:
wrong answer 1st numbers differ - expected: '0', found: '1'