Submission #175240

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
 
#define loop(n, i) for(int i=0;i<n;i++)
#define loop_from_to(from, to, i) for(int i=from;i<=to;i++)
#define repeat(n) for(int i__=0;i__<n;i__++)
#define each(itr, c) for(__typeof((c).begin()) itr=(c).begin(); itr!=(c).end(); itr++)
#define r_each(itr, c) for(__typeof((c).rbegin()) itr=(c).rbegin(); itr!=(c).rend(); itr++)

using namespace std;

int diff(string a, string b) {
    int ans = 0;
    loop(a.size(), i) {
        if (a[i] != b[i]) ans++;
    }
    return ans;
}

int main(int argc, char const* argv[])
{
    int n, k;
    cin >> n >> k;
    string s;
    cin >> s;
    string sorted = s;

    sort(sorted.begin(), sorted.end());

    string ans = s;
    loop(n, i) {
        string rest = ans.substr(i);
        sort(rest.begin(), rest.end());

        loop(rest.size(), j) {
            char c = rest[j];

            string tmp = ans;
            tmp[i] = c;

            string rrest = rest.substr(0, j);
            rrest += rest.substr(j+1);

            loop_from_to(i+1, n-1, l) {
                int pos = rrest.find(s[l]);
                if (pos == string::npos) tmp[l] = 'A';
                else { tmp[l] = rrest[pos]; rrest.erase(pos, 1); }
            }

            loop_from_to(i+1, n-1, l) {
                if (tmp[l] == 'A') {
                    tmp[l] = rrest[0];
                    rrest.erase(0);
                }
            }

            if (diff(s, tmp) > k) continue;

            ans = tmp;
            break;
        }
    }

    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result