結果
問題 | No.1629 Sorting Integers (SUM of M) |
ユーザー | nawawan |
提出日時 | 2021-07-30 20:37:35 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 129 ms / 2,000 ms |
コード長 | 3,276 bytes |
コンパイル時間 | 1,571 ms |
コンパイル使用メモリ | 168,040 KB |
実行使用メモリ | 14,172 KB |
最終ジャッジ日時 | 2023-10-14 02:52:25 |
合計ジャッジ時間 | 3,502 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 12 ms
12,928 KB |
testcase_01 | AC | 13 ms
12,996 KB |
testcase_02 | AC | 13 ms
12,996 KB |
testcase_03 | AC | 13 ms
12,956 KB |
testcase_04 | AC | 49 ms
13,388 KB |
testcase_05 | AC | 24 ms
13,064 KB |
testcase_06 | AC | 26 ms
13,264 KB |
testcase_07 | AC | 79 ms
13,588 KB |
testcase_08 | AC | 63 ms
13,372 KB |
testcase_09 | AC | 72 ms
13,344 KB |
testcase_10 | AC | 61 ms
13,372 KB |
testcase_11 | AC | 47 ms
13,164 KB |
testcase_12 | AC | 68 ms
13,432 KB |
testcase_13 | AC | 76 ms
13,460 KB |
testcase_14 | AC | 56 ms
13,080 KB |
testcase_15 | AC | 76 ms
13,404 KB |
testcase_16 | AC | 74 ms
13,404 KB |
testcase_17 | AC | 129 ms
14,172 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; template<const int MOD> struct modint{ long long val; modint(): val(0) {} modint(long long x){ if(x < 0) val = x % MOD + MOD; else val = x % MOD; } modint(const modint &t){ val = t.val; } modint& operator =(const modint m){ val = m.val; return *this; } modint operator -(){ return modint(-val); } modint& operator-=(const modint &m){ val -= m.val; if(val < 0) val += MOD; return *this; } modint& operator+=(const modint &m){ val += m.val; if(val >= MOD) val -= MOD; return *this; } modint& operator*=(const modint &m){ val *= m.val; val %= MOD; return *this; } modint& operator/=(modint m){ *this *= m.inv(); return *this; } modint inv(){ long long x = 1, y = 0; long long a = val, b = MOD; while(b != 0){ long long t = a / b; a -= t * b; x -= t * y; swap(a, b); swap(x, y); } x %= MOD; if(x < 0) x += MOD; return modint(x); } modint pow(long long k){ long long res = 1; long long v = val; while(k > 0){ if(k & 1) res = res * v % MOD; v = v * v % MOD; k >>= 1; } return modint(res); } bool operator==(const modint &m){ return val == m.val; } modint operator+(const modint &m){ return modint(*this) += m; } modint operator-(const modint &m){ return modint(*this) -= m; } modint operator*(const modint &m){ return modint(*this) *= m; } modint operator/(const modint &m){ return modint(*this) /= m; } bool operator!=(const modint &m){ return modint(*this).val != m.val; } bool operator!=(const int &m){ return modint(*this).val != m; } }; const int MOD = 1000000007; using mint = modint<MOD>; const int MAX = 410000; mint fac[MAX], finv[MAX], inv[MAX]; //MAX < MOD void COMinit(){ fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for(int i = 2; i < MAX; i++){ fac[i] = fac[i - 1] * i; inv[i] = mint(MOD) - inv[MOD % i] * (MOD / i); finv[i] = finv[i - 1] * inv[i]; } } mint COM(int n, int k){ if (n < k) return 0; if (n < 0 || k < 0) return 0; return fac[n] * finv[k] * finv[n - k]; } int main(){ COMinit(); int N; cin >> N; vector<int> c(9); for(int i = 0; i < 9; i++) cin >> c[i]; vector<mint> ten(N + 1); ten[0] = 1; for(int i = 0; i < N; i++) ten[i + 1] = ten[i] * 10; mint ans = 0; for(int i = 0; i < N; i++){ for(int j = 0; j < 9; j++){ mint com = 1; int rest = N - 1; for(int k = 0; k < 9; k++){ if(j == k){ com *= COM(rest, c[k] - 1); rest -= c[k] - 1; } else { com *= COM(rest, c[k]); rest -= c[k]; } } ans += ten[i] * (j + 1) * com; } } cout << ans.val << endl; }