#819587 (C++14) No.2136 Dice Calendar?

提出ソース

結果

問題	No.2136 Dice Calendar?
ユーザー	👑 hos.lyric
提出日時	2022-11-25 21:50:58
言語	C++14 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	613 ms / 5,000 ms
コード長	6,138 bytes
コンパイル時間	1,276 ms
コンパイル使用メモリ	114,244 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-04-10 03:03:53
合計ジャッジ時間	5,853 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	3 ms 6,816 KB
testcase_01	AC	3 ms 6,944 KB
testcase_02	AC	5 ms 6,940 KB
testcase_03	AC	3 ms 6,940 KB
testcase_04	AC	3 ms 6,940 KB
testcase_05	AC	3 ms 6,940 KB
testcase_06	AC	3 ms 6,944 KB
testcase_07	AC	3 ms 6,944 KB
testcase_08	AC	4 ms 6,940 KB
testcase_09	AC	5 ms 6,944 KB
testcase_10	AC	7 ms 6,944 KB
testcase_11	AC	13 ms 6,940 KB
testcase_12	AC	16 ms 6,940 KB
testcase_13	AC	16 ms 6,940 KB
testcase_14	AC	21 ms 6,944 KB
testcase_15	AC	85 ms 6,940 KB
testcase_16	AC	102 ms 6,940 KB
testcase_17	AC	103 ms 6,944 KB
testcase_18	AC	246 ms 6,944 KB
testcase_19	AC	298 ms 6,944 KB
testcase_20	AC	358 ms 6,940 KB
testcase_21	AC	439 ms 6,940 KB
testcase_22	AC	547 ms 6,940 KB
testcase_23	AC	613 ms 6,940 KB
testcase_24	AC	75 ms 6,944 KB
testcase_25	AC	90 ms 6,940 KB
testcase_26	AC	566 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;

constexpr int LIM_INV = 110;
Mint inv[LIM_INV], fac[LIM_INV], invFac[LIM_INV];

void prepare() {
  inv[1] = 1;
  for (int i = 2; i < LIM_INV; ++i) {
    inv[i] = -((Mint::M / i) * inv[Mint::M % i]);
  }
  fac[0] = invFac[0] = 1;
  for (int i = 1; i < LIM_INV; ++i) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}
Mint binom(Int n, Int k) {
  if (n < 0) {
    if (k >= 0) {
      return ((k & 1) ? -1 : +1) * binom(-n + k - 1, k);
    } else if (n - k >= 0) {
      return (((n - k) & 1) ? -1 : +1) * binom(-k - 1, n - k);
    } else {
      return 0;
    }
  } else {
    if (0 <= k && k <= n) {
      assert(n < LIM_INV);
      return fac[n] * invFac[k] * invFac[n - k];
    } else {
      return 0;
    }
  }
}


constexpr int M = 10;
constexpr int K = 6;

int N;
int S[30][30];

int dp[30][30];
int dpSum[30][30][30];

bitset<11'000'010> vis;

int xs[30];
int encode() {
  int key = 0;
  int n = N;
  for (int a = 0; a < M; ++a) {
    key += dpSum[M - a][n][xs[a]];
    n -= xs[a];
  }
  return key;
}

Mint ans;
void dfs(int a, int n, int key) {
  if (a == M) {
// if(N<=2){cerr<<"key = "<<key<<", xs = ";pv(xs,xs+M);}
    if (vis[key]) {
      const int i = N - xs[0];
      if (i == N) {
        Mint prod = fac[N];
        for (int b = 0; b < M; ++b) {
          prod *= invFac[xs[b]];
        }
        ans += prod;
      } else {
        --xs[0];
        for (int k = 0; k < K; ++k) {
          ++xs[S[i][k]];
          vis[encode()] = true;
          --xs[S[i][k]];
        }
        ++xs[0];
      }
    }
  } else if (a == M - 1) {
    xs[a] = n;
    dfs(M, 0, key);
  } else {
    for (int &dn = xs[a] = n; dn >= 0; --dn) {
      dfs(a + 1, n - dn, key);
      key += dp[M - 1 - a][n - dn];
    }
  }
}

int main() {
  prepare();
  
  for (; ~scanf("%d", &N); ) {
    for (int i = 0; i < N; ++i) for (int k = 0; k < K; ++k) {
      scanf("%d", &S[i][k]);
    }
    
    memset(dp, 0, sizeof(dp));
    memset(dpSum, 0, sizeof(dpSum));
    dp[0][0] = 1;
    for (int m = 1; m <= M; ++m) {
      for (int n = 0; n <= N; ++n) {
        for (int dn = n; dn >= 0; --dn) {
          dpSum[m][n][dn] = dp[m][n];
          dp[m][n] += dp[m - 1][n - dn];
        }
      }
// cerr<<"dp["<<m<<"] = ";pv(dp[m],dp[m]+N+1);
    }
    
    vis.reset();
    vis[0] = true;
    ans = 0;
    dfs(0, N, 0);
    printf("%u\n", ans.x);
  }
  return 0;
}

yukicoder

結果

テストケース

ソースコード