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

#include <bits/stdc++.h>
using namespace std;
struct fast_ios {
  fast_ios() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  };
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x)                                                      \\
  distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x)                                                      \\
  distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL << (n))
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v)                                                              \\
  {                                                                            \\
    cout << #v << "=" << endl;                                                 \\
    REP(i_debug, v.size()) { cout << v[i_debug] << ","; }                      \\
    cout << endl;                                                              \\
  }
#define mdebug(m)                                                              \\
  {                                                                            \\
    cout << #m << "=" << endl;                                                 \\
    REP(i_debug, m.size()) {                                                   \\
      REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << ","; }  \\
      cout << endl;                                                            \\
    }                                                                          \\
  }
#define Return(ans)                                                            \\
  {                                                                            \\
    cout << (ans) << endl;                                                     \\
    return 0;                                                                  \\
  }
#define pb push_back
#define fi first
#define se second
#define int long long
#define INF 1000000000000000000
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v)
    is >> x;
  return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
  for (int i = 0; i < v.size(); i++) {
    cout << v[i];
    if (i != v.size() - 1)
      cout << endl;
  };
  return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> p) {
  cout << '(' << p.first << ',' << p.second << ')';
  return os;
}
template <typename T> void Out(T x) { cout << x << endl; }
template <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) {
  if (f)
    Out(y);
  else
    Out(n);
}

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using v_bool = vector<bool>;
using v_Pii = vector<Pii>;

// int dx[4] = {1,0,-1,0};
// int dy[4] = {0,1,0,-1};
// char d[4] = {'D','R','U','L'};

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

template <long long MOD> struct ModInt {

  using ll = long long;
  ll val;

  void setval(ll v) { val = v % MOD; };
  ModInt() : val(0) {}
  ModInt(ll v) { setval(v); };

  ModInt operator+(const ModInt &x) const { return ModInt(val + x.val); }
  ModInt operator-(const ModInt &x) const { return ModInt(val - x.val + MOD); }
  ModInt operator*(const ModInt &x) const { return ModInt(val * x.val); }
  ModInt operator/(const ModInt &x) const { return *this * x.inv(); }
  ModInt operator-() const { return ModInt(MOD - val); }
  ModInt operator+=(const ModInt &x) { return *this = *this + x; }
  ModInt operator-=(const ModInt &x) { return *this = *this - x; }
  ModInt operator*=(const ModInt &x) { return *this = *this * x; }
  ModInt operator/=(const ModInt &x) { return *this = *this / x; }

  friend ostream &operator<<(ostream &os, const ModInt &x) {
    os << x.val;
    return os;
  }
  friend istream &operator>>(istream &is, ModInt &x) {
    is >> x.val;
    x.val = (x.val % MOD + MOD) % MOD;
    return is;
  }

  ModInt pow(ll n) const {
    ModInt a = 1;
    if (n == 0)
      return a;
    int i0 = 64 - __builtin_clzll(n);
    for (int i = i0 - 1; i >= 0; i--) {
      a = a * a;
      if ((n >> i) & 1)
        a *= (*this);
    }
    return a;
  }
  ModInt inv() const { return this->pow(MOD - 2); }
};

using mint = ModInt<mod>;
mint pow(mint x, long long n) { return x.pow(n); }
// using mint = double; //for debug
using mvec = vector<mint>;
using mmat = vector<mvec>;

struct Combination {

  vector<mint> fact, invfact;

  Combination(int N) {
    fact = vector<mint>({mint(1)});
    invfact = vector<mint>({mint(1)});
    fact_initialize(N);
  }

  void fact_initialize(int N) {
    int i0 = fact.size();
    if (i0 >= N + 1)
      return;
    fact.resize(N + 1);
    invfact.resize(N + 1);
    for (int i = i0; i <= N; i++)
      fact[i] = fact[i - 1] * i;
    invfact[N] = (mint)1 / fact[N];
    for (int i = N - 1; i >= i0; i--)
      invfact[i] = invfact[i + 1] * (i + 1);
  }

  mint nCr(int n, int r) {
    if (n < 0 || r < 0 || r > n)
      return mint(0);
    if (fact.size() < n + 1)
      fact_initialize(n);
    return fact[n] * invfact[r] * invfact[n - r];
  }

  mint nPr(int n, int r) {
    if (n < 0 || r < 0 || r > n)
      return mint(0);
    if (fact.size() < n + 1)
      fact_initialize(n);
    return fact[n] * invfact[n - r];
  }

  mint Catalan(int n) {
    if (n < 0)
      return 0;
    else if (n == 0)
      return 1;
    if (fact.size() < 2 * n + 1)
      fact_initialize(2 * n);
    return fact[2 * n] * invfact[n + 1] * invfact[n];
  }
};

signed main() {

  int N, A;
  cin >> N >> A;
  int B = N - A;

  mmat dp(A + 1, mvec(A + 1, 0));
  Combination C(N);

  REP(j, A + 1) dp[1][j] = C.fact[B + j];
  FOR(n, 2, A + 1) {
    REP(i, n + 1) {
      if (i % 2 == 0)
        dp[n][0] += C.nCr(n, i) * C.fact[n - i] * C.nPr(n - i + B - 1, B);
      else
        dp[n][0] -= C.nCr(n, i) * C.fact[n - i] * C.nPr(n - i + B - 1, B);
    }

    FOR(j, 1, A + 1) {
      dp[n][j] = (mint)(n - 1) * (dp[n - 2][j] + dp[n - 1][j]) +
                 (mint)(B + j) * (dp[n - 1][j - 1] + dp[n][j - 1]);
    }
  }

  mint ans = dp[A][0];
  FOR(n, 1, A) {
    int m = A - n - 1;
    REP(k, m + 1) ans += C.nCr(m, k) * C.fact[m - k] * dp[n][k];
  }

  Out(ans);

  return 0;
}


Error: -11

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
struct fast_ios {
  fast_ios() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  };
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x)                                                      \\
  distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x)                                                      \\
  distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL << (n))
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v)                                                              \\
  {                                                                            \\
    cout << #v << "=" << endl;                                                 \\
    REP(i_debug, v.size()) { cout << v[i_debug] << ","; }                      \\
    cout << endl;                                                              \\
  }
#define mdebug(m)                                                              \\
  {                                                                            \\
    cout << #m << "=" << endl;                                                 \\
    REP(i_debug, m.size()) {                                                   \\
      REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << ","; }  \\
      cout << endl;                                                            \\
    }                                                                          \\
  }
#define Return(ans)                                                            \\
  {                                                                            \\
    cout << (ans) << endl;                                                     \\
    return 0;                                                                  \\
  }
#define pb push_back
#define fi first
#define se second
#define int long long
#define INF 1000000000000000000
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v)
    is >> x;
  return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
  for (int i = 0; i < v.size(); i++) {
    cout << v[i];
    if (i != v.size() - 1)
      cout << endl;
  };
  return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> p) {
  cout << '(' << p.first << ',' << p.second << ')';
  return os;
}
template <typename T> void Out(T x) { cout << x << endl; }
template <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) {
  if (f)
    Out(y);
  else
    Out(n);
}

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using v_bool = vector<bool>;
using v_Pii = vector<Pii>;

// int dx[4] = {1,0,-1,0};
// int dy[4] = {0,1,0,-1};
// char d[4] = {'D','R','U','L'};

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

template <long long MOD> struct ModInt {

  using ll = long long;
  ll val;

  void setval(ll v) { val = v % MOD; };
  ModInt() : val(0) {}
  ModInt(ll v) { setval(v); };

  ModInt operator+(const ModInt &x) const { return ModInt(val + x.val); }
  ModInt operator-(const ModInt &x) const { return ModInt(val - x.val + MOD); }
  ModInt operator*(const ModInt &x) const { return ModInt(val * x.val); }
  ModInt operator/(const ModInt &x) const { return *this * x.inv(); }
  ModInt operator-() const { return ModInt(MOD - val); }
  ModInt operator+=(const ModInt &x) { return *this = *this + x; }
  ModInt operator-=(const ModInt &x) { return *this = *this - x; }
  ModInt operator*=(const ModInt &x) { return *this = *this * x; }
  ModInt operator/=(const ModInt &x) { return *this = *this / x; }

  friend ostream &operator<<(ostream &os, const ModInt &x) {
    os << x.val;
    return os;
  }
  friend istream &operator>>(istream &is, ModInt &x) {
    is >> x.val;
    x.val = (x.val % MOD + MOD) % MOD;
    return is;
  }

  ModInt pow(ll n) const {
    ModInt a = 1;
    if (n == 0)
      return a;
    int i0 = 64 - __builtin_clzll(n);
    for (int i = i0 - 1; i >= 0; i--) {
      a = a * a;
      if ((n >> i) & 1)
        a *= (*this);
    }
    return a;
  }
  ModInt inv() const { return this->pow(MOD - 2); }
};

using mint = ModInt<mod>;
mint pow(mint x, long long n) { return x.pow(n); }
// using mint = double; //for debug
using mvec = vector<mint>;
using mmat = vector<mvec>;

struct Combination {

  vector<mint> fact, invfact;

  Combination(int N) {
    fact = vector<mint>({mint(1)});
    invfact = vector<mint>({mint(1)});
    fact_initialize(N);
  }

  void fact_initialize(int N) {
    int i0 = fact.size();
    if (i0 >= N + 1)
      return;
    fact.resize(N + 1);
    invfact.resize(N + 1);
    for (int i = i0; i <= N; i++)
      fact[i] = fact[i - 1] * i;
    invfact[N] = (mint)1 / fact[N];
    for (int i = N - 1; i >= i0; i--)
      invfact[i] = invfact[i + 1] * (i + 1);
  }

  mint nCr(int n, int r) {
    if (n < 0 || r < 0 || r > n)
      return mint(0);
    if (fact.size() < n + 1)
      fact_initialize(n);
    return fact[n] * invfact[r] * invfact[n - r];
  }

  mint nPr(int n, int r) {
    if (n < 0 || r < 0 || r > n)
      return mint(0);
    if (fact.size() < n + 1)
      fact_initialize(n);
    return fact[n] * invfact[n - r];
  }

  mint Catalan(int n) {
    if (n < 0)
      return 0;
    else if (n == 0)
      return 1;
    if (fact.size() < 2 * n + 1)
      fact_initialize(2 * n);
    return fact[2 * n] * invfact[n + 1] * invfact[n];
  }
};

mint dp[301][301][301][2] = {};

signed main() {

  int N, A;
  cin >> N >> A;
  if (A > 300)
    exit(1);

  dp[0][0][0][0] = 1;
  REP(i, A) {
    REP(j, i + 1) REP(k, j + 1) {
      dp[i + 1][j + 1][k + 1][0] += dp[i][j][k][0];
      dp[i + 1][j + 1][k][0] += dp[i][j][k][0] * (j - k);
      if (k > 0)
        dp[i + 1][j + 1][k - 1][0] += dp[i][j][k][0] * k;

      dp[i + 1][j][k][1] += dp[i][j][k][0];

      dp[i + 1][j][k][1] += dp[i][j][k][1];
      dp[i + 1][j + 1][k][1] += dp[i][j][k][1] * (j - k);
      if (k > 0)
        dp[i + 1][j + 1][k - 1][1] += dp[i][j][k][1] * k;
    }
  }

  Combination C(N);
  mint ans = 0;
  int M = N - A;
  FOR(j, 1, A) FOR(k, 0, j + 1) {
    if (k <= M)
      ans += dp[A][j][k][1] * C.fact[A - j - 1] * C.nPr(M, k) *
             C.nPr(j + M - k - 1, M - k);
  }
  FOR(k, 0, A + 1) {
    if (k <= M)
      ans += dp[A][A][k][0] * C.nPr(M, k) * C.nPr(A + M - k - 1, M - k);
  }
  Out(ans);

  return 0;
}