C. Social Distance

// Problem: C. Social Distance
// Contest: Codeforces - Codeforces Round #650 (Div. 3)
// URL: https://codeforces.com/problemset/problem/1367/C
// Memory Limit: 256 MB
// Time Limit: 2000 ms
// 2022-02-28 20:13:24
// 
// Powered by CP Editor (https://cpeditor.org)

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

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define pii pair<int, int>
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

const ll mod = 1e9 + 7;

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}

void solve() {
	int n, k;
	cin >> n >> k;
	string s;
	cin >> s;
	vector<int> a(n + 1);
	for (int i = 0; i < n ;i ++)
		a[i + 1] = s[i] - '0';
	for (int i = 1; i <= n; i ++)
		a[i] += a[i - 1];
	int ans = 0;
	for (int i = 1; i <= n; i ++) {
		int l = max(1, i - k);
		int r = min (n, i + k);
		if (a[r] - a[l - 1] == 0) {
			ans ++;
			i += k;
		}
	}
	cout << ans << endl;
}
int main () {
    int t;
    t =1;
    cin >> t;
    while (t --) solve();
    return 0;
}

用前缀和判断是否可选。注意边界的处理这里用max处理左边界，min处理有边界 策略:从左到右选。能选就选。比如第一个位置可以选，因为他消耗i + k个位置。中间的消耗的最多