QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #499416 | #6726. Turn It Off | Abcl | WA | 23ms | 4060kb | C++14 | 629b | 2024-07-31 13:59:53 | 2024-07-31 13:59:54 |
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;
l=r=-1;
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;
}
}
int len=r-l+1;
if(len<m)
cout<<1<<endl;
else
cout<<ceil((double)len/m)<<endl;
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;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3792kb
input:
2 10 4 0101011111 3 1 010
output:
3 1
result:
ok 2 number(s): "3 1"
Test #2:
score: -100
Wrong Answer
time: 23ms
memory: 4060kb
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:
2 1 2 2 2 2 3 6 10 3 3 4 4 2 2 2 2 2 2 3 2 2 7 7 2 2 2 1 2 2 2 3 2 2 3 4 2 1 4 2 2 7 2 2 5 2 1 4 11 19 2 2 2 5 2 2 3 2 3 2 2 2 1 2 60 17 3 4 3 3 2 2 4 2 2 2 1 2 3 3 2 4 5 3 2 2 5 4 2 2 4 2 2 2 2 2 5 3 4 2 3 1 2 2 2 3 2 2 3 1 1 81 2 5 2 2 1 2 2 44 2 5 3 3 2 1 2 3 2 9 1 2 4 2 2 3 2 46 2 1 2 3 1 2 2 2 ...
result:
wrong answer 1st numbers differ - expected: '1', found: '2'