Submission #1595516


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

int n, k;
string s;

bool check(string t, char c, map<char, int> mp) {
  int diff = 0;
  t += c;
  mp[c]--;
  for (int i = 0; i < t.size(); i++) {
    diff += s[i] != t[i];
  }

  map<char, int> mp2;
  for (int i = t.size(); i < n; i++) {
    mp2[s[i]]++;
  }

  int sum = 0;
  for (char i = 'a'; i < 'z'; i++) {
    sum += max(0, min(mp[i], mp2[i]));
  }
  diff += n - t.size() - sum;
  return diff <= k;
}

int main(void) {
  cin >> n >> k >> s;

  map<char, int> mp;
  for (int i = 0; i < n; i++) {
    mp[s[i]]++;
  }

  string ans = "";
  for (int i = 0; i < n; i++) {
    for (auto& ch : mp) {
      if (ch.second <= 0) continue;
      if (check(ans, ch.first, mp)) {
        ans += ch.first;
        ch.second--;
        break;
      }
    }
  }

  cout << ans << endl;

  return 0;
}

Submission Info

Submission Time
Task C - 辞書式順序ふたたび
User legosuke
Language C++14 (GCC 5.4.1)
Score 0
Code Size 890 Byte
Status WA
Exec Time 10 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 47
WA × 11
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 1 ms 256 KB
hand_1_1.txt AC 1 ms 256 KB
hand_1_2.txt AC 1 ms 256 KB
hand_1_3.txt AC 1 ms 256 KB
hand_1_4.txt AC 1 ms 256 KB
hand_1_5.txt AC 1 ms 256 KB
hand_1_6.txt AC 1 ms 256 KB
hand_1_7.txt AC 1 ms 256 KB
hand_1_8.txt AC 1 ms 256 KB
hand_2_0.txt AC 1 ms 256 KB
hand_2_1.txt AC 1 ms 256 KB
hand_2_10.txt AC 1 ms 256 KB
hand_2_2.txt AC 1 ms 256 KB
hand_2_3.txt AC 1 ms 256 KB
hand_2_4.txt AC 1 ms 256 KB
hand_2_5.txt AC 1 ms 256 KB
hand_2_6.txt AC 1 ms 256 KB
hand_2_7.txt AC 1 ms 256 KB
hand_2_8.txt AC 1 ms 256 KB
hand_2_9.txt AC 1 ms 256 KB
hand_3_2.txt AC 1 ms 256 KB
hand_3_3.txt AC 1 ms 256 KB
hand_3_4.txt AC 1 ms 256 KB
hand_3_5.txt AC 1 ms 256 KB
hand_3_6.txt AC 1 ms 256 KB
hand_4_2.txt AC 1 ms 256 KB
hand_4_3.txt AC 1 ms 256 KB
hand_4_4.txt AC 1 ms 256 KB
hand_4_5.txt AC 1 ms 256 KB
hand_4_6.txt AC 1 ms 256 KB
random_1.txt AC 2 ms 256 KB
random_10.txt WA 4 ms 256 KB
random_11.txt WA 4 ms 256 KB
random_12.txt WA 4 ms 256 KB
random_13.txt WA 3 ms 256 KB
random_14.txt AC 2 ms 256 KB
random_15.txt AC 2 ms 256 KB
random_2.txt WA 2 ms 256 KB
random_3.txt WA 2 ms 256 KB
random_4.txt WA 2 ms 256 KB
random_5.txt AC 2 ms 256 KB
random_6.txt WA 3 ms 256 KB
random_7.txt WA 8 ms 256 KB
random_8.txt WA 10 ms 256 KB
random_9.txt WA 5 ms 256 KB
sample_1.txt AC 1 ms 256 KB
sample_2.txt AC 1 ms 256 KB
sample_3.txt AC 1 ms 256 KB
sample_4.txt AC 1 ms 256 KB
small_1.txt AC 1 ms 256 KB
small_2.txt AC 1 ms 256 KB
small_3.txt AC 1 ms 256 KB
small_4.txt AC 1 ms 256 KB
small_5.txt AC 1 ms 256 KB
small_6.txt AC 1 ms 256 KB
small_7.txt AC 1 ms 256 KB
small_8.txt AC 1 ms 256 KB
small_9.txt AC 1 ms 256 KB