結果
問題 | No.1763 Many Balls |
ユーザー | tokusakurai |
提出日時 | 2021-11-09 08:51:31 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 977 ms / 10,000 ms |
コード長 | 11,671 bytes |
コンパイル時間 | 3,072 ms |
コンパイル使用メモリ | 237,200 KB |
実行使用メモリ | 13,164 KB |
最終ジャッジ日時 | 2023-09-02 00:11:30 |
合計ジャッジ時間 | 35,159 ms |
ジャッジサーバーID (参考情報) |
judge16 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 9 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 481 ms
8,564 KB |
testcase_07 | AC | 874 ms
11,352 KB |
testcase_08 | AC | 119 ms
5,376 KB |
testcase_09 | AC | 799 ms
12,816 KB |
testcase_10 | AC | 976 ms
11,752 KB |
testcase_11 | AC | 44 ms
5,756 KB |
testcase_12 | AC | 131 ms
8,168 KB |
testcase_13 | AC | 354 ms
11,172 KB |
testcase_14 | AC | 101 ms
5,544 KB |
testcase_15 | AC | 163 ms
5,664 KB |
testcase_16 | AC | 224 ms
5,872 KB |
testcase_17 | AC | 461 ms
7,380 KB |
testcase_18 | AC | 479 ms
8,252 KB |
testcase_19 | AC | 223 ms
6,004 KB |
testcase_20 | AC | 967 ms
11,176 KB |
testcase_21 | AC | 950 ms
11,008 KB |
testcase_22 | AC | 218 ms
5,608 KB |
testcase_23 | AC | 955 ms
11,168 KB |
testcase_24 | AC | 950 ms
11,092 KB |
testcase_25 | AC | 952 ms
11,236 KB |
testcase_26 | AC | 454 ms
7,236 KB |
testcase_27 | AC | 53 ms
4,380 KB |
testcase_28 | AC | 104 ms
4,376 KB |
testcase_29 | AC | 956 ms
11,264 KB |
testcase_30 | AC | 964 ms
11,380 KB |
testcase_31 | AC | 479 ms
8,764 KB |
testcase_32 | AC | 7 ms
4,376 KB |
testcase_33 | AC | 970 ms
12,088 KB |
testcase_34 | AC | 487 ms
8,692 KB |
testcase_35 | AC | 968 ms
11,324 KB |
testcase_36 | AC | 460 ms
7,336 KB |
testcase_37 | AC | 218 ms
5,396 KB |
testcase_38 | AC | 974 ms
12,268 KB |
testcase_39 | AC | 108 ms
4,540 KB |
testcase_40 | AC | 215 ms
5,612 KB |
testcase_41 | AC | 215 ms
5,268 KB |
testcase_42 | AC | 475 ms
8,516 KB |
testcase_43 | AC | 213 ms
5,468 KB |
testcase_44 | AC | 109 ms
4,712 KB |
testcase_45 | AC | 227 ms
5,904 KB |
testcase_46 | AC | 106 ms
4,460 KB |
testcase_47 | AC | 107 ms
4,456 KB |
testcase_48 | AC | 107 ms
4,440 KB |
testcase_49 | AC | 106 ms
4,452 KB |
testcase_50 | AC | 106 ms
4,400 KB |
testcase_51 | AC | 107 ms
4,400 KB |
testcase_52 | AC | 105 ms
4,456 KB |
testcase_53 | AC | 106 ms
4,404 KB |
testcase_54 | AC | 106 ms
4,388 KB |
testcase_55 | AC | 106 ms
4,448 KB |
testcase_56 | AC | 969 ms
13,040 KB |
testcase_57 | AC | 972 ms
12,980 KB |
testcase_58 | AC | 968 ms
13,044 KB |
testcase_59 | AC | 973 ms
13,040 KB |
testcase_60 | AC | 969 ms
12,988 KB |
testcase_61 | AC | 977 ms
13,044 KB |
testcase_62 | AC | 972 ms
13,068 KB |
testcase_63 | AC | 971 ms
13,048 KB |
testcase_64 | AC | 970 ms
13,164 KB |
testcase_65 | AC | 977 ms
12,984 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < n; i++) #define rep2(i, x, n) for (int i = x; i <= n; i++) #define rep3(i, x, n) for (int i = x; i >= n; i--) #define each(e, v) for (auto &e : v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; template <typename T> bool chmax(T &x, const T &y) { return (x < y) ? (x = y, true) : false; } template <typename T> bool chmin(T &x, const T &y) { return (x > y) ? (x = y, true) : false; } template <typename T> int flg(T x, int i) { return (x >> i) & 1; } template <typename T> void print(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' '); if (v.empty()) cout << '\n'; } template <typename T> void printn(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << '\n'; } template <typename T> int lb(const vector<T> &v, T x) { return lower_bound(begin(v), end(v), x) - begin(v); } template <typename T> int ub(const vector<T> &v, T x) { return upper_bound(begin(v), end(v), x) - begin(v); } template <typename T> void rearrange(vector<T> &v) { sort(begin(v), end(v)); v.erase(unique(begin(v), end(v)), end(v)); } template <typename T> vector<int> id_sort(const vector<T> &v, bool greater = false) { int n = v.size(); vector<int> ret(n); iota(begin(ret), end(ret), 0); sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; }); return ret; } template <typename S, typename T> pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first + q.first, p.second + q.second); } template <typename S, typename T> pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first - q.first, p.second - q.second); } template <typename S, typename T> istream &operator>>(istream &is, pair<S, T> &p) { S a; T b; is >> a >> b; p = make_pair(a, b); return is; } template <typename S, typename T> ostream &operator<<(ostream &os, const pair<S, T> &p) { return os << p.first << ' ' << p.second; } struct io_setup { io_setup() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; const int inf = (1 << 30) - 1; const ll INF = (1LL << 60) - 1; const int MOD = 90001; // const int MOD = 998244353; template <int mod> struct Mod_Int { int x; Mod_Int() : x(0) {} Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} static int get_mod() { return mod; } Mod_Int &operator+=(const Mod_Int &p) { if ((x += p.x) >= mod) x -= mod; return *this; } Mod_Int &operator-=(const Mod_Int &p) { if ((x += mod - p.x) >= mod) x -= mod; return *this; } Mod_Int &operator*=(const Mod_Int &p) { x = (int)(1LL * x * p.x % mod); return *this; } Mod_Int &operator/=(const Mod_Int &p) { *this *= p.inverse(); return *this; } Mod_Int &operator++() { return *this += Mod_Int(1); } Mod_Int operator++(int) { Mod_Int tmp = *this; ++*this; return tmp; } Mod_Int &operator--() { return *this -= Mod_Int(1); } Mod_Int operator--(int) { Mod_Int tmp = *this; --*this; return tmp; } Mod_Int operator-() const { return Mod_Int(-x); } Mod_Int operator+(const Mod_Int &p) const { return Mod_Int(*this) += p; } Mod_Int operator-(const Mod_Int &p) const { return Mod_Int(*this) -= p; } Mod_Int operator*(const Mod_Int &p) const { return Mod_Int(*this) *= p; } Mod_Int operator/(const Mod_Int &p) const { return Mod_Int(*this) /= p; } bool operator==(const Mod_Int &p) const { return x == p.x; } bool operator!=(const Mod_Int &p) const { return x != p.x; } Mod_Int inverse() const { assert(*this != Mod_Int(0)); return pow(mod - 2); } Mod_Int pow(long long k) const { Mod_Int now = *this, ret = 1; for (; k > 0; k >>= 1, now *= now) { if (k & 1) ret *= now; } return ret; } friend ostream &operator<<(ostream &os, const Mod_Int &p) { return os << p.x; } friend istream &operator>>(istream &is, Mod_Int &p) { long long a; is >> a; p = Mod_Int<mod>(a); return is; } }; using mint = Mod_Int<MOD>; template <typename T> struct Combination { static vector<T> _fac, _ifac; Combination() {} static void init(int n) { _fac.resize(n + 1), _ifac.resize(n + 1); _fac[0] = 1; for (int i = 1; i <= n; i++) _fac[i] = _fac[i - 1] * i; _ifac[n] = _fac[n].inverse(); for (int i = n; i >= 1; i--) _ifac[i - 1] = _ifac[i] * i; } static T fac(int k) { return _fac[k]; } static T ifac(int k) { return _ifac[k]; } static T inv(int k) { return fac(k - 1) * ifac(k); } static T P(int n, int k) { if (k < 0 || n < k) return 0; return fac(n) * ifac(n - k); } static T C(int n, int k) { if (k < 0 || n < k) return 0; return fac(n) * ifac(n - k) * ifac(k); } static T H(int n, int k) { // k個の区別できない玉をn個の区別できる箱に入れる場合の数 if (n < 0 || k < 0) return 0; return k == 0 ? 1 : C(n + k - 1, k); } static T second_stirling_number(int n, int k) { // n個の区別できる玉を、k個の区別しない箱に、各箱に1個以上玉が入るように入れる場合の数 T ret = 0; for (int i = 0; i <= k; i++) { T tmp = C(k, i) * T(i).pow(n); ret += ((k - i) & 1) ? -tmp : tmp; } return ret * ifac(k); } static T bell_number(int n, int k) { // n個の区別できる玉を、k個の区別しない箱に入れる場合の数 if (n == 0) return 1; k = min(k, n); vector<T> pref(k + 1); pref[0] = 1; for (int i = 1; i <= k; i++) { if (i & 1) { pref[i] = pref[i - 1] - ifac(i); } else { pref[i] = pref[i - 1] + ifac(i); } } T ret = 0; for (int i = 1; i <= k; i++) ret += T(i).pow(n) * ifac(i) * pref[k - i]; return ret; } }; template <typename T> vector<T> Combination<T>::_fac = vector<T>(); template <typename T> vector<T> Combination<T>::_ifac = vector<T>(); using comb = Combination<mint>; template <typename T> struct Number_Theoretic_Transform { static int max_base; static T root; static vector<T> r, ir; Number_Theoretic_Transform() {} static void init() { if (!r.empty()) return; int mod = T::get_mod(); int tmp = mod - 1; root = 2; while (root.pow(tmp >> 1) == 1) root++; max_base = 0; while (tmp % 2 == 0) tmp >>= 1, max_base++; r.resize(max_base), ir.resize(max_base); for (int i = 0; i < max_base; i++) { r[i] = -root.pow((mod - 1) >> (i + 2)); // r[i]:=1の2^(i+2)乗根 ir[i] = r[i].inverse(); // ir[i]:=1/r[i] } } static void ntt(vector<T> &a) { init(); int n = a.size(); assert((n & (n - 1)) == 0); assert(n <= (1 << max_base)); for (int k = n; k >>= 1;) { T w = 1; for (int s = 0, t = 0; s < n; s += 2 * k) { for (int i = s, j = s + k; i < s + k; i++, j++) { T x = a[i], y = w * a[j]; a[i] = x + y, a[j] = x - y; } w *= r[__builtin_ctz(++t)]; } } } static void intt(vector<T> &a) { init(); int n = a.size(); assert((n & (n - 1)) == 0); assert(n <= (1 << max_base)); for (int k = 1; k < n; k <<= 1) { T w = 1; for (int s = 0, t = 0; s < n; s += 2 * k) { for (int i = s, j = s + k; i < s + k; i++, j++) { T x = a[i], y = a[j]; a[i] = x + y, a[j] = w * (x - y); } w *= ir[__builtin_ctz(++t)]; } } T inv = T(n).inverse(); for (auto &e : a) e *= inv; } static vector<T> convolve(vector<T> a, vector<T> b) { int k = (int)a.size() + (int)b.size() - 1, n = 1; while (n < k) n <<= 1; a.resize(n), b.resize(n); ntt(a), ntt(b); for (int i = 0; i < n; i++) a[i] *= b[i]; intt(a), a.resize(k); return a; } }; template <typename T> int Number_Theoretic_Transform<T>::max_base = 0; template <typename T> T Number_Theoretic_Transform<T>::root = T(); template <typename T> vector<T> Number_Theoretic_Transform<T>::r = vector<T>(); template <typename T> vector<T> Number_Theoretic_Transform<T>::ir = vector<T>(); const int m1 = 1045430273; const int m2 = 1051721729; const int m3 = 1053818881; template <typename T> struct Arbitrary_Mod_Number_Theoretic_Transform { using mint_1 = Mod_Int<m1>; using mint_2 = Mod_Int<m2>; using mint_3 = Mod_Int<m3>; using NTT_1 = Number_Theoretic_Transform<mint_1>; using NTT_2 = Number_Theoretic_Transform<mint_2>; using NTT_3 = Number_Theoretic_Transform<mint_3>; Arbitrary_Mod_Number_Theoretic_Transform() {} static vector<T> convolve(const vector<T> &a, const vector<T> &b) { int n = a.size(), m = b.size(); vector<mint_1> a1(n), b1(m); vector<mint_2> a2(n), b2(m); vector<mint_3> a3(n), b3(m); for (int i = 0; i < n; i++) a1[i] = a[i].x, a2[i] = a[i].x, a3[i] = a[i].x; for (int i = 0; i < m; i++) b1[i] = b[i].x, b2[i] = b[i].x, b3[i] = b[i].x; auto x = NTT_1::convolve(a1, b1); auto y = NTT_2::convolve(a2, b2); auto z = NTT_3::convolve(a3, b3); const auto m1_inv_m2 = mint_2(m1).inverse().x; const auto m1m2_inv_m3 = (mint_3(m1) * m2).inverse().x; const auto m1m2_mod = (mint(m1) * m2).x; vector<T> ret(n + m - 1); for (int i = 0; i < n + m - 1; i++) { auto v1 = ((mint_2(y[i]) + m2 - x[i].x) * m1_inv_m2).x; auto v2 = ((z[i] + m3 - x[i].x - mint_3(m1) * v1) * m1m2_inv_m3).x; ret[i] = (T(x[i].x)) + T(m1) * v1 + T(m1m2_mod) * v2; } return ret; } }; using NTT = Arbitrary_Mod_Number_Theoretic_Transform<mint>; int main() { string S; int M; cin >> S >> M; reverse(all(S)); while (sz(S) < 4) S += '0'; vector<int> pw = {1, 10, 100, 1000, 10000}; int N = 0; rep2(i, 4, sz(S) - 1) { N += S[i] - '0'; N %= 9; } N *= pw[4]; rep(i, 4) N += (S[i] - '0') * pw[i]; if (N == 0) N = 90000; comb::init(N); vector<mint> f(N + 1, 0); f[0] = 1; vector<vector<int>> a(M + 1); rep(i, M) { int K; cin >> K; a[i].resize(K); rep(j, K) cin >> a[i][j]; } a[M].eb(1); rep(i, M + 1) { vector<mint> g(N + 1, 0); rep(j, N + 1) { bool flag = false; each(e, a[i]) { if (j % e == 0) flag = true; } if (flag) g[j] = comb::ifac(j); } f = NTT::convolve(f, g); f.resize(N + 1); } cout << f[N] * comb::fac(N) << '\n'; }