Submission #4068775
Source Code Expand
from collections import Counter def ngram(text, n): return [text[i:i+n] for i in range(len(text) - n + 1)] text = input() k = int(input()) candidates = set() for n in range(1,len(text) + 1): #_ = filter(lambda x:x[1] == 1,Counter(ngram(text,n)).items()) candidates |= set(ngram(text,n)) print(sorted(list(candidates))[k-1])
Submission Info
Submission Time | |
---|---|
Task | C - K-th Substring |
User | clps1220 |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 350 Byte |
Status | TLE |
Exec Time | 2179 ms |
Memory | 1311492 KB |
Judge Result
Set Name | Sample | Subtask | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | 0 / 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 | 21 ms | 3316 KB |
0_001.txt | AC | 21 ms | 3316 KB |
0_002.txt | AC | 21 ms | 3316 KB |
1_003.txt | AC | 21 ms | 3316 KB |
1_004.txt | AC | 21 ms | 3316 KB |
1_005.txt | AC | 21 ms | 3316 KB |
1_006.txt | AC | 22 ms | 3316 KB |
1_007.txt | AC | 21 ms | 3316 KB |
1_008.txt | AC | 22 ms | 3444 KB |
1_009.txt | AC | 21 ms | 3316 KB |
1_010.txt | AC | 22 ms | 3444 KB |
2_011.txt | TLE | 2104 ms | 7460 KB |
2_012.txt | TLE | 2104 ms | 13728 KB |
2_013.txt | TLE | 2175 ms | 1291760 KB |
2_014.txt | TLE | 2175 ms | 1283676 KB |
2_015.txt | TLE | 2179 ms | 1311492 KB |
2_016.txt | TLE | 2174 ms | 1282040 KB |
2_017.txt | TLE | 2172 ms | 1235024 KB |
2_018.txt | TLE | 2174 ms | 1277432 KB |