Submission #32635326


Source Code Expand

Copy
def main(N, K, S):
# index:1~KansN
idx = [-1]
for k in range(1, K+1):
char = "~"
for i in range(idx[k-1] + 1, N - (K-k)):
if S[i] < char:
char = S[i]
w_i = i
idx.append(w_i)
return "".join([S[i] for i in idx[1:]])
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]
    for k in range(1, K+1):
        char = "~"
        for i in range(idx[k-1] + 1, N - (K-k)):
            if S[i] < char:
                char = S[i]
                w_i = i
        idx.append(w_i)
    return "".join([S[i] for i in idx[1:]])

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 0
Code Size 443 Byte
Status TLE
Exec Time 2197 ms
Memory 85620 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 5
Status
AC × 2
AC × 28
TLE × 1
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 69 ms 61812 KB
00_sample_01.txt AC 48 ms 61880 KB
10_random_small_00.txt AC 48 ms 61936 KB
10_random_small_01.txt AC 50 ms 63316 KB
11_random_medium_00.txt AC 90 ms 73644 KB
11_random_medium_01.txt AC 66 ms 73628 KB
12_random_large_00.txt AC 72 ms 80760 KB
12_random_large_01.txt AC 180 ms 78552 KB
13_random_max_00.txt AC 102 ms 81068 KB
13_random_max_01.txt AC 151 ms 82980 KB
13_random_max_02.txt TLE 2197 ms 73732 KB
20_unique_small_00.txt AC 61 ms 62352 KB
20_unique_small_01.txt AC 48 ms 61876 KB
21_unique_medium_00.txt AC 160 ms 73856 KB
21_unique_medium_01.txt AC 74 ms 73704 KB
22_unique_large_00.txt AC 139 ms 78068 KB
22_unique_large_01.txt AC 70 ms 83000 KB
23_unique_max_00.txt AC 88 ms 85620 KB
23_unique_max_01.txt AC 290 ms 80244 KB
23_unique_max_02.txt AC 443 ms 78488 KB
30_equal_small_00.txt AC 50 ms 62096 KB
30_equal_small_01.txt AC 52 ms 62364 KB
31_equal_medium_00.txt AC 67 ms 79304 KB
31_equal_medium_01.txt AC 57 ms 69208 KB
32_equal_large_00.txt AC 70 ms 79524 KB
32_equal_large_01.txt AC 76 ms 81260 KB
33_equal_max_00.txt AC 71 ms 81984 KB
33_equal_max_01.txt AC 71 ms 81780 KB
33_equal_max_02.txt AC 73 ms 81988 KB


2025-04-15 (Tue)
12:26:18 +00:00