QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#123804 | #6726. Turn It Off | isaunoya# | AC ✓ | 41ms | 3612kb | C++14 | 552b | 2023-07-13 17:51:06 | 2023-07-13 17:51:07 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, k;
string s;
cin >> n >> k >> s;
auto check = [&](int w) {
int c = 0;
for (int i = 0; i < n; i += 1) {
if (s[i] == '1') {
c += 1;
i += w - 1;
}
}
return c <= k;
};
int l = 0, r = n + 1;
while (r - l > 1) {
int m = (l + r) / 2;
if (check(m)) {
r = m;
} else {
l = m;
}
}
cout << r << "\n";
}
int main() {
int t;
cin >> t;
while (t--) {
solve();
}
}
这程序好像有点Bug,我给组数据试试?
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3448kb
input:
2 10 4 0101011111 3 1 010
output:
3 1
result:
ok 2 number(s): "3 1"
Test #2:
score: 0
Accepted
time: 41ms
memory: 3612kb
input:
1109 47 36 11101110101001111110101101100001000011101001011 6 5 100010 35 26 00011111000000101010011010100101111 71 45 11101001000111011101101000000000010001100100110000001000011011001011000 32 23 00000100011110010101000110010110 36 30 110110000000000011010001100011111100 21 8 010000011010011101100 9...
output:
1 1 1 1 1 1 2 4 10 2 2 3 3 1 2 1 1 1 1 2 2 2 6 7 1 1 1 1 1 1 1 3 1 1 2 3 1 1 3 1 1 6 1 1 5 1 1 3 10 19 1 1 1 4 1 1 2 1 2 1 1 2 1 1 60 17 3 3 2 2 1 1 4 1 1 1 1 1 2 2 1 3 5 2 1 1 4 2 1 1 3 1 1 1 1 1 5 2 3 1 2 1 1 1 1 2 1 1 2 1 1 81 1 4 1 1 1 2 1 44 1 5 2 3 1 1 1 2 1 8 1 1 3 1 1 2 1 46 1 1 1 1 1 1 1 1 ...
result:
ok 1109 numbers