Submission #2698836


Source Code Expand

s = input()
s = list(map(int, list(s)))
 
now = s[0]
cnt = 0
stack = []
for e in s:
    if now == e:
        cnt += 1
    else:
        stack.append(cnt)
        cnt = 1
        now = e
stack.append(cnt)
 
# print(stack)
 
l = len(stack)
ans = -1
if l == 1:
    ans = len(s)
elif l == 2:
    ans = max(stack)
else:
    for i in range(l-1):
        tmp = stack[i] + stack[i+1]
        ans = max(ans, tmp)
 
print(ans)

Submission Info

Submission Time
Task D - Wide Flip
User Gobi
Language PyPy3 (2.4.0)
Score 0
Code Size 446 Byte
Status WA
Exec Time 210 ms
Memory 49784 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 3
AC × 14
WA × 16
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt WA 210 ms 49784 KB
02.txt WA 196 ms 49392 KB
03.txt WA 199 ms 49392 KB
04.txt WA 196 ms 49392 KB
05.txt WA 195 ms 49392 KB
06.txt WA 196 ms 49392 KB
07.txt WA 200 ms 49392 KB
08.txt WA 209 ms 49392 KB
09.txt WA 197 ms 49392 KB
10.txt WA 195 ms 49392 KB
11.txt WA 196 ms 49392 KB
12.txt WA 196 ms 49392 KB
13.txt WA 197 ms 49392 KB
14.txt WA 198 ms 49392 KB
15.txt WA 197 ms 49392 KB
16.txt WA 197 ms 49392 KB
17.txt AC 188 ms 49392 KB
18.txt AC 189 ms 49392 KB
19.txt AC 189 ms 49392 KB
20.txt AC 205 ms 49392 KB
21.txt AC 160 ms 38256 KB
22.txt AC 171 ms 38256 KB
23.txt AC 163 ms 38256 KB
24.txt AC 176 ms 38256 KB
25.txt AC 163 ms 38256 KB
26.txt AC 164 ms 38256 KB
27.txt AC 159 ms 38256 KB
s1.txt AC 162 ms 38256 KB
s2.txt AC 162 ms 38256 KB
s3.txt AC 162 ms 38256 KB