Submission #2659537

Source Code Expand

import heapq
from itertools import groupby, islice

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

def substrings_starting_at(i):
  return (s[i:j+1] for j in range(i, len(s)))

gens = [substrings_starting_at(i) for i in range(len(s))]
sm = heapq.merge(*gens)
res, _ = next(islice(groupby(sm), n-1, n))
print(res)

Submission Info

Submission Time
Task C - K-th Substring
User zehnpaard
Language Python (3.4.3)
Score 300
Code Size 307 Byte
Status AC
Exec Time 54 ms
Memory 8044 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 200 / 200 100 / 100
Status
AC × 3
AC × 11
AC × 19
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 19 ms 3064 KB
0_001.txt AC 18 ms 3060 KB
0_002.txt AC 18 ms 3064 KB
1_003.txt AC 18 ms 3060 KB
1_004.txt AC 18 ms 3060 KB
1_005.txt AC 18 ms 3060 KB
1_006.txt AC 18 ms 3060 KB
1_007.txt AC 18 ms 3060 KB
1_008.txt AC 18 ms 3064 KB
1_009.txt AC 18 ms 3064 KB
1_010.txt AC 18 ms 3060 KB
2_011.txt AC 54 ms 8044 KB
2_012.txt AC 37 ms 8044 KB
2_013.txt AC 30 ms 7280 KB
2_014.txt AC 32 ms 7664 KB
2_015.txt AC 28 ms 6512 KB
2_016.txt AC 32 ms 7664 KB
2_017.txt AC 32 ms 7664 KB
2_018.txt AC 32 ms 7664 KB