結果
問題 | No.1783 Remix Sum |
ユーザー | hitonanode |
提出日時 | 2021-12-12 01:32:24 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 10,672 bytes |
コンパイル時間 | 3,337 ms |
コンパイル使用メモリ | 190,572 KB |
実行使用メモリ | 30,576 KB |
最終ジャッジ日時 | 2024-07-20 10:06:55 |
合計ジャッジ時間 | 63,347 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 270 ms
5,636 KB |
testcase_05 | AC | 216 ms
5,624 KB |
testcase_06 | AC | 318 ms
5,896 KB |
testcase_07 | AC | 553 ms
7,752 KB |
testcase_08 | AC | 270 ms
5,664 KB |
testcase_09 | AC | 265 ms
5,504 KB |
testcase_10 | AC | 216 ms
5,628 KB |
testcase_11 | AC | 169 ms
5,624 KB |
testcase_12 | AC | 641 ms
7,748 KB |
testcase_13 | AC | 328 ms
7,216 KB |
testcase_14 | AC | 213 ms
5,660 KB |
testcase_15 | AC | 507 ms
24,052 KB |
testcase_16 | AC | 543 ms
7,748 KB |
testcase_17 | AC | 643 ms
7,748 KB |
testcase_18 | AC | 164 ms
5,756 KB |
testcase_19 | AC | 316 ms
5,660 KB |
testcase_20 | AC | 271 ms
5,660 KB |
testcase_21 | AC | 322 ms
5,668 KB |
testcase_22 | AC | 317 ms
5,532 KB |
testcase_23 | AC | 329 ms
5,792 KB |
testcase_24 | AC | 169 ms
5,576 KB |
testcase_25 | AC | 309 ms
5,892 KB |
testcase_26 | AC | 658 ms
7,744 KB |
testcase_27 | AC | 321 ms
6,024 KB |
testcase_28 | AC | 211 ms
5,884 KB |
testcase_29 | AC | 275 ms
5,796 KB |
testcase_30 | AC | 277 ms
5,788 KB |
testcase_31 | AC | 330 ms
5,536 KB |
testcase_32 | AC | 727 ms
24,676 KB |
testcase_33 | AC | 276 ms
5,668 KB |
testcase_34 | AC | 178 ms
6,092 KB |
testcase_35 | AC | 345 ms
7,612 KB |
testcase_36 | AC | 387 ms
24,572 KB |
testcase_37 | AC | 384 ms
24,572 KB |
testcase_38 | AC | 347 ms
7,480 KB |
testcase_39 | AC | 179 ms
6,096 KB |
testcase_40 | AC | 171 ms
6,152 KB |
testcase_41 | AC | 178 ms
6,096 KB |
testcase_42 | AC | 181 ms
6,100 KB |
testcase_43 | AC | 345 ms
7,464 KB |
testcase_44 | AC | 4,436 ms
6,776 KB |
testcase_45 | AC | 4,287 ms
7,296 KB |
testcase_46 | AC | 4,406 ms
6,320 KB |
testcase_47 | AC | 4,575 ms
7,068 KB |
testcase_48 | AC | 8,715 ms
8,476 KB |
testcase_49 | TLE | - |
testcase_50 | AC | 4,555 ms
6,900 KB |
testcase_51 | AC | 4,882 ms
7,292 KB |
testcase_52 | AC | 4,357 ms
6,444 KB |
testcase_53 | AC | 4,509 ms
7,072 KB |
testcase_54 | AC | 8,724 ms
8,480 KB |
testcase_55 | TLE | - |
testcase_56 | AC | 6,206 ms
6,672 KB |
testcase_57 | AC | 5,947 ms
7,188 KB |
testcase_58 | AC | 6,095 ms
6,572 KB |
testcase_59 | AC | 6,338 ms
6,948 KB |
testcase_60 | TLE | - |
testcase_61 | -- | - |
testcase_62 | -- | - |
testcase_63 | -- | - |
testcase_64 | -- | - |
testcase_65 | -- | - |
testcase_66 | -- | - |
testcase_67 | -- | - |
testcase_68 | -- | - |
testcase_69 | -- | - |
testcase_70 | -- | - |
testcase_71 | -- | - |
testcase_72 | -- | - |
testcase_73 | -- | - |
testcase_74 | -- | - |
testcase_75 | -- | - |
testcase_76 | -- | - |
testcase_77 | -- | - |
testcase_78 | -- | - |
testcase_79 | -- | - |
ソースコード
#include <algorithm> #include <array> #include <bitset> #include <cassert> #include <chrono> #include <cmath> #include <complex> #include <deque> #include <forward_list> #include <fstream> #include <functional> #include <iomanip> #include <ios> #include <iostream> #include <limits> #include <list> #include <map> #include <numeric> #include <queue> #include <random> #include <set> #include <sstream> #include <stack> #include <string> #include <tuple> #include <type_traits> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; using lint = long long; using pint = pair<int, int>; using plint = pair<lint, lint>; struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_; #define ALL(x) (x).begin(), (x).end() #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++) #define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) template <typename T, typename V> void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); } template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); } template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; } template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; } int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); } template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); } template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); } template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; } template <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); } template <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); } template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; } template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; } #if __cplusplus >= 201703L template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; } template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; } #endif template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; } template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } #ifdef HITONANODE_LOCAL const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m"; #define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl #define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr) #else #define dbg(x) (x) #define dbgif(cond, x) 0 #endif constexpr int md = (115 << 20) + 1; #include <atcoder/modint> using mint = atcoder::static_modint<md>; #include <atcoder/convolution> // Multivariate convolution (Linear, overflow cutoff) // Complexity: (kN \log N + k^2 N)$ // Note that the vectors store the infomation in **column-major order** // Implementation idea: https://rushcheyo.blog.uoj.ac/blog/6547 // Details of my implementation: https://hitonanode.github.io/cplib-cpp/convolution/multivar_ntt.hpp template <typename MODINT> struct multivar_ntt { int K, N, fftlen; std::vector<int> dim; std::vector<int> chi; MODINT invfftlen; private: void _initialize(const std::vector<int> &dim_) { dim = dim_; K = dim_.size(); N = std::accumulate(dim_.begin(), dim_.end(), 1, [&](int l, int r) { return l * r; }); fftlen = 1; while (fftlen < N * 2) fftlen <<= 1; invfftlen = MODINT(fftlen).inv(); chi.resize(fftlen); int t = 1; for (auto d : dim_) { t *= d; for (int s = t; s < fftlen; s += t) chi[s] += 1; } for (int i = 0; i + 1 < fftlen; i++) { chi[i + 1] += chi[i]; if (chi[i + 1] >= K) chi[i + 1] -= K; } } std::vector<MODINT> _convolve(const std::vector<MODINT> &f, const std::vector<MODINT> &g) const { assert(int(f.size()) == N); assert(int(g.size()) == N); if (dim.empty()) return {f[0] * g[0]}; std::vector<std::vector<MODINT>> fex(K, std::vector<MODINT>(fftlen)), gex(K, std::vector<MODINT>(fftlen)); for (int i = 0; i < N; i++) fex[chi[i]][i] = f[i], gex[chi[i]][i] = g[i]; for (auto &vec : fex) atcoder::internal::butterfly(vec); for (auto &vec : gex) atcoder::internal::butterfly(vec); std::vector<std::vector<MODINT>> hex(K, std::vector<MODINT>(fftlen)); for (int df = 0; df < K; df++) { for (int dg = 0; dg < K; dg++) { int dh = (df + dg < K) ? df + dg : df + dg - K; for (int i = 0; i < fftlen; i++) hex[dh][i] += fex[df][i] * gex[dg][i]; } } for (auto &vec : hex) atcoder::internal::butterfly_inv(vec); std::vector<MODINT> ret(N); for (int i = 0; i < N; i++) ret[i] = hex[chi[i]][i] * invfftlen; return ret; } public: multivar_ntt(const std::vector<int> &dim_) { _initialize(dim_); } std::vector<MODINT> operator()(const std::vector<MODINT> &f, const std::vector<MODINT> &g) const { return _convolve(f, g); } }; // 元ネタが分からないんですが,OpenCup の 7 乗根のやつですか? int main() { constexpr int E = 10; const mint r10 = 9142366; int N, K; lint M; int T; cin >> N >> K >> M >> T; int K10 = 1; REP(t, K) K10 *= 10; vector<int> A(N); cin >> A; vector<int> diminfo(T, E); // T 桁切捨,K - T 桁周期 multivar_ntt<mint> mntt(diminfo); vector nttmat(E, vector<mint>(E)); REP(i, nttmat.size()) REP(j, nttmat[i].size()) nttmat[i][j] = r10.pow(i * j); auto inttmat = nttmat; for (auto &vec : inttmat) for (auto &x : vec) x = x.inv() / mint(10); auto ntt10 = [&](const vector<mint> &v) -> vector<mint> { vector<mint> ret(E); REP(i, E) REP(j, E) ret[i] += nttmat[i][j] * v[j]; return ret; }; auto intt10 = [&](const vector<mint> &v) -> vector<mint> { vector<mint> ret(E); REP(i, E) REP(j, E) ret[i] += inttmat[i][j] * v[j]; return ret; }; auto multiconv = [&](vector<mint> f, vector<mint> g) -> vector<mint> { for (int di = mntt.N; di < K10; di *= 10) { for (int l = 0; l < K10; l += di * 10) { for (int i = l; i < l + di; ++i) { // [i, i + di, i + 2di, ..., i + 9di] を NTT auto impose_ntt = [&](vector<mint> &v) { vector<mint> ntttmp(E); REP(k, E) ntttmp[k] = v[i + k * di]; ntttmp = ntt10(ntttmp); REP(k, E) v[i + k * di] = ntttmp[k]; }; impose_ntt(f); impose_ntt(g); } } } vector<mint> ret; for (int l = 0; l < K10; l += mntt.N) { vector<mint> fsub(f.begin() + l, f.begin() + l + mntt.N); vector<mint> gsub(g.begin() + l, g.begin() + l + mntt.N); auto c = mntt(fsub, gsub); ret.insert(ret.end(), c.begin(), c.end()); } for (int di = mntt.N; di < K10; di *= 10) { for (int l = 0; l < K10; l += di * 10) { for (int i = l; i < l + di; ++i) { // [i, i + di, i + 2di, ..., i + 9di] を NTT auto impose_intt = [&](vector<mint> &v) { vector<mint> ntttmp(E); REP(k, E) ntttmp[k] = v[i + k * di]; ntttmp = intt10(ntttmp); REP(k, E) v[i + k * di] = ntttmp[k]; }; impose_intt(ret); } } } return ret; }; vector<mint> dp(K10), trans(K10); dp[0] = 1; for (auto a : A) trans[a] += 1; while (M) { if (M & 1) dp = multiconv(dp, trans); trans = multiconv(trans, trans); M /= 2; } for (auto x : dp) cout << x.val() << '\n'; }