Submission #2698329


Source Code Expand

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

if len(set(S)) == 1:
	print(len(S))
else:
	succ = []
	num = 1
	for i in range(1, n):
		if S[i] == S[i-1]:
			num += 1
			if i == n-1:
				succ.append(num)
		else:
			succ.append(num)
			num = 1
			if i == n-1:
				succ.append(num)

	ans = 2
	if len(succ) == 2:
		print(max(succ))
	else:
		for i in range(1, len(succ)-1):
			m = min(succ[i-1] + succ[i], succ[i] + succ[i+1])
			if ans < m:
				ans = m

		print(ans)

Submission Info

Submission Time
Task D - Wide Flip
User anagohirame
Language Python (3.4.3)
Score 0
Code Size 488 Byte
Status WA
Exec Time 99 ms
Memory 4776 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 94 ms 4772 KB
02.txt WA 99 ms 4648 KB
03.txt WA 96 ms 4644 KB
04.txt WA 98 ms 4644 KB
05.txt WA 87 ms 4776 KB
06.txt WA 78 ms 4772 KB
07.txt WA 66 ms 4772 KB
08.txt WA 77 ms 4648 KB
09.txt WA 87 ms 4772 KB
10.txt WA 87 ms 4648 KB
11.txt WA 84 ms 4648 KB
12.txt WA 72 ms 4644 KB
13.txt WA 82 ms 4772 KB
14.txt WA 92 ms 4772 KB
15.txt WA 93 ms 4776 KB
16.txt WA 87 ms 4648 KB
17.txt AC 33 ms 4776 KB
18.txt AC 33 ms 4776 KB
19.txt AC 33 ms 4776 KB
20.txt AC 33 ms 4776 KB
21.txt AC 17 ms 3064 KB
22.txt AC 17 ms 3064 KB
23.txt AC 17 ms 3064 KB
24.txt AC 17 ms 3064 KB
25.txt AC 17 ms 3064 KB
26.txt AC 17 ms 3064 KB
27.txt AC 17 ms 3064 KB
s1.txt AC 17 ms 3064 KB
s2.txt AC 17 ms 3064 KB
s3.txt AC 17 ms 3064 KB