Submission #3734681
Source Code Expand
s = input() N = len(s) table = {} for i in range(N): table[s[i]] = table.get(s[i], []) table[s[i]] += [i] ans = 100 for k, nums in table.items(): ans = min(ans, max([nums[0], N - 1 - nums[-1]] + [(nums[i + 1] - nums[i] - 1) for i in range(len(nums) - 1)])) print(ans)
Submission Info
Submission Time | |
---|---|
Task | A - Shrinking |
User | yydoco |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 314 Byte |
Status | AC |
Exec Time | 18 ms |
Memory | 3064 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 | 17 ms | 3060 KB |
0_01.txt | AC | 17 ms | 2940 KB |
0_02.txt | AC | 17 ms | 3060 KB |
0_03.txt | AC | 17 ms | 3064 KB |
1_00.txt | AC | 17 ms | 3060 KB |
1_01.txt | AC | 18 ms | 3060 KB |
1_02.txt | AC | 18 ms | 3060 KB |
1_03.txt | AC | 18 ms | 3060 KB |
1_04.txt | AC | 18 ms | 3060 KB |
1_05.txt | AC | 18 ms | 3064 KB |
1_06.txt | AC | 17 ms | 3060 KB |
1_07.txt | AC | 18 ms | 3064 KB |
1_08.txt | AC | 17 ms | 3064 KB |
1_09.txt | AC | 17 ms | 3064 KB |