QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#499411 | #6726. Turn It Off | Abcl | TL | 0ms | 3560kb | C++14 | 856b | 2024-07-31 13:57:45 | 2024-07-31 13:57:46 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=200005;
int n,m;
string s;
int l,r;
void solve(){
cin>>n>>m;
cin>>s;s=' '+s;
int k=0;
for(int i=1;i<=n;i++){
if(s[i]=='1')k++;
}
for(int i=1;i<=n;i++){
if(s[i]=='1'){
l=i;break;
}
}
for(int i=n;i>=1;i--){
if(s[i]=='1'){
r=i;break;
}
}
for(int i=k/m;i<=r-l+1;i++){
int x=1,d=i;
int t=0;
while(x<=n){
while(s[x]=='0'){
x++;
}
if(s[x]=='1'){
x=x+i;t++;
}
if(t>m)break;
}
if(x<=n){
continue;
}
else if(t<=m){
cout<<i<<endl;
return;
}
}
return;
}
signed main() {
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t=1;
cin>>t;
while(t--){
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3560kb
input:
2 10 4 0101011111 3 1 010
output:
3 1
result:
ok 2 number(s): "3 1"
Test #2:
score: -100
Time Limit Exceeded
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 ...