QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#137736#6726. Turn It Offmshcherba#AC ✓13ms4024kbC++17875b2023-08-10 17:11:192023-08-10 17:12:00

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-08-10 17:12:00]
  • 评测
  • 测评结果:AC
  • 用时:13ms
  • 内存:4024kb
  • [2023-08-10 17:11:19]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FILL(a, b) memset(a, b, sizeof(a))

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int t;
	cin >> t;
	while (t--) {
		int n, k;
		string s;
		cin >> n >> k >> s;
		int l = 0, r = n;
		while (r - l > 1) {
			int m = (l + r) / 2;
			int cnt = 0;
			for (int i = 0; i < n; i++) {
				if (s[i] == '1') {
					i += m - 1;
					cnt++;
				}
			}
			if (cnt <= k) {
				r = m;
			}
			else {
				l = m;
			}
		}
		cout << r << "\n";
	}
	return 0;
}


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

详细

Test #1:

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

input:

2
10 4
0101011111
3 1
010

output:

3
1

result:

ok 2 number(s): "3 1"

Test #2:

score: 0
Accepted
time: 13ms
memory: 4024kb

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