Submission #4981941

Source Code Expand

n,k = map(int,input().split())
s = input()

l = [0]

for i in range(n-1):
  if s[i] != s[i+1]:
    l.append(i+1)

l.append(n)

ans = 0
for i in range(len(l)-1):
  index = min(i+2*k + int(s[l[i]]=="1"), len(l)-1)
  ans = max(ans, l[index] - l[i])

print(ans)

Submission Info

Submission Time
Task D - Handstand
User yfujita
Language Python (3.4.3)
Score 400
Code Size 273 Byte
Status AC
Exec Time 166 ms
Memory 7156 KiB

Judge Result

Set Name All Sample
Score / Max Score 400 / 400 0 / 0
Status
AC × 18
AC × 3
Set Name Test Cases
All sample_01, sample_02, sample_03, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12, testcase_13, testcase_14, testcase_15
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
sample_01 AC 17 ms 3064 KiB
sample_02 AC 17 ms 3064 KiB
sample_03 AC 17 ms 3060 KiB
testcase_01 AC 31 ms 3312 KiB
testcase_02 AC 29 ms 3188 KiB
testcase_03 AC 92 ms 5180 KiB
testcase_04 AC 17 ms 3064 KiB
testcase_05 AC 150 ms 7156 KiB
testcase_06 AC 166 ms 7156 KiB
testcase_07 AC 148 ms 7028 KiB
testcase_08 AC 146 ms 7028 KiB
testcase_09 AC 147 ms 7028 KiB
testcase_10 AC 36 ms 3188 KiB
testcase_11 AC 28 ms 3188 KiB
testcase_12 AC 27 ms 3188 KiB
testcase_13 AC 34 ms 3316 KiB
testcase_14 AC 33 ms 3188 KiB
testcase_15 AC 17 ms 3060 KiB