提出 #24583375

ソースコード 拡げる

n, k = list(map(int, input().split()))
s = input()

table = [[0 for x in range(n)] for y in range(26)]

idx = [-1 for _ in range(26)]
for i in range(n - 1, -1, -1):
    # print(f'[{i}] = {s[i]}')
    idx[ord(s[i]) - ord("a")] = i + 1
    for j in range(26):
        table[j][i] = idx[j]

ans = ""
cur = 0
for j in range(k):
    # print(f"cur = {cur}, ans = {ans}")
    for i in range(26):
        # print(n, (k - j - 1))
        if 0 < table[i][cur] <= n - (k - j - 1):
            c = chr(ord("a") + i)
            # print(c)
            ans += c
            cur = table[i][cur]
            break

print(ans)

提出情報

提出日時
問題 006 - Smallest Subsequence（★5）
ユーザ wakameTech
言語 PyPy3 (7.3.0)
得点 5
コード長 634 Byte
結果 AC
実行時間 592 ms
メモリ 182668 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 5 / 5
結果
AC × 2
AC × 29
セット名 テストケース
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
ケース名 結果 実行時間 メモリ
00_sample_00.txt AC 65 ms 62068 KiB
00_sample_01.txt AC 46 ms 61876 KiB
10_random_small_00.txt AC 51 ms 65124 KiB
10_random_small_01.txt AC 52 ms 66248 KiB
11_random_medium_00.txt AC 78 ms 77460 KiB
11_random_medium_01.txt AC 78 ms 77544 KiB
12_random_large_00.txt AC 398 ms 155516 KiB
12_random_large_01.txt AC 276 ms 156192 KiB
13_random_max_00.txt AC 508 ms 182148 KiB
13_random_max_01.txt AC 443 ms 182300 KiB
13_random_max_02.txt AC 173 ms 182668 KiB
20_unique_small_00.txt AC 57 ms 68868 KiB
20_unique_small_01.txt AC 49 ms 63124 KiB
21_unique_medium_00.txt AC 102 ms 99432 KiB
21_unique_medium_01.txt AC 74 ms 76668 KiB
22_unique_large_00.txt AC 197 ms 133604 KiB
22_unique_large_01.txt AC 495 ms 168344 KiB
23_unique_max_00.txt AC 527 ms 182348 KiB
23_unique_max_01.txt AC 369 ms 182544 KiB
23_unique_max_02.txt AC 323 ms 182536 KiB
30_equal_small_00.txt AC 56 ms 66772 KiB
30_equal_small_01.txt AC 59 ms 69640 KiB
31_equal_medium_00.txt AC 178 ms 111820 KiB
31_equal_medium_01.txt AC 82 ms 77296 KiB
32_equal_large_00.txt AC 385 ms 156152 KiB
32_equal_large_01.txt AC 550 ms 181112 KiB
33_equal_max_00.txt AC 590 ms 182332 KiB
33_equal_max_01.txt AC 592 ms 182276 KiB
33_equal_max_02.txt AC 590 ms 182540 KiB