/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 1ms 532.0 KiB
#3 Accepted 1ms 532.0 KiB
#4 Accepted 2ms 320.0 KiB
#5 Wrong Answer 77ms 14.688 MiB
#6 Wrong Answer 61ms 14.656 MiB

Code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    ll n, k; cin >> n >> k;
    string s; cin >> s;

    ll indx[n];
    for (ll i = 0; i < n; i++) indx[i] = i;

    ll j = n-1;
    set<pair<char, ll>> st;
    for (ll i = n-1; i >= 0; i--) {
        st.insert({s[i], i});
        while (!st.empty() and (*st.begin()).second > i+k-1) st.erase(st.begin());
        indx[i] = st.begin()->second;
    }

    for (ll i = 0; i < n; ) {
        if (indx[i] == i) {
            cout << s[i];
            i++;
            continue;
        }
        string temp;
        if (i+k >= n) temp = s.substr(i);
        else temp = s.substr(i, k);
        sort(temp.begin(), temp.end());
        cout << temp;
        i += k;
    }
}

Information

Submit By
Type
Submission
Problem
P1230 Lexicographically Smallest Rearrangement
Language
C++17 (G++ 13.2.0)
Submit At
2025-09-03 05:39:44
Judged At
2025-09-03 05:39:44
Judged By
Score
4
Total Time
77ms
Peak Memory
14.688 MiB