Submission #18594904


Source Code Expand

def forsmallN(N,T):
    if N == 1:
        if T == "1":
            print(2*10**10)
        else:
            print(10**10)
    elif N == 2:
        if T == '11':
            print(10**10)
        elif T == '10':
            print(10**10)
        elif T == '01':
            print(10**10 - 1)
    elif N == 3:
        if T == '110':
            print(10**10)
        else:
            print(10**10-1)
    return


N = int(input())
T = input()

if N <= 3:
    forsmallN(N,T)
    exit()

cutstart=  0
cutend = N
for i in range(N):
    if T[i:i+3] == '110':
        cutstart = i
        break

for j in range(N,0,-1):
    if T[j-3:j] == '110':
        cutend = j
        break

tofind = T[:cutstart] + T[cutend:]
if not tofind:
    tofind = T


crit = '1101100'
endcrit = '011011'
endstr = T[-3:]

shortN = '110' * (len(tofind)//3)


start = 0
end = 0
for i in range(3):
    if T[:3] == crit[i:i+3] and not start:

        start = i

    if endstr[::-1] == endcrit[i:i+3] and not end:

        end = 3 * (10**10) -i


ans = (end - start - N)//3 + 1
if ans > 0:
    print(ans)
else:
    print(0)

Submission Info

Submission Time
Task B - Many 110
User noyan
Language Python (3.8.2)
Score 0
Code Size 1159 Byte
Status WA
Exec Time 92 ms
Memory 9416 KiB

Judge Result

Set Name All Sample
Score / Max Score 0 / 400 0 / 0
Status
AC × 21
WA × 11
AC × 2
Set Name Test Cases
All sample_01.txt, sample_02.txt, testcase_1.txt, testcase_10.txt, testcase_11.txt, testcase_12.txt, testcase_13.txt, testcase_14.txt, testcase_15.txt, testcase_16.txt, testcase_17.txt, testcase_18.txt, testcase_19.txt, testcase_2.txt, testcase_20.txt, testcase_21.txt, testcase_22.txt, testcase_23.txt, testcase_24.txt, testcase_25.txt, testcase_26.txt, testcase_27.txt, testcase_28.txt, testcase_29.txt, testcase_3.txt, testcase_30.txt, testcase_4.txt, testcase_5.txt, testcase_6.txt, testcase_7.txt, testcase_8.txt, testcase_9.txt
Sample sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
sample_01.txt AC 17 ms 9084 KiB
sample_02.txt AC 20 ms 8980 KiB
testcase_1.txt AC 17 ms 9128 KiB
testcase_10.txt AC 22 ms 9056 KiB
testcase_11.txt WA 20 ms 9092 KiB
testcase_12.txt AC 21 ms 9052 KiB
testcase_13.txt AC 17 ms 9096 KiB
testcase_14.txt WA 17 ms 9100 KiB
testcase_15.txt AC 20 ms 9352 KiB
testcase_16.txt AC 90 ms 9404 KiB
testcase_17.txt AC 92 ms 9416 KiB
testcase_18.txt AC 19 ms 9224 KiB
testcase_19.txt AC 17 ms 9088 KiB
testcase_2.txt AC 19 ms 8980 KiB
testcase_20.txt AC 17 ms 9304 KiB
testcase_21.txt AC 18 ms 9220 KiB
testcase_22.txt AC 23 ms 9240 KiB
testcase_23.txt AC 18 ms 9188 KiB
testcase_24.txt AC 19 ms 9180 KiB
testcase_25.txt WA 23 ms 9284 KiB
testcase_26.txt AC 18 ms 9304 KiB
testcase_27.txt WA 21 ms 9236 KiB
testcase_28.txt WA 17 ms 9120 KiB
testcase_29.txt WA 22 ms 9068 KiB
testcase_3.txt WA 18 ms 9092 KiB
testcase_30.txt WA 17 ms 9148 KiB
testcase_4.txt AC 23 ms 8980 KiB
testcase_5.txt AC 17 ms 9096 KiB
testcase_6.txt AC 25 ms 9172 KiB
testcase_7.txt WA 17 ms 9168 KiB
testcase_8.txt WA 21 ms 9068 KiB
testcase_9.txt WA 18 ms 9072 KiB