Submission #2698411

Source Code Expand

S = list(map(int, list(input())))
n = len(S)

if len(set(S)) == 1:
	print(len(S))
else:
	ans = 1000000
	for i in range(n-1):
		if S[i] != S[i+1]:
			m = max(n - i - 1, i + 1)
			if m < ans:
				ans = m

	print(ans)

Submission Info

Submission Time
Task D - Wide Flip
User anagohirame
Language Python (3.4.3)
Score 500
Code Size 227 Byte
Status AC
Exec Time 69 ms
Memory 4652 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 68 ms 4648 KB
02.txt AC 69 ms 4652 KB
03.txt AC 69 ms 4644 KB
04.txt AC 69 ms 4652 KB
05.txt AC 64 ms 4648 KB
06.txt AC 55 ms 4652 KB
07.txt AC 50 ms 4644 KB
08.txt AC 54 ms 4648 KB
09.txt AC 63 ms 4648 KB
10.txt AC 65 ms 4644 KB
11.txt AC 63 ms 4648 KB
12.txt AC 54 ms 4644 KB
13.txt AC 60 ms 4652 KB
14.txt AC 67 ms 4648 KB
15.txt AC 68 ms 4644 KB
16.txt AC 64 ms 4652 KB
17.txt AC 33 ms 4652 KB
18.txt AC 33 ms 4652 KB
19.txt AC 33 ms 4648 KB
20.txt AC 33 ms 4648 KB
21.txt AC 17 ms 3060 KB
22.txt AC 17 ms 3060 KB
23.txt AC 17 ms 2940 KB
24.txt AC 17 ms 3060 KB
25.txt AC 17 ms 3060 KB
26.txt AC 17 ms 3060 KB
27.txt AC 17 ms 2940 KB
s1.txt AC 17 ms 2940 KB
s2.txt AC 17 ms 3060 KB
s3.txt AC 17 ms 3060 KB