Problem p02635 (C++) — buggy submission, verdict: Runtime Error

#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
// typedef vector<vector<ll>> Graph;

// const ll mod = 1e9 + 7;
const ll mod = 998244353;

#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define spa << " " <<
#define fi first
#define se second

template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
  os << "(" << v.first << ", " << v.second << ")";
  return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> v) {
  for (int i = 0; i < (int)v.size(); i++) {
    if (i > 0) {
      os << " ";
    }
    os << v[i];
  }
  return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<vector<T>> v) {
  for (int i = 0; i < (int)v.size(); i++) {
    if (i > 0) {
      os << endl;
    }
    os << v[i];
  }
  return os;
}

template <typename T> void debug(vector<vector<T>> &v, ll h, ll w) {
  for (ll i = 0; i < h; i++) {
    cerr << v[i][0];
    for (ll j = 1; j < w; j++)
      cerr spa v[i][j];
    cerr << endl;
  }
};
template <typename T> void debug(vector<T> &v, ll n) {
  if (n != 0)
    cerr << v[0];
  for (ll i = 1; i < n; i++)
    cerr spa v[i];
  cerr << endl;
};

template <std::uint_fast64_t Modulus> class modint {
  // long long から modint
  // を作るときは必ず正の数にしてからコンストラクタに入れること！
  // そうしないとバグります
  using u64 = std::uint_fast64_t;

public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    a += rhs.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if (a < rhs.a) {
      a += Modulus;
    }
    a -= rhs.a;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    a = a * rhs.a % Modulus;
    return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
    u64 exp = Modulus - 2;
    while (exp) {
      if (exp % 2) {
        *this *= rhs;
      }
      rhs *= rhs;
      exp /= 2;
    }
    return *this;
  }
};
using mint = modint<mod>;

template <class T, class U> constexpr T power(T x, U exp) {
  T ret = static_cast<T>(1);
  while (exp) {
    if (exp % static_cast<U>(2) == static_cast<U>(1))
      ret *= x;
    exp /= static_cast<U>(2);
    x *= x;
  }
  return ::std::move(ret);
}

using vm = vector<mint>;
using vvm = vector<vm>;
using vvvm = vector<vvm>;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  string S;
  ll K;
  cin >> S >> K;
  ll N = S.size();

  vector<ll> T;
  int pos = -1;
  REP(i, N) {
    if (S[i] == '0') {
      T.push_back(i - pos - 1);
      pos = i;
    }
  }
  T.push_back(N - pos - 1);

  // cout << T << endl;

  ll M = T.size();
  ll W = 0;
  REP(i, N) W += (S[i] - '0');

  chmin(K, W);

  vvvm dp(M + 1, vvm(K + 1, vm(W + 1, 0)));
  dp[0][0][0] = 1;

  REP(i, M) {
    REP(j, K + 1) {
      REP(k, W + 1) {
        for (int b = 0;; b++) {
          ll nj = j + max(b - T[i], 0ll);
          ll nk = k + b - T[i];
          if (nj <= K and nk >= 0 and nk <= W)
            dp[i + 1][nj][nk] += dp[i][j][k];
          if (nj > K or nk > W)
            break;
        }
      }
    }
  }

  mint res = 0;
  REP(i, K + 1) res += dp[M][i][0];

  cout << res.value() << endl;

  /*
  REP(i, M+1){
      dump(i)
      REP(j, K+1){
          REP(k, W+1){
              cout << dp[i][j][k].value() << " ";
          }
          cout << endl;
      }
      cout << endl;
  }
  */

  return 0;
}

Error: 0

Fixed submission:

#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
// typedef vector<vector<ll>> Graph;

// const ll mod = 1e9 + 7;
const ll mod = 998244353;

#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define spa << " " <<
#define fi first
#define se second

template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
  os << "(" << v.first << ", " << v.second << ")";
  return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> v) {
  for (int i = 0; i < (int)v.size(); i++) {
    if (i > 0) {
      os << " ";
    }
    os << v[i];
  }
  return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<vector<T>> v) {
  for (int i = 0; i < (int)v.size(); i++) {
    if (i > 0) {
      os << endl;
    }
    os << v[i];
  }
  return os;
}

template <typename T> void debug(vector<vector<T>> &v, ll h, ll w) {
  for (ll i = 0; i < h; i++) {
    cerr << v[i][0];
    for (ll j = 1; j < w; j++)
      cerr spa v[i][j];
    cerr << endl;
  }
};
template <typename T> void debug(vector<T> &v, ll n) {
  if (n != 0)
    cerr << v[0];
  for (ll i = 1; i < n; i++)
    cerr spa v[i];
  cerr << endl;
};

template <std::uint_fast64_t Modulus> class modint {
  // long long から modint
  // を作るときは必ず正の数にしてからコンストラクタに入れること！
  // そうしないとバグります
  using u64 = std::uint_fast64_t;

public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    a += rhs.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if (a < rhs.a) {
      a += Modulus;
    }
    a -= rhs.a;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    a = a * rhs.a % Modulus;
    return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
    u64 exp = Modulus - 2;
    while (exp) {
      if (exp % 2) {
        *this *= rhs;
      }
      rhs *= rhs;
      exp /= 2;
    }
    return *this;
  }
};
using mint = modint<mod>;

template <class T, class U> constexpr T power(T x, U exp) {
  T ret = static_cast<T>(1);
  while (exp) {
    if (exp % static_cast<U>(2) == static_cast<U>(1))
      ret *= x;
    exp /= static_cast<U>(2);
    x *= x;
  }
  return ::std::move(ret);
}

using vm = vector<mint>;
using vvm = vector<vm>;
using vvvm = vector<vvm>;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  string S;
  ll K;
  cin >> S >> K;
  ll N = S.size();

  vector<ll> T;
  int pos = -1;
  REP(i, N) {
    if (S[i] == '0') {
      T.push_back(i - pos - 1);
      pos = i;
    }
  }
  T.push_back(N - pos - 1);

  ll M = T.size();
  ll W = 0;
  REP(i, N) W += (S[i] - '0');

  if (W == 0 or W == N) {
    cout << 1 << endl;
    return 0;
  }

  vvvm dp(M + 1, vvm(K + 1, vm(W + 1, 0)));
  dp[0][0][0] = 1;

  REP(i, M) {
    REP(j, K + 1) {
      REP(k, W + 1) {
        for (int b = 0;; b++) {
          ll nj = j + max(b - T[i], 0ll);
          ll nk = k + b - T[i];
          if (nj <= K and nk >= 0 and nk <= W)
            dp[i + 1][nj][nk] += dp[i][j][k];
          if (nj > K or nk > W)
            break;
        }
      }
    }
  }

  mint res = 0;
  REP(i, K + 1) res += dp[M][i][0];

  cout << res.value() << endl;

  /*
  REP(i, M+1){
      dump(i)
      REP(j, K+1){
          REP(k, W+1){
              cout << dp[i][j][k].value() << " ";
          }
          cout << endl;
      }
      cout << endl;
  }
  */

  return 0;
}