Submission #3735050


Source Code Expand

n = input()
# 1回の処理で、1文字減、連続部分1増
# 最悪でも「len(n)/2」回で終了

# 全ての文字に対し
# それぞれで統一する場合を全部試しても良さそう

score = 1000
left = 0
for i in range(len(n)):
    alpha = n[i] # i文字目で統一する場合を考える
    _left = 0
    left = 0
    for j in range(len(n)):
        if n[j] != alpha:
            _left += 1
        else:
            left = max(left, _left)
            _left = 0
    left = max(left, _left)
    score = min(score, left)
print(score)

Submission Info

Submission Time
Task A - Shrinking
User shunsasa
Language Python (3.4.3)
Score 300
Code Size 577 Byte
Status AC
Exec Time 20 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 14
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt
Case Name Status Exec Time Memory
0_00.txt AC 17 ms 2940 KB
0_01.txt AC 17 ms 2940 KB
0_02.txt AC 17 ms 3064 KB
0_03.txt AC 17 ms 3060 KB
1_00.txt AC 17 ms 3060 KB
1_01.txt AC 20 ms 3064 KB
1_02.txt AC 20 ms 3064 KB
1_03.txt AC 19 ms 2940 KB
1_04.txt AC 19 ms 3064 KB
1_05.txt AC 19 ms 3064 KB
1_06.txt AC 19 ms 3064 KB
1_07.txt AC 18 ms 3060 KB
1_08.txt AC 18 ms 3064 KB
1_09.txt AC 19 ms 2940 KB