Submission #2560933


Source Code Expand

s = input()
K = int(input())
# substrings = {}
substrings = []
for i in range(1,len(s)+1):
    for j in range(0,len(s)):
        if s[j:j+i] not in substrings:
            # substrings[s[j:j+1]] = True
            substrings.append(s[j:j+i])
print(sorted(substrings)[K-1])

Submission Info

Submission Time
Task C - K-th Substring
User kikkakesan
Language Python (3.4.3)
Score 200
Code Size 281 Byte
Status TLE
Exec Time 2104 ms
Memory 4196 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 200 / 200 0 / 100
Status
AC × 3
AC × 11
AC × 11
TLE × 8
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 17 ms 3060 KB
0_001.txt AC 17 ms 2940 KB
0_002.txt AC 17 ms 3060 KB
1_003.txt AC 17 ms 3060 KB
1_004.txt AC 17 ms 3060 KB
1_005.txt AC 18 ms 3060 KB
1_006.txt AC 19 ms 2940 KB
1_007.txt AC 17 ms 2940 KB
1_008.txt AC 25 ms 3060 KB
1_009.txt AC 20 ms 3060 KB
1_010.txt AC 24 ms 3060 KB
2_011.txt TLE 2104 ms 3060 KB
2_012.txt TLE 2103 ms 3060 KB
2_013.txt TLE 2104 ms 4072 KB
2_014.txt TLE 2103 ms 4072 KB
2_015.txt TLE 2104 ms 4196 KB
2_016.txt TLE 2104 ms 4072 KB
2_017.txt TLE 2104 ms 4072 KB
2_018.txt TLE 2104 ms 4068 KB