Submission #3772046

Source Code Expand

s = input()
ans = 1e9
for alpha in "abcdefghijklmnopqrstuvwxyz":
    cur = list(s)
    cnt = 0
    while len(set(cur))>1:
        # print(alpha, cnt, cur)
        for i in range(1,len(cur)):
            if cur[i]==alpha:
                cur[i-1]=alpha
        cur.pop()
        cnt += 1
    ans = min(ans, cnt)
print(ans)

Submission Info

Submission Time
Task A - Shrinking
User odanny
Language Python (3.4.3)
Score 300
Code Size 334 Byte
Status AC
Exec Time 33 ms
Memory 3060 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 18 ms 3060 KB
0_01.txt AC 18 ms 3060 KB
0_02.txt AC 18 ms 3060 KB
0_03.txt AC 19 ms 2940 KB
1_00.txt AC 18 ms 3060 KB
1_01.txt AC 30 ms 3060 KB
1_02.txt AC 18 ms 2940 KB
1_03.txt AC 29 ms 3060 KB
1_04.txt AC 29 ms 3060 KB
1_05.txt AC 28 ms 2940 KB
1_06.txt AC 28 ms 2940 KB
1_07.txt AC 25 ms 2940 KB
1_08.txt AC 32 ms 3060 KB
1_09.txt AC 33 ms 2940 KB