Submission #3051591


Source Code Expand

from collections import Counter

N, K =map(int, input().split())
S = input()

cand = sorted(S)
ans = ""

for i in range(N):
    counter = Counter(S[:i+1])-Counter(ans)

    ## 1文字違いが発生する_
    K -= 1
    for x in cand:
        if x == S[i]: ## i文字目が出たらその時点で使える
            ans += x
            cand.remove(x)
            ## やっぱり1文字違いが発生しない
            K += 1
            break
        elif sum(counter.values()) - (1 if counter[x] > 0 else 0) <= K: ## 今後の変化の最小長が制限を超えないとき
            ans += x
            cand.remove(x)
            break

print(ans)

Submission Info

Submission Time
Task C - 辞書式順序ふたたび
User tnyo43
Language Python (3.4.3)
Score 100
Code Size 687 Byte
Status AC
Exec Time 25 ms
Memory 3316 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 58
Set Name Test Cases
All hand_1_0.txt, hand_1_1.txt, hand_1_2.txt, hand_1_3.txt, hand_1_4.txt, hand_1_5.txt, hand_1_6.txt, hand_1_7.txt, hand_1_8.txt, hand_2_0.txt, hand_2_1.txt, hand_2_10.txt, hand_2_2.txt, hand_2_3.txt, hand_2_4.txt, hand_2_5.txt, hand_2_6.txt, hand_2_7.txt, hand_2_8.txt, hand_2_9.txt, hand_3_2.txt, hand_3_3.txt, hand_3_4.txt, hand_3_5.txt, hand_3_6.txt, hand_4_2.txt, hand_4_3.txt, hand_4_4.txt, hand_4_5.txt, hand_4_6.txt, random_1.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_2.txt, random_3.txt, random_4.txt, random_5.txt, random_6.txt, random_7.txt, random_8.txt, random_9.txt, sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt, small_1.txt, small_2.txt, small_3.txt, small_4.txt, small_5.txt, small_6.txt, small_7.txt, small_8.txt, small_9.txt
Case Name Status Exec Time Memory
hand_1_0.txt AC 20 ms 3316 KB
hand_1_1.txt AC 21 ms 3316 KB
hand_1_2.txt AC 20 ms 3316 KB
hand_1_3.txt AC 20 ms 3316 KB
hand_1_4.txt AC 21 ms 3316 KB
hand_1_5.txt AC 21 ms 3316 KB
hand_1_6.txt AC 20 ms 3316 KB
hand_1_7.txt AC 21 ms 3316 KB
hand_1_8.txt AC 20 ms 3316 KB
hand_2_0.txt AC 20 ms 3316 KB
hand_2_1.txt AC 20 ms 3316 KB
hand_2_10.txt AC 20 ms 3316 KB
hand_2_2.txt AC 21 ms 3316 KB
hand_2_3.txt AC 21 ms 3316 KB
hand_2_4.txt AC 21 ms 3316 KB
hand_2_5.txt AC 21 ms 3316 KB
hand_2_6.txt AC 21 ms 3316 KB
hand_2_7.txt AC 20 ms 3316 KB
hand_2_8.txt AC 21 ms 3316 KB
hand_2_9.txt AC 20 ms 3316 KB
hand_3_2.txt AC 20 ms 3316 KB
hand_3_3.txt AC 20 ms 3316 KB
hand_3_4.txt AC 21 ms 3316 KB
hand_3_5.txt AC 21 ms 3316 KB
hand_3_6.txt AC 20 ms 3316 KB
hand_4_2.txt AC 21 ms 3316 KB
hand_4_3.txt AC 21 ms 3316 KB
hand_4_4.txt AC 21 ms 3316 KB
hand_4_5.txt AC 21 ms 3316 KB
hand_4_6.txt AC 21 ms 3316 KB
random_1.txt AC 21 ms 3316 KB
random_10.txt AC 25 ms 3316 KB
random_11.txt AC 24 ms 3316 KB
random_12.txt AC 25 ms 3316 KB
random_13.txt AC 24 ms 3316 KB
random_14.txt AC 24 ms 3316 KB
random_15.txt AC 24 ms 3316 KB
random_2.txt AC 22 ms 3316 KB
random_3.txt AC 22 ms 3316 KB
random_4.txt AC 22 ms 3316 KB
random_5.txt AC 23 ms 3316 KB
random_6.txt AC 23 ms 3316 KB
random_7.txt AC 24 ms 3316 KB
random_8.txt AC 25 ms 3316 KB
random_9.txt AC 25 ms 3316 KB
sample_1.txt AC 21 ms 3316 KB
sample_2.txt AC 21 ms 3316 KB
sample_3.txt AC 20 ms 3316 KB
sample_4.txt AC 20 ms 3316 KB
small_1.txt AC 20 ms 3316 KB
small_2.txt AC 20 ms 3316 KB
small_3.txt AC 21 ms 3316 KB
small_4.txt AC 20 ms 3316 KB
small_5.txt AC 20 ms 3316 KB
small_6.txt AC 21 ms 3316 KB
small_7.txt AC 20 ms 3316 KB
small_8.txt AC 20 ms 3316 KB
small_9.txt AC 21 ms 3316 KB