QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #646022 | #6726. Turn It Off | fieldchaser | WA | 2ms | 4112kb | C++14 | 657b | 2024-10-16 20:54:50 | 2024-10-16 20:54:51 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
#define pb push_back
const int mod=1e9+7;
void solve(){
int n,k; cin>>n>>k;
string s; cin>>s;
int l=-1,r=-1;
for (int i=0;i<n;i++){
if (s[i]=='1'){
l=i; break;
}
}
for (int i=n-1;i>=0;i--){
if (s[i]=='1'){
r=i;
break;
}
}
if (((r-l+1)%k)==0) cout<<max((r-l+1)/k,1)<<"\n";
else cout<<(r-l+1)/k+1<<"\n";
}
int main(){
ios::sync_with_stdio(0); cin.tie(0);
int t; cin>>t;
while (t--)
solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3540kb
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: 2ms
memory: 4112kb
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'