Submission #1986795


Source Code Expand

// header {{{
#include <bits/stdc++.h>
using namespace std;

// {U}{INT,LONG,LLONG}_{MAX,MIN}
#define INF         INT_MAX/3
#define LLINF       LLONG_MAX/3
#define MOD         (1000000007LL)
#define MODA(a, b)  a=((a)+(b))%MOD
#define MODP(a, b)  a=((a)*(b))%MOD
#define inc(i, l, r)   for(long long i=(l);i<(r);i++)
#define dec(i, l, r)   for(long long i=(r)-1;i>=(l);i--)
#define pb          push_back
#define se          second
#define fi          first
#define mset(a, b)  memset(a, b, sizeof(a))

using LL  = long long;
using G   = vector<vector<int>>;

int di[] = {0, -1, 0, 1};
int dj[] = {1, 0, -1, 0};
// }}}

int main() {
    std::ios::sync_with_stdio(false);
    int n, k;cin >> n >> k;
    string s;cin >> s;
    string t = s;
    string ans;
    vector<int> tcnt(26, 0);
    inc(i, 0, n){
        tcnt[s[i]-'a']++;
    }
    inc(i, 0, n){
        sort(t.begin(), t.end());
        //cout << i << " " << t << endl;
        if(t[0] == s[i]){
            ans.pb(t[0]);
            tcnt[t[0]-'a']--;
            t.erase(0, 1);
        }else{
            inc(l, 0, n-i){
                int cnt = 0;
                tcnt[t[l]-'a']--;
                auto v = tcnt;
                inc(j, i+1, n){
                    if(v[s[j]-'a'] > 0){
                        v[s[j]-'a']--;
                    }
                }
                inc(j, 0, 26){
                    cnt += v[j];
                }
                if(t[l] == s[i] && cnt > 0) cnt--;
                //cout << l << " " << cnt << " " << k << endl;
                if(cnt >= k && (cnt != 0)){
                    tcnt[t[l]-'a']++;
                    continue;
                }else{
                    ans.pb(t[l]);
                    if(k > 0) k--;
                    t.erase(l, 1);
                    break;
                }
            }
        }
        //cout << ans << " " << k << endl;
        //cout << endl;
    }
    cout << ans << endl;
    return 0;
}

Submission Info

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

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 36
WA × 22
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 WA 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 WA 1 ms 256 KB
hand_2_5.txt WA 1 ms 256 KB
hand_2_6.txt WA 1 ms 256 KB
hand_2_7.txt WA 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 WA 1 ms 256 KB
hand_3_5.txt WA 1 ms 256 KB
hand_3_6.txt WA 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 WA 1 ms 256 KB
hand_4_5.txt WA 1 ms 256 KB
hand_4_6.txt WA 1 ms 256 KB
random_1.txt WA 1 ms 256 KB
random_10.txt WA 2 ms 256 KB
random_11.txt WA 2 ms 256 KB
random_12.txt WA 2 ms 256 KB
random_13.txt WA 2 ms 256 KB
random_14.txt WA 1 ms 256 KB
random_15.txt AC 1 ms 256 KB
random_2.txt WA 1 ms 256 KB
random_3.txt WA 1 ms 256 KB
random_4.txt WA 1 ms 256 KB
random_5.txt AC 1 ms 256 KB
random_6.txt WA 1 ms 256 KB
random_7.txt AC 2 ms 256 KB
random_8.txt AC 2 ms 256 KB
random_9.txt WA 2 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