QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#243065#6726. Turn It Offgzzz#AC ✓9ms3548kbC++20536b2023-11-07 20:34:542023-11-07 20:34:54

Judging History

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

  • [2023-11-07 20:34:54]
  • 评测
  • 测评结果:AC
  • 用时:9ms
  • 内存:3548kb
  • [2023-11-07 20:34:54]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define ll long long
string x;
ll n,k;
bool check(ll len){
	ll now=0,need=0;
	while(now<=n){
		if(x[now]=='1'){
			need++;
			now+=len;
		}
		else {
			now++;
		}
	}
	return need<=k;
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	int t;cin>>t;
	while(t--) {
		cin>>n>>k;
		cin>>x;
		ll l=1,r=n,ans=0;
		while(l<=r) {
			ll mid=(l+r)/2;
			if(check(mid)) {
				r=mid-1;
				ans=mid;
			}
			else {
				l=mid+1;
			}
		}
		cout<<ans<<"\n";
	}
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3412kb

input:

2
10 4
0101011111
3 1
010

output:

3
1

result:

ok 2 number(s): "3 1"

Test #2:

score: 0
Accepted
time: 9ms
memory: 3548kb

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