QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#243137 | #6726. Turn It Off | Lionel_ZQY# | AC ✓ | 83ms | 4088kb | C++20 | 720b | 2023-11-07 21:24:19 | 2023-11-07 21:24:20 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
void solve(){
int n,k;
cin>>n>>k;
string s;
cin>>s;
s=" "+s;
int l=1,r=2e5+10,mid;
auto check=[&](int x){
int ls=0,rs=0,cnt=0;
for(int i=1;i<=n;i++){
if(s[i]=='1'){
if(i>=ls&&i<=rs) continue;
else{
cnt++;
// cout<<i<<' '<<ls<<' '<<rs<<' '<<cnt<<'\n';
ls=i,rs=i+x-1;
}
}
}
return cnt<=k;
};
while(l<=r){
mid=l+(r-l)/2;
// cout<<l<<' '<<mid<<' '<<r<<'\n';
if(check(mid)) r=mid-1;
else l=mid+1;
}
cout<<l<<'\n';
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
int t;
cin>>t;
while(t--){
solve();
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3516kb
input:
2 10 4 0101011111 3 1 010
output:
3 1
result:
ok 2 number(s): "3 1"
Test #2:
score: 0
Accepted
time: 83ms
memory: 4088kb
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