Submission #61151611

Source Code Expand

from collections import defaultdict, deque
import bisect
import math
from heapq import *
import itertools
import sys
sys.setrecursionlimit(10**8)

S = input()
pre = ''
ans = 0
for s in S:
    if s == '0':
        if pre == '0':
            pre = ''
            continue
        else:
            pre = s
            ans += 1
    else:
        pre = s
        ans += 1
print(ans)

Submission Info

Submission Time
Task B - Calculator
User flourpoke
Language Python (PyPy 3.10-v7.3.12)
Score 200
Code Size 378 Byte
Status AC
Exec Time 79 ms
Memory 77064 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 19
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt
Case Name Status Exec Time Memory
sample_01.txt AC 74 ms 76944 KiB
sample_02.txt AC 76 ms 76984 KiB
sample_03.txt AC 76 ms 76776 KiB
test_01.txt AC 76 ms 77064 KiB
test_02.txt AC 75 ms 76772 KiB
test_03.txt AC 74 ms 76700 KiB
test_04.txt AC 78 ms 76732 KiB
test_05.txt AC 76 ms 76780 KiB
test_06.txt AC 79 ms 76996 KiB
test_07.txt AC 78 ms 76720 KiB
test_08.txt AC 78 ms 76948 KiB
test_09.txt AC 77 ms 77032 KiB
test_10.txt AC 76 ms 76900 KiB
test_11.txt AC 73 ms 76772 KiB
test_12.txt AC 73 ms 76856 KiB
test_13.txt AC 74 ms 76684 KiB
test_14.txt AC 75 ms 76884 KiB
test_15.txt AC 74 ms 76860 KiB
test_16.txt AC 76 ms 76768 KiB