QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#213625 | #6726. Turn It Off | yujie3# | AC ✓ | 24ms | 3772kb | C++20 | 664b | 2023-10-14 15:11:49 | 2023-10-14 15:11:49 |
Judging History
answer
#include<bits/stdc++.h>
#define endl '\n'
#define fast() ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
#define _ int _T; cin >> _T; while(_T --)
#define int long long
using namespace std;
const int mod = 1e9 + 7;
int n,k;
string s;
int check(int x){
int ans = 0;
for(int i = 0;i < n;){
if(s[i] == '0'){
i ++;
continue;
}
i += x;
ans ++;
}
return ans <= k;
}
void solve(){
cin >> n >> k;
cin >> s;
int l = 1,r = n;
while(l < r){
int mid = l + r >> 1;
if(check(mid)) r = mid;
else l = mid + 1;
} cout << l << endl;
}
signed main(){
// fast();
_
solve();
return 0;
}
这程序好像有点Bug,我给组数据试试?
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3676kb
input:
2 10 4 0101011111 3 1 010
output:
3 1
result:
ok 2 number(s): "3 1"
Test #2:
score: 0
Accepted
time: 24ms
memory: 3772kb
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