Submission #3724083
Source Code Expand
s = input() K = int(input()) dict1 = {} for i in range(len(s)): if s[i] in dict1: continue else: dict1[s[i]] = len(s) - i dict1 = list(dict1.items()) dict1.sort() count = 0 for e in dict1: count += e[1] if count >= K: note = e[0] break part_list = [] for i in range(len(s)): if ord(s[i]) <= ord(note): for j in range(i+1,i+6): part = s[i:j] part_list.append(part) part_list = list(set(part_list)) part_list.sort() ans = part_list[K-1] print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - K-th Substring |
User | pynomi |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 554 Byte |
Status | AC |
Exec Time | 31 ms |
Memory | 4340 KB |
Judge Result
Set Name | Sample | Subtask | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | 100 / 100 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | 0_000.txt, 0_001.txt, 0_002.txt |
Subtask | 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt |
All | 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 2_011.txt, 2_012.txt, 2_013.txt, 2_014.txt, 2_015.txt, 2_016.txt, 2_017.txt, 2_018.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_000.txt | AC | 18 ms | 3064 KB |
0_001.txt | AC | 18 ms | 3064 KB |
0_002.txt | AC | 18 ms | 3064 KB |
1_003.txt | AC | 18 ms | 3064 KB |
1_004.txt | AC | 18 ms | 3064 KB |
1_005.txt | AC | 18 ms | 3064 KB |
1_006.txt | AC | 18 ms | 3064 KB |
1_007.txt | AC | 18 ms | 3064 KB |
1_008.txt | AC | 18 ms | 3064 KB |
1_009.txt | AC | 18 ms | 3064 KB |
1_010.txt | AC | 18 ms | 3064 KB |
2_011.txt | AC | 31 ms | 4212 KB |
2_012.txt | AC | 31 ms | 4340 KB |
2_013.txt | AC | 20 ms | 3064 KB |
2_014.txt | AC | 20 ms | 3064 KB |
2_015.txt | AC | 20 ms | 3064 KB |
2_016.txt | AC | 21 ms | 3064 KB |
2_017.txt | AC | 21 ms | 3064 KB |
2_018.txt | AC | 21 ms | 3064 KB |