Submission #2501779

Source Code Expand

s = str(input())
n = int(input())

cand = [s[0]]
for i in range(len(s)):
    if s[i] > cand[len(cand)-1]:
        continue
    for j in range(i, len(s)):
        tmp = s[i:j+1]
        #print(i,j, tmp, cand)
        if tmp in cand:
            continue
        cand += [tmp]
        if len(cand) > n:
            cand = sorted(cand)
            cand.pop()


print(cand.pop())

Submission Info

Submission Time
Task C - K-th Substring
User Kevinrobot34
Language Python (3.4.3)
Score 0
Code Size 395 Byte
Status WA
Exec Time 2104 ms
Memory 3060 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 0 / 200 0 / 100
Status
AC × 2
WA × 1
AC × 9
WA × 2
AC × 15
WA × 2
TLE × 2
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 WA 17 ms 3060 KB
0_001.txt AC 17 ms 3060 KB
0_002.txt AC 17 ms 2940 KB
1_003.txt AC 17 ms 3060 KB
1_004.txt WA 17 ms 2940 KB
1_005.txt AC 19 ms 2940 KB
1_006.txt AC 19 ms 3060 KB
1_007.txt AC 17 ms 2940 KB
1_008.txt AC 18 ms 2940 KB
1_009.txt AC 17 ms 2940 KB
1_010.txt AC 17 ms 3060 KB
2_011.txt TLE 2104 ms 3060 KB
2_012.txt TLE 2104 ms 3060 KB
2_013.txt AC 606 ms 3060 KB
2_014.txt AC 760 ms 3060 KB
2_015.txt AC 380 ms 3060 KB
2_016.txt AC 756 ms 3060 KB
2_017.txt AC 781 ms 3060 KB
2_018.txt AC 770 ms 3060 KB