#723635 (C++17) No.1783 Remix Sum

提出ソース

結果

問題	No.1783 Remix Sum
ユーザー	👑 hitonanode
提出日時	2021-12-12 02:06:47
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	10,818 bytes
コンパイル時間	3,158 ms
コンパイル使用メモリ	190,072 KB
実行使用メモリ	24,016 KB
最終ジャッジ日時	2023-09-27 16:32:04
合計ジャッジ時間	64,840 ms
ジャッジサーバーID （参考情報）	judge15 / judge11

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,376 KB
testcase_01	AC	1 ms 4,376 KB
testcase_02	AC	2 ms 4,380 KB
testcase_03	AC	1 ms 4,380 KB
testcase_04	AC	56 ms 4,468 KB
testcase_05	AC	55 ms 4,600 KB
testcase_06	AC	110 ms 4,488 KB
testcase_07	AC	511 ms 6,208 KB
testcase_08	AC	149 ms 4,488 KB
testcase_09	AC	147 ms 4,516 KB
testcase_10	AC	55 ms 4,524 KB
testcase_11	AC	52 ms 4,584 KB
testcase_12	AC	618 ms 6,320 KB
testcase_13	AC	312 ms 6,256 KB
testcase_14	AC	128 ms 4,476 KB
testcase_15	AC	483 ms 22,752 KB
testcase_16	AC	510 ms 6,380 KB
testcase_17	AC	611 ms 6,184 KB
testcase_18	AC	52 ms 4,528 KB
testcase_19	AC	180 ms 4,740 KB
testcase_20	AC	197 ms 4,680 KB
testcase_21	AC	173 ms 4,452 KB
testcase_22	AC	177 ms 4,516 KB
testcase_23	AC	232 ms 4,604 KB
testcase_24	AC	128 ms 4,540 KB
testcase_25	AC	113 ms 4,564 KB
testcase_26	AC	604 ms 6,260 KB
testcase_27	AC	114 ms 4,652 KB
testcase_28	AC	86 ms 4,696 KB
testcase_29	AC	196 ms 4,576 KB
testcase_30	AC	196 ms 4,608 KB
testcase_31	AC	175 ms 4,472 KB
testcase_32	AC	728 ms 23,500 KB
testcase_33	AC	197 ms 4,580 KB
testcase_34	AC	134 ms 5,056 KB
testcase_35	AC	331 ms 6,724 KB
testcase_36	AC	376 ms 23,260 KB
testcase_37	AC	384 ms 23,108 KB
testcase_38	AC	318 ms 6,792 KB
testcase_39	AC	135 ms 5,072 KB
testcase_40	AC	80 ms 4,964 KB
testcase_41	AC	136 ms 5,068 KB
testcase_42	AC	140 ms 5,056 KB
testcase_43	AC	322 ms 6,880 KB
testcase_44	AC	135 ms 5,004 KB
testcase_45	WA	-
testcase_46	WA	-
testcase_47	WA	-
testcase_48	WA	-
testcase_49	WA	-
testcase_50	AC	136 ms 4,856 KB
testcase_51	WA	-
testcase_52	WA	-
testcase_53	WA	-
testcase_54	WA	-
testcase_55	WA	-
testcase_56	AC	170 ms 4,880 KB
testcase_57	WA	-
testcase_58	WA	-
testcase_59	WA	-
testcase_60	WA	-
testcase_61	WA	-
testcase_62	AC	136 ms 4,992 KB
testcase_63	WA	-
testcase_64	WA	-
testcase_65	WA	-
testcase_66	WA	-
testcase_67	AC	3,718 ms 23,800 KB
testcase_68	AC	80 ms 4,996 KB
testcase_69	AC	171 ms 4,916 KB
testcase_70	AC	282 ms 4,888 KB
testcase_71	AC	389 ms 5,052 KB
testcase_72	AC	1,009 ms 6,740 KB
testcase_73	AC	1,208 ms 23,988 KB
testcase_74	AC	76 ms 4,856 KB
testcase_75	AC	174 ms 4,912 KB
testcase_76	AC	293 ms 4,844 KB
testcase_77	AC	210 ms 5,088 KB
testcase_78	AC	711 ms 6,836 KB
testcase_79	AC	721 ms 23,880 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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;
    M %= (mint::mod() - 1);  // ?????
    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 array<mint, 10> &v) {
        array<mint, 10> ret;
        ret.fill(0);
        REP(i, E) REP(j, E) ret[i] += nttmat[i][j] * v[j];
        return ret;
    };

    auto intt10 = [&](const array<mint, 10> &v) {
        array<mint, 10> ret;
        ret.fill(0);
        REP(i, E) REP(j, E) ret[i] += inttmat[i][j] * v[j];
        return ret;
    };

    auto circular_ntt = [&](vector<mint> &f) {
        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) {
                        static array<mint, 10> ntttmp;
                        ntttmp.fill(0);
                        REP(k, E) ntttmp[k] = v[i + k * di];
                        ntttmp = ntt10(ntttmp);
                        REP(k, E) v[i + k * di] = ntttmp[k];
                    };
                    impose_ntt(f);
                }
            }
        }
    };
    auto circular_intt = [&](vector<mint> &g) {
        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) {
                        static array<mint, 10> ntttmp;
                        REP(k, E) ntttmp[k] = v[i + k * di];
                        ntttmp = intt10(ntttmp);
                        REP(k, E) v[i + k * di] = ntttmp[k];
                    };
                    impose_intt(g);
                }
            }
        }
    };

    vector<mint> dp(K10), trans(K10);
    dp[0] = 1;
    for (auto a : A) trans[a] += 1;


    circular_ntt(dp);
    circular_ntt(trans);

    vector<mint> ret;
    for (int l = 0; l < K10; l += mntt.N) {
        vector<mint> fsub(dp.begin() + l, dp.begin() + l + mntt.N);
        vector<mint> gsub(trans.begin() + l, trans.begin() + l + mntt.N);
        lint p = M;
        while (p) {
            if (p & 1) fsub = mntt(fsub, gsub);
            gsub = mntt(gsub, gsub);
            p /= 2;
        }
        ret.insert(ret.end(), fsub.begin(), fsub.end());
    }
    dp = ret;

    circular_intt(dp);

    for (auto x : dp) cout << x.val() << '\n';
}

yukicoder

結果

テストケース

ソースコード