Submission #59838888

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
    int N, K;
    cin >> N >> K;
    string S;
    cin >> S;
    vector<pair<int, int>> blocks; 
    int start = -1;
    for (int i = 0; i < N; ++i) {
        if (S[i] == '1') {
            if (start == -1) start = i; 
        } else {
            if (start != -1) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>

using namespace std;

#define int long long



signed main() {
    int N, K;
    cin >> N >> K;
    string S;
    cin >> S;
    vector<pair<int, int>> blocks; 
    int start = -1;

    for (int i = 0; i < N; ++i) {
        if (S[i] == '1') {
            if (start == -1) start = i; 
        } else {
            if (start != -1) {
                blocks.emplace_back(start, i - 1); 
                start = -1;
            }
        }
    }
    if (start != -1) {
        blocks.emplace_back(start, N - 1);
    }

    auto [kst, kend] = blocks[K - 2];
    auto [k_start, k_end] = blocks[K - 1];

    string ans(N, '0');
    for (int i = 0; i <= kend; ++i) {
        ans[i] = S[i];
    }
    for (int i = kend + 1; i <= kend + (k_end - k_start + 1); ++i) {
        ans[i] = '1'; 
    }
    for (int i = k_end + 1; i < N; ++i) {
        ans[i] = S[i]; 
    }

    cout << ans << endl;
}

Submission Info

Judge Result