#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; typedef vector vi; typedef vector vl; typedef vector vvl; typedef vector vvvl; typedef vector vvvvl; typedef vector vb; typedef vector vvb; typedef vector vvvb; typedef vector vvvvb; typedef pair pl; typedef pair ppl; typedef pair pppl; typedef pair pppppl; #define rep(i,a,b) for(int i=(a);i<(b);i++) #define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--) #define all(a) begin(a),end(a) #define sz(a) (int)(a).size() #define F first #define S second #define bs(A,x) binary_search(all(A),x) #define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin()) #define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin()) #define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x)) templateusing min_priority_queue=priority_queue,greater>; templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b vm; typedef vector vvm; typedef vector vvvm; typedef vector vvvvm; ostream&operator<<(ostream&os,mint a){os<>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;} //*/ templateostream&operator<<(ostream&os,pairp){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vectorv){rep(i,0,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} int main(){ cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit); ll N,A;cin>>N>>A; string S;cin>>S; vl H(N+1); rep(i,0,N)H[i+1]=H[i]+(S[i]=='0'?1:-1); ll mi=*min_element(all(H)),a=count(all(S),'1'); vl X(2*N+1),Y(2*N+1); rep(h,0,2*N+1){ X[h]=min(2*N,h+H[N]-min(0ll,h+mi)); Y[h]=(h+mi<=0?a+h+mi:a); } vvl XX(40,X),YY(40,Y); rep(i,1,40)rep(j,0,2*N+1){ XX[i][j]=min(2*N,XX[i-1][XX[i-1][j]]); YY[i][j]=YY[i-1][j]+YY[i-1][min(2*N,XX[i-1][j])]; chmin(YY[i][j],A+10); } ll ans=0,h=0; rrep(i,0,40)if(A>YY[i][h]){ ans+=1ll<0)A--,h--; } assert(!A); cout<