結果

問題 No.1631 Sorting Integers (Multiple of K) Easy
ユーザー stoqstoq
提出日時 2021-07-30 22:22:14
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 474 ms / 3,000 ms
コード長 6,932 bytes
コンパイル時間 2,192 ms
コンパイル使用メモリ 207,092 KB
実行使用メモリ 139,808 KB
最終ジャッジ日時 2023-10-14 05:29:35
合計ジャッジ時間 10,919 ms
ジャッジサーバーID
(参考情報)
judge13 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 21 ms
12,032 KB
testcase_01 AC 20 ms
11,644 KB
testcase_02 AC 20 ms
11,640 KB
testcase_03 AC 23 ms
16,048 KB
testcase_04 AC 21 ms
11,636 KB
testcase_05 AC 22 ms
11,648 KB
testcase_06 AC 21 ms
11,652 KB
testcase_07 AC 20 ms
11,952 KB
testcase_08 AC 21 ms
12,024 KB
testcase_09 AC 23 ms
14,068 KB
testcase_10 AC 21 ms
14,056 KB
testcase_11 AC 22 ms
13,984 KB
testcase_12 AC 21 ms
14,172 KB
testcase_13 AC 21 ms
14,060 KB
testcase_14 AC 448 ms
139,784 KB
testcase_15 AC 468 ms
139,736 KB
testcase_16 AC 470 ms
139,732 KB
testcase_17 AC 474 ms
139,688 KB
testcase_18 AC 470 ms
139,692 KB
testcase_19 AC 471 ms
139,788 KB
testcase_20 AC 471 ms
139,700 KB
testcase_21 AC 419 ms
139,780 KB
testcase_22 AC 466 ms
139,808 KB
testcase_23 AC 462 ms
139,804 KB
testcase_24 AC 459 ms
139,732 KB
testcase_25 AC 456 ms
139,800 KB
testcase_26 AC 50 ms
139,212 KB
testcase_27 AC 356 ms
139,808 KB
testcase_28 AC 184 ms
139,524 KB
testcase_29 AC 185 ms
139,456 KB
testcase_30 AC 245 ms
139,676 KB
testcase_31 AC 353 ms
139,688 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#define MOD_TYPE 1

#pragma region Macros

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

#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

#if 0
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template <typename T>
using extset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif

#if 0
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename T>
using smaller_queue = priority_queue<T, vector<T>, greater<T>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr ld PI = acos(-1.0);
constexpr ld EPS = 1e-7;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

struct io_init
{
  io_init()
  {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b)
{
  return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
  fill((T *)array, (T *)(array + N), val);
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept
{
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept
{
  os << p.first << " " << p.second;
  return os;
}
#pragma endregion

// --------------------------------------

#pragma region mint
template <int MOD>
struct Fp
{
  long long val;

  constexpr Fp(long long v = 0) noexcept : val(v % MOD)
  {
    if (val < 0)
      v += MOD;
  }

  constexpr int getmod()
  {
    return MOD;
  }

  constexpr Fp operator-() const noexcept
  {
    return val ? MOD - val : 0;
  }

  constexpr Fp operator+(const Fp &r) const noexcept
  {
    return Fp(*this) += r;
  }

  constexpr Fp operator-(const Fp &r) const noexcept
  {
    return Fp(*this) -= r;
  }

  constexpr Fp operator*(const Fp &r) const noexcept
  {
    return Fp(*this) *= r;
  }

  constexpr Fp operator/(const Fp &r) const noexcept
  {
    return Fp(*this) /= r;
  }

  constexpr Fp &operator+=(const Fp &r) noexcept
  {
    val += r.val;
    if (val >= MOD)
      val -= MOD;
    return *this;
  }

  constexpr Fp &operator-=(const Fp &r) noexcept
  {
    val -= r.val;
    if (val < 0)
      val += MOD;
    return *this;
  }

  constexpr Fp &operator*=(const Fp &r) noexcept
  {
    val = val * r.val % MOD;
    if (val < 0)
      val += MOD;
    return *this;
  }

  constexpr Fp &operator/=(const Fp &r) noexcept
  {
    long long a = r.val, b = MOD, u = 1, v = 0;
    while (b)
    {
      long long t = a / b;
      a -= t * b;
      swap(a, b);
      u -= t * v;
      swap(u, v);
    }
    val = val * u % MOD;
    if (val < 0)
      val += MOD;
    return *this;
  }

  constexpr bool operator==(const Fp &r) const noexcept
  {
    return this->val == r.val;
  }

  constexpr bool operator!=(const Fp &r) const noexcept
  {
    return this->val != r.val;
  }

  friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept
  {
    return os << x.val;
  }

  friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept
  {
    return is >> x.val;
  }
};

Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept
{
  if (n == 0)
    return 1;
  auto t = modpow(a, n / 2);
  t = t * t;
  if (n & 1)
    t = t * a;
  return t;
}

using mint = Fp<MOD>;

template <class T>
struct BiCoef
{
  vector<T> fact_, inv_, finv_;

  constexpr BiCoef()
  {
  }

  constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1)
  {
    init(n);
  }

  constexpr void init(int n) noexcept
  {
    fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
    int MOD = fact_[0].getmod();
    for (int i = 2; i < n; i++)
    {
      fact_[i] = fact_[i - 1] * i;
      inv_[i] = -inv_[MOD % i] * (MOD / i);
      finv_[i] = finv_[i - 1] * inv_[i];
    }
  }

  constexpr T C(ll n, ll k) const noexcept
  {
    if (n < k || n < 0 || k < 0)
      return 0;
    return fact_[n] * finv_[k] * finv_[n - k];
  }

  constexpr T P(ll n, ll k) const noexcept
  {
    return C(n, k) * fact_[k];
  }

  constexpr T H(ll n, ll k) const noexcept
  {
    return C(n + k - 1, k);
  }

  constexpr T Ch1(ll n, ll k) const noexcept
  {
    if (n < 0 || k < 0)
      return 0;
    T res = 0;
    for (int i = 0; i < n; i++)
      res += C(n, i) * modpow(n - i, k) * (i & 1 ? -1 : 1);
    return res;
  }

  constexpr T fact(ll n) const noexcept
  {
    if (n < 0)
      return 0;
    return fact_[n];
  }

  constexpr T inv(ll n) const noexcept
  {
    if (n < 0)
      return 0;
    return inv_[n];
  }

  constexpr T finv(ll n) const noexcept
  {
    if (n < 0)
      return 0;
    return finv_[n];
  }
};

BiCoef<mint> bc(200010);
#pragma endregion

ll dp[1 << 14][1000];
int rem[1000][1000];

void solve()
{
  int n, k;
  cin >> n >> k;
  rep(i, 1000) rep(j, 1000) rem[i][j] = i * j % k;
  vector<int> v;
  int a[9];
  rep(i, 9)
  {
    cin >> a[i];
    rep(j, a[i]) v.push_back(i + 1);
  }
  dp[0][0] = 1;
  int p = 1;
  int tmp;
  repi(i, n)
  {
    repi(msk, 1 << n)
    {
      if (__builtin_popcount(msk) != i)
        continue;
      repi(r, k)
      {
        repi(j, n)
        {
          if (msk & (1 << j))
            continue;
          tmp = r + rem[v[j]][p];
          if (tmp >= k)
            tmp -= k;
          dp[msk | (1 << j)][tmp] += dp[msk][r];
        }
      }
    }
    p = rem[p][10];
  }
  ll ans = dp[(1 << n) - 1][0];
  rep(i, 9)
  {
    for (int j = 1; j <= a[i]; j++)
      ans /= j;
  }
  cout << ans << "\n";
}

int main()
{
  solve();
}
0