题意: 中文题
思路:
// Decline is inevitable,
// Romance will last forever.
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pb push_back
#define vi vector<int>
#define endl '\n'
#define int long long
using namespace std;
const int P = 1e9 + 7;
const int maxn = 5e3 + 10;
const int maxm = 2e6 + 10;
const int INF = 0x3f3f3f3f;
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
int n, k;
void solve() {
cin >> n >> k;
string s;
cin >> s;
s = ' ' + s;
int maxx = 0;
for(int i = 1; i <= n; i++) {
if(s[i] == '0') continue;
for(int j = i-1; j >= i - k; j--) {
if(j < 1) break;
if(s[j] == '1') {
maxx++;
break;
}
}
}
int minn = 0;
int pre = -1;
int cnt = 0;
for(int i = 1;i <= n; i++) {
if(s[i] == '1')
cnt++;
}
for(int i = 1; i <= n; i++) {
if(s[i] == '1') {
pre = i;
minn++;
break;
}
}
int tmp = pre;
for(int i = tmp + 1; i <= n; i++) {
if(s[i] == '1' && i-k>pre) {
pre = i;
minn++;
}
}
minn = cnt - minn;
cout << minn << ' ' << maxx << '\n';
}
signed main() {
// ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// int T; cin >> T;while(T--)
solve();
return 0;
}