Submission #59852813

---

Source Code Expand

#if !__INCLUDE_LEVEL__
#include __FILE__



int main(){
    ll N,K;cin>>N>>K;
    string S;cin>>S;
    ll count=0;
    ll flag=0;
    ll lastOneIdx=0;
    ll lengthOne = 0;
    ll kflag = 0;
    ll kstartIdx = 0;
    rep(i,0,N){
        if(kflag == 1){
            if(S[i]=='1')lengthOne++;
            else break;
        }

        if(S[i]=='1' && flag==0){
            flag=1;
            count++;
            if(count==K){
                kflag = 1;
                lengthOne++;
                kstartIdx = i;
                continue;
            }
        }
        else if(S[i]=='0' && flag==1){
            flag=0;
            lastOneIdx = i-1;
        }
        
    }


    rep(i,0,lastOneIdx+1){
        cout<<S[i];
    }
    rep(i,lastOneIdx+1, (lastOneIdx+1+lengthOne)){
        cout<<1;
    }
    rep(i,lastOneIdx+1+lengthOne, kstartIdx+lengthOne){
        cout<<S[i-lengthOne];
    }
    rep(i,kstartIdx+lengthOne,N){
        cout<<S[i];
    }
    cout<<endl;
    return 0;
}

#else
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
struct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); cout << setprecision(13); } }init;

using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;

#define rep(i, x, limit) for (int i = (int)x; i < (int)limit; i++)
#define REP(i, x, limit) for (int i = (int)x; i <= (int)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el '\n'
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )

const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";

//配列の要素を空白区切りで出力 第二引数をtrueにすると改行区切り
template<class T> inline void print_vec(const vector<T>& v, bool split_line=false) {
    if(v.empty()){
        cout << "This vector is empty." << el;
        return;
    }
    for (int i = 0; i < v.size(); i++) {
        if(v[i]==inf || v[i]==infl) cout << 'x' << " \n"[split_line || i+1==(int)v.size()];
        else cout << v[i] << " \n"[split_line || i+1==(int)v.size()];
    }
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

#endif

Submission Info

Judge Result