QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#499422#6726. Turn It OffbuzhijingdiAC ✓10ms3816kbC++14773b2024-07-31 14:04:192024-07-31 14:04:19

Judging History

你现在查看的是最新测评结果

  • [2024-07-31 14:04:19]
  • 评测
  • 测评结果:AC
  • 用时:10ms
  • 内存:3816kb
  • [2024-07-31 14:04:19]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 9;
const int mod = 1e9 + 7;
#define eps 1e-5
#define inf 2e18
int n,k;
char s[N];

bool check(int x)
{
    int cnt=0,i;
    for(i=1;i<=n;++i)
    {
        if(s[i]=='1')
        {
            i = i + x - 1;
            cnt++;
        }
    } 
    if(cnt<=k) return false;
    return true;
}

void solve()
{
   cin>>n>>k;
   cin>>s+1;

    int l = 1, r = 2e5 + 100;
     while(l < r)
    {
        int mid = (l + r)/2;
        if(check(mid)) l = mid + 1;
        else r = mid;
    }
    cout<< l << '\n';
}

int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int _ = 1;  cin>>_;
    while (_--) solve();
    return 0;
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3608kb

input:

2
10 4
0101011111
3 1
010

output:

3
1

result:

ok 2 number(s): "3 1"

Test #2:

score: 0
Accepted
time: 10ms
memory: 3816kb

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