Problem p03174 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
using namespace std;

#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin()
#define ubidx(x, y) upper_bound(x.begin(), x.end(), y) - x.begin()
#define llbidx(x, y, z)                                                        \
  lower_bound(x.begin(), x.end(), z) -                                         \
      lower_bound(x.begin(), x.end(), y) // 二要素間の距離
#define deg2rad(deg) ((((double)deg) / ((double)360) * 2 * M_PI))
#define rad2deg(rad) ((((double)rad) / (double)2 / M_PI) * (double)360)
#define Find(set, element) set.find(element) != set.end()
#define bit(n, k) ((n >> k) & 1)        // nのk bit目
#define Decimal(x) printf("%.10f\n", x) // 小数点を10桁まで表示
#define endl "\n"

// debug用
#define PrintVec(x)                                                            \
  for (auto elementPrintVec : x) {                                             \
    cout << elementPrintVec << " ";                                            \
  }                                                                            \
  cout << "\n";
#define debug(x) cerr << #x << ": " << (x) << "\n";
// gcj print用
#define Case(x) printf("Case #%d: ", x);

typedef pair<int, int> PI;
typedef pair<ll, ll> PLL;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<int>>> vvvl;
typedef vector<PI> vpi;
typedef vector<vector<PI>> vvpi;
typedef vector<vector<vector<PI>>> vvvpi;
typedef vector<PLL> vpl;
typedef vector<vector<PLL>> vvpl;
typedef vector<vector<vector<PLL>>> vvvpl;

int POWINT(int x, int n) {
  int ret = 1;
  while (n > 0) {
    if (n & 1)
      ret *= x;
    x *= x;
    n >>= 1;
  }
  return ret;
};

ll POWLL(ll x, int n) {
  ll ret = 1;
  while (n > 0) {
    if (n & 1)
      ret *= x;
    x *= x;
    n >>= 1;
  }
  return ret;
};

template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
};

template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
};

template <std::int_fast64_t Modulus> class modint {
  using i64 = int_fast64_t;

public:
  i64 a;

  constexpr modint(const i64 x = 0) noexcept {
    this->a = x % Modulus;
    if (a < 0) {
      a += Modulus;
    }
  }
  // constexpr i64 &value() const noexcept {return a;}
  constexpr const i64 &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 {
    i64 a_ = rhs.a, b = Modulus, u = 1, v = 0;
    while (b) {
      i64 t = a_ / b;
      a_ -= t * b;
      swap(a_, b);
      u -= t * v;
      swap(u, v);
    }
    a = a * u % Modulus;
    if (a < 0)
      a += Modulus;
    return *this;
  }

  // 自前実装
  constexpr bool operator==(const modint rhs) noexcept { return a == rhs.a; }
  constexpr bool operator!=(const modint rhs) noexcept { return a != rhs.a; }
  constexpr bool operator>(const modint rhs) noexcept { return a > rhs.a; }
  constexpr bool operator>=(const modint rhs) noexcept { return a >= rhs.a; }
  constexpr bool operator<(const modint rhs) noexcept { return a < rhs.a; }
  constexpr bool operator<=(const modint rhs) noexcept { return a <= rhs.a; }
  // constexpr modint& operator++() noexcept {
  //     return (*this) += modint(1);
  // }
  // constexpr modint operator++(int) {
  //     modint tmp(*this);
  //     operator++();
  //     return tmp;
  // }
  // constexpr modint& operator--() noexcept {
  //     return (*this) -= modint(1);
  // }
  // constexpr modint operator--(int) {
  //     modint tmp(*this);
  //     operator--();
  //     return tmp;
  // }
  template <typename T>
  friend constexpr modint modpow(const modint &mt, T n) noexcept {
    if (n < 0) {
      modint t = (modint(1) / mt);
      return modpow(t, -n);
    }
    modint res = 1, tmp = mt;
    while (n) {
      if (n & 1)
        res *= tmp;
      tmp *= tmp;
      n /= 2;
    }
    return res;
  }
};

const ll MOD = 1e9 + 7;
using mint = modint<MOD>;
// 標準入出力対応
std::ostream &operator<<(std::ostream &out, const modint<MOD> &m) {
  out << m.a;
  return out;
}
std::istream &operator>>(std::istream &in, modint<MOD> &m) {
  ll a;
  in >> a;
  m = mint(a);
  return in;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int N;
  cin >> N;
  vvi adj(N, vi(N));
  rep(i, 0, N) {
    rep(j, 0, N) { cin >> adj[i][j]; }
  }

  vector<mint> dp(1 << N);
  dp[0] = mint(1);
  rep(S, 1, 1 << N) {
    int i = __builtin_popcount(S);
    rep(j, 0, N) {
      // i番目の男性がj番目の女性とマッチしたときの場合の数を足す
      if (bit(S, j) == 1 && adj[i - 1][j] == 1) {
        dp[S] += dp[S ^ (1 << j)];
      }
    }
  }

  // 配るdp
  vector<vector<mint>> dp2(N, vector<mint>(1 << N));
  dp2[0][0] = mint(1);
  // 一見するとO(2^N N^2)だけど……
  rep(i, 0, N) {
    rep(S, 0, 1 << N) {
      if (dp2[i][S] > mint(0)) { //<-ここのif文の枝刈りが効いてO(2^N N)に落ちる
        rep(j, 0, N) {
          if (bit(S, j) == 0 && adj[i][j] == 1) {
            dp2[i + 1][S ^ (1 << j)] += dp2[i][S];
          }
        }
      }
    }
  }

  // cout << dp[(1 << N) - 1] << endl;
  cout << dp2[N][(1 << N) - 1] << endl;

  return 0;
};


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

#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin()
#define ubidx(x, y) upper_bound(x.begin(), x.end(), y) - x.begin()
#define llbidx(x, y, z)                                                        \
  lower_bound(x.begin(), x.end(), z) -                                         \
      lower_bound(x.begin(), x.end(), y) // 二要素間の距離
#define deg2rad(deg) ((((double)deg) / ((double)360) * 2 * M_PI))
#define rad2deg(rad) ((((double)rad) / (double)2 / M_PI) * (double)360)
#define Find(set, element) set.find(element) != set.end()
#define bit(n, k) ((n >> k) & 1)        // nのk bit目
#define Decimal(x) printf("%.10f\n", x) // 小数点を10桁まで表示
#define endl "\n"

// debug用
#define PrintVec(x)                                                            \
  for (auto elementPrintVec : x) {                                             \
    cout << elementPrintVec << " ";                                            \
  }                                                                            \
  cout << "\n";
#define debug(x) cerr << #x << ": " << (x) << "\n";
// gcj print用
#define Case(x) printf("Case #%d: ", x);

typedef pair<int, int> PI;
typedef pair<ll, ll> PLL;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<int>>> vvvl;
typedef vector<PI> vpi;
typedef vector<vector<PI>> vvpi;
typedef vector<vector<vector<PI>>> vvvpi;
typedef vector<PLL> vpl;
typedef vector<vector<PLL>> vvpl;
typedef vector<vector<vector<PLL>>> vvvpl;

int POWINT(int x, int n) {
  int ret = 1;
  while (n > 0) {
    if (n & 1)
      ret *= x;
    x *= x;
    n >>= 1;
  }
  return ret;
};

ll POWLL(ll x, int n) {
  ll ret = 1;
  while (n > 0) {
    if (n & 1)
      ret *= x;
    x *= x;
    n >>= 1;
  }
  return ret;
};

template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
};

template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
};

template <std::int_fast64_t Modulus> class modint {
  using i64 = int_fast64_t;

public:
  i64 a;

  constexpr modint(const i64 x = 0) noexcept {
    this->a = x % Modulus;
    if (a < 0) {
      a += Modulus;
    }
  }
  // constexpr i64 &value() const noexcept {return a;}
  constexpr const i64 &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 {
    i64 a_ = rhs.a, b = Modulus, u = 1, v = 0;
    while (b) {
      i64 t = a_ / b;
      a_ -= t * b;
      swap(a_, b);
      u -= t * v;
      swap(u, v);
    }
    a = a * u % Modulus;
    if (a < 0)
      a += Modulus;
    return *this;
  }

  // 自前実装
  constexpr bool operator==(const modint rhs) noexcept { return a == rhs.a; }
  constexpr bool operator!=(const modint rhs) noexcept { return a != rhs.a; }
  constexpr bool operator>(const modint rhs) noexcept { return a > rhs.a; }
  constexpr bool operator>=(const modint rhs) noexcept { return a >= rhs.a; }
  constexpr bool operator<(const modint rhs) noexcept { return a < rhs.a; }
  constexpr bool operator<=(const modint rhs) noexcept { return a <= rhs.a; }
  // constexpr modint& operator++() noexcept {
  //     return (*this) += modint(1);
  // }
  // constexpr modint operator++(int) {
  //     modint tmp(*this);
  //     operator++();
  //     return tmp;
  // }
  // constexpr modint& operator--() noexcept {
  //     return (*this) -= modint(1);
  // }
  // constexpr modint operator--(int) {
  //     modint tmp(*this);
  //     operator--();
  //     return tmp;
  // }
  template <typename T>
  friend constexpr modint modpow(const modint &mt, T n) noexcept {
    if (n < 0) {
      modint t = (modint(1) / mt);
      return modpow(t, -n);
    }
    modint res = 1, tmp = mt;
    while (n) {
      if (n & 1)
        res *= tmp;
      tmp *= tmp;
      n /= 2;
    }
    return res;
  }
};

const ll MOD = 1e9 + 7;
using mint = modint<MOD>;
// 標準入出力対応
std::ostream &operator<<(std::ostream &out, const modint<MOD> &m) {
  out << m.a;
  return out;
}
std::istream &operator>>(std::istream &in, modint<MOD> &m) {
  ll a;
  in >> a;
  m = mint(a);
  return in;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int N;
  cin >> N;
  vvi adj(N, vi(N));
  rep(i, 0, N) {
    rep(j, 0, N) { cin >> adj[i][j]; }
  }

  vector<mint> dp(1 << N);
  dp[0] = mint(1);
  rep(S, 1, 1 << N) {
    int i = __builtin_popcount(S);
    rep(j, 0, N) {
      // i番目の男性がj番目の女性とマッチしたときの場合の数を足す
      if (bit(S, j) == 1 && adj[i - 1][j] == 1) {
        dp[S] += dp[S ^ (1 << j)];
      }
    }
  }

  // 配るdp
  vector<vector<mint>> dp2(N + 1, vector<mint>(1 << N));
  dp2[0][0] = mint(1);
  // 一見するとO(2^N N^2)だけど……
  rep(i, 0, N) {
    rep(S, 0, 1 << N) {
      if (dp2[i][S] > mint(0)) { //<-ここのif文の枝刈りが効いてO(2^N N)に落ちる
        rep(j, 0, N) {
          if (bit(S, j) == 0 && adj[i][j] == 1) {
            dp2[i + 1][S ^ (1 << j)] += dp2[i][S];
          }
        }
      }
    }
  }

  // cout << dp[(1 << N) - 1] << endl;
  cout << dp2[N][(1 << N) - 1] << endl;

  return 0;
};