#ifndef MY_HEADER #define MY_HEADER #include #include using namespace std; using namespace atcoder; using lint = long long; using ulint = unsigned long long; using llint = __int128_t; struct edge; using graph = vector>; #define endl '\n' constexpr int INF = 1<<30; constexpr lint INF64 = 1LL<<61; constexpr lint mod107 = 1e9+7; using mint107 = modint1000000007; constexpr long mod = 998244353; using mint = modint998244353; lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}} lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}} lint Sqrt(lint x) {assert(x >= 0); lint ans = sqrt(x); while(ans*ans > x)ans--; while((ans+1)*(ans+1)<=x)ans++; return ans;} lint gcd(lint a,lint b){if(a 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;} string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;} vectorprime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j= 0; i--) #define vec vector #define pb push_back #define eb emplace_back #define se second #define fi first #define al(x) x.begin(),x.end() #define ral(x) x.rbegin(),x.rend() struct edge{ edge(lint v, lint c = 1) {to = v, cost = c;} lint to; lint cost; }; #endif lint N, A; string S; map, pair>dp; map, bool>went; // nextrate, account pair f(int rate, int step) { if(went[{rate,step}]) return dp[{rate, step}]; went[{rate, step}] = true; if(step == 0) { int r = rate; int account = 0; rep(i, N) { if(S[i] == '1') { if(r != 1200) { r++; account++; } } else { r--; } } return dp[{rate, step}] = {r, account}; } else { auto p = f(rate, step-1); auto p2 = f(p.first, step-1); return dp[{rate, step}] = {p2.first, min(p.second + p2.second, INF64)}; } } int main(){ cin >> N >> A; cin >> S; lint ans = 0; lint ac = 0; int rate = 1200; for(int i = 60; i >= 0; i--) { auto p = f(rate, i); if(ac + p.second < A) { rate = p.first; ac += p.second; ans += (1LL<