Submission #1910854

Source Code Expand

l = list(raw_input())

s = l[0]
f = False
mx = 0
x = 0
for i, n in enumerate(l):
    if not n == s:
        mx = max(mx, min(i, len(l)-x))
        x = i
        s = n
else:
    mx = max(mx, min(i+1, len(l)-x))
print mx

Submission Info

Submission Time
Task D - Wide Flip
User pikachu1101
Language Python (2.7.6)
Score 500
Code Size 233 Byte
Status AC
Exec Time 45 ms
Memory 3460 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 30
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 AC 45 ms 3460 KB
02.txt AC 45 ms 3460 KB
03.txt AC 44 ms 3460 KB
04.txt AC 44 ms 3460 KB
05.txt AC 39 ms 3460 KB
06.txt AC 29 ms 3460 KB
07.txt AC 23 ms 3460 KB
08.txt AC 27 ms 3460 KB
09.txt AC 39 ms 3460 KB
10.txt AC 39 ms 3460 KB
11.txt AC 37 ms 3460 KB
12.txt AC 28 ms 3460 KB
13.txt AC 34 ms 3460 KB
14.txt AC 43 ms 3460 KB
15.txt AC 44 ms 3460 KB
16.txt AC 38 ms 3460 KB
17.txt AC 20 ms 3460 KB
18.txt AC 20 ms 3460 KB
19.txt AC 20 ms 3460 KB
20.txt AC 21 ms 3460 KB
21.txt AC 10 ms 2568 KB
22.txt AC 13 ms 2692 KB
23.txt AC 10 ms 2568 KB
24.txt AC 10 ms 2568 KB
25.txt AC 10 ms 2568 KB
26.txt AC 10 ms 2568 KB
27.txt AC 10 ms 2568 KB
s1.txt AC 10 ms 2568 KB
s2.txt AC 10 ms 2568 KB
s3.txt AC 10 ms 2568 KB