Submission #2211631
Source Code Expand
from collections import defaultdict s = input() s_set = set(s) count_min = 100 count = 0 for i in s_set: s_copy = s while True: t = "" if s_copy == i*len(s_copy): break for j in range(len(s_copy)-1): if s_copy[j] == i or s_copy[j+1] == i: t += i else: t += "?" s_copy = t count += 1 count_min = min(count_min,count) count = 0 print(count_min)
Submission Info
Submission Time | |
---|---|
Task | A - Shrinking |
User | integralyamada |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 488 Byte |
Status | AC |
Exec Time | 49 ms |
Memory | 3316 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 | 20 ms | 3316 KB |
0_01.txt | AC | 20 ms | 3316 KB |
0_02.txt | AC | 20 ms | 3316 KB |
0_03.txt | AC | 22 ms | 3316 KB |
1_00.txt | AC | 20 ms | 3316 KB |
1_01.txt | AC | 22 ms | 3316 KB |
1_02.txt | AC | 20 ms | 3316 KB |
1_03.txt | AC | 20 ms | 3316 KB |
1_04.txt | AC | 21 ms | 3316 KB |
1_05.txt | AC | 22 ms | 3316 KB |
1_06.txt | AC | 25 ms | 3316 KB |
1_07.txt | AC | 27 ms | 3316 KB |
1_08.txt | AC | 38 ms | 3316 KB |
1_09.txt | AC | 49 ms | 3316 KB |