Submission #32651671


Source Code Expand

Copy
def main(N, K, S):
# index:1~KansN
idx = [-1]
chars = list()
for k in range(1, K+1):
begin = idx[k-1] + 1
end = N - (K-k)
char = min(S[begin:end])
i = S.index(char, begin, end)
chars.append(char)
idx.append(i)
return "".join(chars)
N, K = map(int, input().split(" "))
S = input()
print(main(N, K, S))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
def main(N, K, S):
    # index:1~Kにansを作る文字のNでのインデックスを格納する
    idx = [-1]
    chars = list()
    for k in range(1, K+1):
        begin = idx[k-1] + 1
        end = N - (K-k)
        char = min(S[begin:end])
        i = S.index(char, begin, end)
        chars.append(char)
        idx.append(i)
    return "".join(chars)
 
N, K = map(int, input().split(" "))
S = input()
 
print(main(N, K, S))

Submission Info

Submission Time
Task 006 - Smallest Subsequence(★5)
User arakaki_tokyo
Language PyPy3 (7.3.0)
Score 5
Code Size 448 Byte
Status AC
Exec Time 1005 ms
Memory 95508 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 5 / 5
Status
AC × 2
AC × 29
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt
All 00_sample_00.txt, 00_sample_01.txt, 10_random_small_00.txt, 10_random_small_01.txt, 11_random_medium_00.txt, 11_random_medium_01.txt, 12_random_large_00.txt, 12_random_large_01.txt, 13_random_max_00.txt, 13_random_max_01.txt, 13_random_max_02.txt, 20_unique_small_00.txt, 20_unique_small_01.txt, 21_unique_medium_00.txt, 21_unique_medium_01.txt, 22_unique_large_00.txt, 22_unique_large_01.txt, 23_unique_max_00.txt, 23_unique_max_01.txt, 23_unique_max_02.txt, 30_equal_small_00.txt, 30_equal_small_01.txt, 31_equal_medium_00.txt, 31_equal_medium_01.txt, 32_equal_large_00.txt, 32_equal_large_01.txt, 33_equal_max_00.txt, 33_equal_max_01.txt, 33_equal_max_02.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 62 ms 61708 KB
00_sample_01.txt AC 49 ms 61364 KB
10_random_small_00.txt AC 49 ms 61236 KB
10_random_small_01.txt AC 50 ms 62364 KB
11_random_medium_00.txt AC 78 ms 73280 KB
11_random_medium_01.txt AC 67 ms 73104 KB
12_random_large_00.txt AC 76 ms 80448 KB
12_random_large_01.txt AC 126 ms 80276 KB
13_random_max_00.txt AC 91 ms 80776 KB
13_random_max_01.txt AC 116 ms 80728 KB
13_random_max_02.txt AC 1005 ms 95508 KB
20_unique_small_00.txt AC 62 ms 61536 KB
20_unique_small_01.txt AC 47 ms 61724 KB
21_unique_medium_00.txt AC 105 ms 73504 KB
21_unique_medium_01.txt AC 70 ms 72972 KB
22_unique_large_00.txt AC 98 ms 77700 KB
22_unique_large_01.txt AC 75 ms 82228 KB
23_unique_max_00.txt AC 84 ms 82168 KB
23_unique_max_01.txt AC 168 ms 81348 KB
23_unique_max_02.txt AC 238 ms 80432 KB
30_equal_small_00.txt AC 47 ms 61680 KB
30_equal_small_01.txt AC 50 ms 62468 KB
31_equal_medium_00.txt AC 69 ms 77896 KB
31_equal_medium_01.txt AC 60 ms 73716 KB
32_equal_large_00.txt AC 77 ms 80800 KB
32_equal_large_01.txt AC 78 ms 82928 KB
33_equal_max_00.txt AC 81 ms 82660 KB
33_equal_max_01.txt AC 78 ms 82644 KB
33_equal_max_02.txt AC 78 ms 82940 KB


2025-04-15 (Tue)
13:32:04 +00:00