Submission #8415049
Source Code Expand
def main(): s=input() m=int(input()) tank=[] n=len(s) alpha=[chr(i) for i in range(97, 97+26)] for i in range(26): for j in range(n): if alpha[i]==s[j]: for k in range(n-j): if s[j:j+k+1] not in tank: tank.append(s[j:j+k+1]) if len(tank)>=m: break tank.sort() print(tank[m-1]) if __name__ == "__main__": main()
Submission Info
Submission Time | |
---|---|
Task | C - K-th Substring |
User | modoki |
Language | PyPy3 (2.4.0) |
Score | 200 |
Code Size | 471 Byte |
Status | TLE |
Exec Time | 2116 ms |
Memory | 186248 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 | 174 ms | 38256 KB |
0_001.txt | AC | 170 ms | 38256 KB |
0_002.txt | AC | 166 ms | 38256 KB |
1_003.txt | AC | 163 ms | 38256 KB |
1_004.txt | AC | 166 ms | 38256 KB |
1_005.txt | AC | 167 ms | 38640 KB |
1_006.txt | AC | 168 ms | 38512 KB |
1_007.txt | AC | 167 ms | 38256 KB |
1_008.txt | AC | 166 ms | 38256 KB |
1_009.txt | AC | 165 ms | 38256 KB |
1_010.txt | AC | 168 ms | 38384 KB |
2_011.txt | TLE | 2109 ms | 89180 KB |
2_012.txt | TLE | 2109 ms | 91228 KB |
2_013.txt | TLE | 2115 ms | 176264 KB |
2_014.txt | TLE | 2115 ms | 186248 KB |
2_015.txt | TLE | 2113 ms | 158344 KB |
2_016.txt | TLE | 2115 ms | 183688 KB |
2_017.txt | TLE | 2115 ms | 184840 KB |
2_018.txt | TLE | 2116 ms | 185992 KB |