結果

問題 No.1631 Sorting Integers (Multiple of K) Easy
ユーザー tanimani364tanimani364
提出日時 2021-07-30 22:57:11
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2,188 ms / 3,000 ms
コード長 4,251 bytes
コンパイル時間 1,834 ms
コンパイル使用メモリ 206,444 KB
実行使用メモリ 132,224 KB
最終ジャッジ日時 2024-09-16 02:46:48
合計ジャッジ時間 34,787 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 87 ms
131,968 KB
testcase_01 AC 86 ms
131,968 KB
testcase_02 AC 88 ms
131,968 KB
testcase_03 AC 92 ms
131,968 KB
testcase_04 AC 91 ms
131,968 KB
testcase_05 AC 87 ms
131,968 KB
testcase_06 AC 85 ms
131,968 KB
testcase_07 AC 87 ms
131,968 KB
testcase_08 AC 89 ms
131,840 KB
testcase_09 AC 93 ms
131,968 KB
testcase_10 AC 86 ms
131,968 KB
testcase_11 AC 87 ms
131,968 KB
testcase_12 AC 87 ms
131,840 KB
testcase_13 AC 87 ms
131,968 KB
testcase_14 AC 2,188 ms
131,968 KB
testcase_15 AC 2,057 ms
131,968 KB
testcase_16 AC 2,038 ms
131,968 KB
testcase_17 AC 2,048 ms
131,968 KB
testcase_18 AC 2,070 ms
132,096 KB
testcase_19 AC 2,068 ms
132,224 KB
testcase_20 AC 2,017 ms
132,096 KB
testcase_21 AC 1,818 ms
131,968 KB
testcase_22 AC 2,008 ms
131,968 KB
testcase_23 AC 2,063 ms
132,096 KB
testcase_24 AC 2,092 ms
131,968 KB
testcase_25 AC 2,013 ms
131,968 KB
testcase_26 AC 98 ms
131,968 KB
testcase_27 AC 1,543 ms
131,968 KB
testcase_28 AC 691 ms
131,968 KB
testcase_29 AC 708 ms
132,096 KB
testcase_30 AC 993 ms
131,968 KB
testcase_31 AC 1,495 ms
131,968 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
using namespace std;
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a; i > -1; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a; i > b; --i)
#define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define fi first
#define se second
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll mod_998244353 = 998244353;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

// using lll=boost::multiprecision::cpp_int;
// using
// Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<128>>;//仮数部が1024桁
template <class T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}

ll mypow(ll x, ll n, const ll &p = -1)
{ // x^nをmodで割った余り

  if (p != -1)
  {
    x = (x % p + p) % p;
  }
  ll ret = 1;
  while (n > 0)
  {
    if (n & 1)
    {
      if (p != -1)
        ret = (ret * x) % p;
      else
        ret *= x;
    }
    if (p != -1)
      x = (x * x) % p;
    else
      x *= x;
    n >>= 1;
  }
  return ret;
}

struct myrand{
  random_device seed;
  mt19937 mt;
  myrand():mt(seed()){}
  int operator()(int a,int b){//[a,b)
    uniform_int_distribution<int>dist(a,b-1);
    return dist(mt);
  }
};

//using namespace atcoder;

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

template<int mod>
struct Modint{
    int x;
    Modint():x(0){}
    Modint(int64_t y):x((y%mod+mod)%mod){}

    Modint &operator+=(const Modint &p){
			if((x+=p.x)>=mod)
				x -= mod;
			return *this;
		}

		Modint &operator-=(const Modint &p){
			if((x+=mod-p.x)>=mod)
				x -= mod;
			return *this;
		}

		Modint &operator*=(const Modint &p){
			x = (1LL * x * p.x) % mod;
			return *this;
		}

		Modint &operator/=(const Modint &p){
			*this *= p.inverse();
			return *this;
		}

		Modint operator-() const { return Modint(-x); }
		Modint operator+(const Modint &p) const{
			return Modint(*this) += p;
		}
		Modint operator-(const Modint &p) const{
			return Modint(*this) -= p;
		}
		Modint operator*(const Modint &p) const{
			return Modint(*this) *= p;
		}
		Modint operator/(const Modint &p) const{
			return Modint(*this) /= p;
		}

		bool operator==(const Modint &p) const { return x == p.x; }
		bool operator!=(const Modint &p) const{return x != p.x;}

		Modint inverse() const{//非再帰拡張ユークリッド
			int a = x, b = mod, u = 1, v = 0;
			while(b>0){
				int t = a / b;
				swap(a -= t * b, b);
				swap(u -= t * v, v);
			}
			return Modint(u);
		}

		Modint pow(int64_t n) const{//繰り返し二乗法
			Modint ret(1), mul(x);
			while(n>0){
				if(n&1)
					ret *= mul;
				mul *= mul;
				n >>= 1;
			}
			return ret;
		}

		friend ostream &operator<<(ostream &os,const Modint &p){
			return os << p.x;
		}
};

using modint = Modint<mod>;
using modint2= Modint<mod_998244353>;

ll dp[1<<14][1005];
void solve()
{
  int n,k;
  cin>>n>>k;
  vector<int>c(9);
  rep(i,9)cin>>c[i];
  auto cc=c;
  vector<int>d(n);
  rep(i,n){
    rep(j,9){
      if(c[j]>0){
        d[i]=j+1;
        c[j]--;
        break;
      }
    }
  }
  c=cc;
  memset(dp,0,sizeof(dp));
  dp[0][0]=1;
  rep(bit,1<<n){
    rep(i,k){
      rep(j,n){
        if(bit&1<<j)continue;
        ll nk=i+d[j]*mypow(10,popcount(bit));
        nk%=k;
        dp[bit|1<<j][nk]+=dp[bit][i];
      }
    }
  }
  vector<ll>fact(25,1);
  rep(i,20)fact[i+1]=fact[i]*(i+1);
  ll ans=dp[(1<<n)-1][0];

  rep(i,9)ans/=fact[c[i]];
  cout<<ans<<"\n";
}

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << fixed << setprecision(15);
  solve();
  return 0;
}
0