QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#499386 | #6726. Turn It Off | ssmy | AC ✓ | 4ms | 3892kb | C++20 | 807b | 2024-07-31 13:40:56 | 2024-07-31 13:40:57 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
int n, m;
string s;
bool check(int mid)
{
int cnt = 0;
for(int i = 1; i <= n; i ++ )
{
if(s[i] == '1')
{
cnt ++ ;
i = i + mid - 1;
}
}
return cnt > m;
}
void solve()
{
std:: cin >> n >> m;
std:: cin >> s;
s = " " + s;
int l = 0, r = 1e18;
while(l < r)
{
int mid = (l + r + 1) / 2;
if(check(mid))
{
l = mid;
}
else
{
r = mid - 1;
}
}
std:: cout << l + 1 << endl;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int T;
std:: cin >> T;
while(T -- )
solve();
return 0;
}
这程序好像有点Bug,我给组数据试试?
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3596kb
input:
2 10 4 0101011111 3 1 010
output:
3 1
result:
ok 2 number(s): "3 1"
Test #2:
score: 0
Accepted
time: 4ms
memory: 3892kb
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