Problem p02635 (C++)

Buggy submission (status: Runtime Error):
/*input
01100110 2
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#pragma GCC optimize("unroll-loops,no-stack-protector")
// order_of_key #of elements less than x
//  find_by_order kth element
#define ll long long
#define ld long double
#define pii pair<int, int>
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++)
#define FILL(n, x) memset(n, x, sizeof(n))
#define ALL(_a) _a.begin(), _a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c)                                                         \
  (sort(c.begin(), c.end()),                                                   \
   c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define MP make_pair
const ll INF64 = 4e12;
const int INF = 0x3f3f3f3f;
const ll MOD = 998244353;
const ld PI = acos(-1);
const ld eps = 1e-9;
#define lowb(x) x & (-x)
#define MNTO(x, y) x = min(x, (__typeof__(x))y)
#define MXTO(x, y) x = max(x, (__typeof__(x))y)
ll mult(ll a, ll b) { return ((a % MOD) * (b % MOD)) % MOD; }
ll mypow(ll a, ll b) {
  if (b <= 0)
    return 1;
  ll res = 1LL;
  while (b) {
    if (b & 1) {
      res = (res * a) % MOD;
    }
    a = (a * a) % MOD;
    b >>= 1;
  }
  return res;
}
const ll maxn = 200 + 5;
const ll maxlg = __lg(maxn) + 2;
int dp[maxn][maxn][maxn];
int main() {
  ios::sync_with_stdio(false), cin.tie(0);
  string s;
  int z;
  cin >> s >> z;
  s += "0";
  vector<int> v;
  int cnt = 0;
  REP(i, sz(s)) {
    if (s[i] == '1')
      ++cnt;
    else
      v.pb(cnt), cnt = 0;
  }
  int tot = sz(s) - sz(v);
  MNTO(z, tot);
  vector<int> pref;
  REP(i, sz(v)) {
    if (i)
      pref.pb(pref.back() + v[i]);
    else
      pref.pb(v[i]);
  }
  dp[0][0][0] = 1;
  REP(i, sz(v)) {
    REP(j, tot + 1) {
      REP(op, tot + 1) {
        if (dp[i][j][op]) {
          REP(cur, tot - j + 1) {
            if (j + cur < pref[i])
              continue;
            dp[i + 1][j + cur][op + max(cur - v[i], 0)] += dp[i][j][op];
            dp[i + 1][j + cur][op + max(cur - v[i], 0)] %= MOD;
          }
        }
      }
    }
  }
  ll ans = 0;
  REP(i, z + 1) ans += dp[sz(v)][tot][i], ans %= MOD;
  cout << ans;
}

Fixed submission:
/*input
01100110 2
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#pragma GCC optimize("unroll-loops,no-stack-protector")
// order_of_key #of elements less than x
//  find_by_order kth element
#define ll long long
#define ld long double
#define pii pair<int, int>
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++)
#define FILL(n, x) memset(n, x, sizeof(n))
#define ALL(_a) _a.begin(), _a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c)                                                         \
  (sort(c.begin(), c.end()),                                                   \
   c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define MP make_pair
const ll INF64 = 4e12;
const int INF = 0x3f3f3f3f;
const ll MOD = 998244353;
const ld PI = acos(-1);
const ld eps = 1e-9;
#define lowb(x) x & (-x)
#define MNTO(x, y) x = min(x, (__typeof__(x))y)
#define MXTO(x, y) x = max(x, (__typeof__(x))y)
ll mult(ll a, ll b) { return ((a % MOD) * (b % MOD)) % MOD; }
ll mypow(ll a, ll b) {
  if (b <= 0)
    return 1;
  ll res = 1LL;
  while (b) {
    if (b & 1) {
      res = (res * a) % MOD;
    }
    a = (a * a) % MOD;
    b >>= 1;
  }
  return res;
}
const ll maxn = 300 + 5;
const ll maxlg = __lg(maxn) + 2;
int dp[maxn][maxn][maxn];
int main() {
  ios::sync_with_stdio(false), cin.tie(0);
  string s;
  int z;
  cin >> s >> z;
  s += "0";
  vector<int> v;
  int cnt = 0;
  REP(i, sz(s)) {
    if (s[i] == '1')
      ++cnt;
    else
      v.pb(cnt), cnt = 0;
  }
  int tot = sz(s) - sz(v);
  MNTO(z, tot);
  vector<int> pref;
  REP(i, sz(v)) {
    if (i)
      pref.pb(pref.back() + v[i]);
    else
      pref.pb(v[i]);
  }
  dp[0][0][0] = 1;
  REP(i, sz(v)) {
    REP(j, tot + 1) {
      REP(op, tot + 1) {
        if (dp[i][j][op]) {
          REP(cur, tot - j + 1) {
            if (j + cur < pref[i])
              continue;
            dp[i + 1][j + cur][op + max(cur - v[i], 0)] += dp[i][j][op];
            dp[i + 1][j + cur][op + max(cur - v[i], 0)] %= MOD;
          }
        }
      }
    }
  }
  ll ans = 0;
  REP(i, z + 1) ans += dp[sz(v)][tot][i], ans %= MOD;
  cout << ans;
}