Problem p02635 (C++)

Buggy submission (status: Runtime Error):
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template <class T> using PQ = priority_queue<T>;
template <class T> using PQG = priority_queue<T, vector<T>, greater<T>>;
const int INF = 0xccccccc;
const ll LINF = 922337203685477580LL;
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  return is >> p.first >> p.second;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  return os << p.first << ' ' << p.second;
}

// const int mod = 1000000007;
const int mod = 998244353;

struct mint {
  int64_t x;
  mint(int64_t x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint &operator+=(const mint a) {
    if ((x += a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator-=(const mint a) {
    if ((x += mod - a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(int64_t t) const {
    if (!t)
      return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1)
      a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const { return pow(mod - 2); }
  mint &operator/=(const mint a) { return *this *= a.inv(); }
  mint operator/(const mint a) { return mint(*this) /= a; }
};

istream &operator>>(istream &is, mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }

#define N 310

// head

string s;
int k, n;
int cnt0;
int info[N];
mint dp[N][N], sum1[N][N], sum2[N][N];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> s >> k;
  n = s.size();
  rep(i, n) cnt0 += (s[i] == '0');
  chmin(k, n - cnt0);
  int now = 0;
  for (int i = 0; i < n;) {
    if (s[i] == '0') {
      i++;
      now++;
      continue;
    }
    int j = i + 1;
    while (j < n and s[j] == '1')
      j++;
    info[now] = j - i;
    i = j;
  }
  dp[0][0] = 1;
  for (int i = 1; i <= k + 1; i++)
    sum1[0][i] = 1;
  for (int i = 1; i <= k + 1; i++)
    sum2[i][i] = 1;
  for (int i = cnt0; i >= 0; i--) {
    rep(j, k + 1) {
      rep(u, k + 1) {
        int mi = u - max(0, u - info[i]);
        dp[j][u] =
            sum1[j][k + 1] - sum1[j][u] + sum2[j][u] - sum2[j - mi][u - mi];
      }
    }
    rep(j, k + 1) for (int u = 1; u <= k + 1; u++) sum1[j][u] =
        sum1[j][u - 1] + dp[j][u - 1];
    for (int j = 1; j <= k + 1; j++)
      rep(u, j) sum2[j][j - u] = sum2[j - 1][j - u - 1] + dp[j - 1][j - u - 1];
    // rep(i, k+1) rep(j, k+1) cout << dp[i][j] << (j == k?'\n':' ');
    // cout << '\n';
  }
  mint ans;
  rep(i, k + 1) ans += dp[i][0];
  cout << ans << endl;
}

Fixed submission:
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template <class T> using PQ = priority_queue<T>;
template <class T> using PQG = priority_queue<T, vector<T>, greater<T>>;
const int INF = 0xccccccc;
const ll LINF = 922337203685477580LL;
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  return is >> p.first >> p.second;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  return os << p.first << ' ' << p.second;
}

// const int mod = 1000000007;
const int mod = 998244353;

struct mint {
  int64_t x;
  mint(int64_t x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint &operator+=(const mint a) {
    if ((x += a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator-=(const mint a) {
    if ((x += mod - a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(int64_t t) const {
    if (!t)
      return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1)
      a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const { return pow(mod - 2); }
  mint &operator/=(const mint a) { return *this *= a.inv(); }
  mint operator/(const mint a) { return mint(*this) /= a; }
};

istream &operator>>(istream &is, mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }

#define N 310

// head

string s;
int k, n;
int cnt0;
int info[N];
mint dp[N][N], sum1[N][N], sum2[N][N];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> s >> k;
  n = s.size();
  rep(i, n) cnt0 += (s[i] == '0');
  chmin(k, n - cnt0);
  int now = 0;
  for (int i = 0; i < n;) {
    if (s[i] == '0') {
      i++;
      now++;
      continue;
    }
    int j = i + 1;
    while (j < n and s[j] == '1')
      j++;
    info[now] = j - i;
    i = j;
  }
  dp[0][0] = 1;
  for (int i = 1; i <= k + 1; i++)
    sum1[0][i] = 1;
  for (int i = 1; i <= k + 1; i++)
    sum2[i][i] = 1;
  for (int i = cnt0; i >= 0; i--) {
    rep(j, k + 1) {
      rep(u, j + 1) {
        int mi = u - max(0, u - info[i]);
        dp[j][u] =
            sum1[j][k + 1] - sum1[j][u] + sum2[j][u] - sum2[j - mi][u - mi];
      }
    }
    rep(j, k + 1) for (int u = 1; u <= k + 1; u++) sum1[j][u] =
        sum1[j][u - 1] + dp[j][u - 1];
    for (int j = 1; j <= k + 1; j++)
      rep(u, j) sum2[j][j - u] = sum2[j - 1][j - u - 1] + dp[j - 1][j - u - 1];
    // rep(i, k+1) rep(j, k+1) cout << dp[i][j] << (j == k?'\n':' ');
    // cout << '\n';
  }
  mint ans;
  rep(i, k + 1) ans += dp[i][0];
  cout << ans << endl;
}