QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #153242 | #6860. Binary Number | neko_nyaa | WA | 11ms | 3748kb | C++23 | 693b | 2023-08-29 19:14:03 | 2023-08-29 19:14:03 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int M = 998244353;
int modpow(int n, int k) {
int ans = 1;
while (k) {
if (k % 2) ans = (ans*n) % M;
n = (n*n) % M; k /= 2;
}
return ans;
}
void solve() {
int n, k; cin >> n >> k;
string s; cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '0') {
if (k > 0) {
k--;
int j = i;
while (j < n && s[j] == '0') j++;
j--;
for (int ff = i; ff <= j; ff++) {
s[ff] = '1';
}
i = j;
}
}
}
cout << s << '\n';
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
int t; cin >> t;
while (t--) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 11ms
memory: 3748kb
input:
59471 11 523478562876 11011111010 10 1000 1110101110 11 13333 10101000011 11 9 10000001001 11 1000 10110100100 11 4 11000010111 11 1000 11100100011 11 100 10000000001 11 23333 10111101110 9 233 110110010 11 648953764538 10011110011 9 233333 101010111 11 9 10001011001 11 8 10100001100 10 77777777 100...
output:
11111111111 1111111111 11111111111 11111111111 11111111111 11111111111 11111111111 11111111111 11111111111 111111111 11111111111 111111111 11111111111 11111111111 1111111111 11111111111 11111111111 11111111010 11111111111 11111111111 11111111111 11111111111 11111111000 11111111111 1111010 1111111111...
result:
wrong answer 920th lines differ - expected: '0', found: '1'