#489447 (C++17) No.1068 #いろいろな色 / Red and Blue and more various colors (Hard)

• 問題: No.1068 #いろいろな色 / Red and Blue and more various colors (Hard)
• ユーザー: knshnb
• 提出日時: 2020-05-30 03:35:51
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 392 ms / 3,500 ms
• コード長: 3,921 bytes
• コンパイル時間: 2,580 ms
• コンパイル使用メモリ: 212,748 KB
• 実行使用メモリ: 10,388 KB
• 最終ジャッジ日時: 2024-11-06 19:02:42
• 合計ジャッジ時間: 11,261 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	10 ms; 5,248 KB
testcase_04	AC	6 ms; 5,248 KB
testcase_05	AC	7 ms; 5,248 KB
testcase_06	AC	6 ms; 5,248 KB
testcase_07	AC	6 ms; 5,248 KB
testcase_08	AC	6 ms; 5,248 KB
testcase_09	AC	7 ms; 5,248 KB
testcase_10	AC	4 ms; 5,248 KB
testcase_11	AC	6 ms; 5,248 KB
testcase_12	AC	4 ms; 5,248 KB
testcase_13	AC	388 ms; 10,260 KB
testcase_14	AC	391 ms; 10,260 KB
testcase_15	AC	389 ms; 10,256 KB
testcase_16	AC	388 ms; 10,260 KB
testcase_17	AC	388 ms; 10,264 KB
testcase_18	AC	389 ms; 10,260 KB
testcase_19	AC	389 ms; 10,260 KB
testcase_20	AC	390 ms; 10,128 KB
testcase_21	AC	388 ms; 10,260 KB
testcase_22	AC	388 ms; 10,260 KB
testcase_23	AC	392 ms; 10,264 KB
testcase_24	AC	389 ms; 10,264 KB
testcase_25	AC	387 ms; 10,256 KB
testcase_26	AC	388 ms; 10,388 KB
testcase_27	AC	390 ms; 10,388 KB
testcase_28	AC	390 ms; 10,256 KB
testcase_29	AC	375 ms; 10,216 KB
testcase_30	AC	376 ms; 10,368 KB
testcase_31	AC	2 ms; 5,248 KB

コンパイルメッセージ

main.cpp: In instantiation of 'main()::<lambda(auto:28&&, Int, Int)> [with auto:28 = main()::<lambda(auto:28&&, Int, Int)>&; Int = long long int]':
main.cpp:124:31:   required from here
main.cpp:120:50: warning: narrowing conversion of '((((& a)->std::vector<long long int>::operator[](((std::vector<long long int>::size_type)l)) - 1) + ((long long int)MOD)) % ((long long int)MOD))' from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' [-Wnarrowing]
  120 |         if (r - l == 1) return {(a[l] - 1 + MOD) % MOD, 1};
      |                                 ~~~~~~~~~~~~~~~~~^~~~~
main.cpp:120:50: warning: narrowing conversion of '((((& a)->std::vector<long long int>::operator[](((std::vector<long long int>::size_type)l)) - 1) + ((long long int)MOD)) % ((long long int)MOD))' from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' [-Wnarrowing]

ソースコード

#include <bits/stdc++.h>  // clang-format off
using Int = long long;
#define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
struct SetupIO { SetupIO() { std::cin.tie(nullptr), std::ios::sync_with_stdio(false), std::cout << std::fixed << std::setprecision(13); } } setup_io;
#ifndef dump
#define dump(...)
#endif  // clang-format on

/**
 *    author:  knshnb
 *    created: Sat May 30 03:00:52 JST 2020
 **/

using namespace std;
template <int mod> struct NumberTheoreticTransform {
    vector<int> rev, rts;
    int base, max_base, root;

    NumberTheoreticTransform() : base(1), rev{0, 1}, rts{0, 1} {
        assert(mod >= 3 && mod % 2 == 1);
        auto tmp = mod - 1;
        max_base = 0;
        while (tmp % 2 == 0) tmp >>= 1, max_base++;
        root = 2;
        while (mod_pow(root, (mod - 1) >> 1) == 1) ++root;
        assert(mod_pow(root, mod - 1) == 1);
        root = mod_pow(root, (mod - 1) >> max_base);
    }

    inline int mod_pow(int x, int n) {
        int ret = 1;
        while (n > 0) {
            if (n & 1) ret = mul(ret, x);
            x = mul(x, x);
            n >>= 1;
        }
        return ret;
    }

    inline int inverse(int x) { return mod_pow(x, mod - 2); }

    inline unsigned add(unsigned x, unsigned y) {
        x += y;
        if (x >= mod) x -= mod;
        return x;
    }

    inline unsigned mul(unsigned a, unsigned b) { return 1ull * a * b % (unsigned long long)mod; }

    void ensure_base(int nbase) {
        if (nbase <= base) return;
        rev.resize(1 << nbase);
        rts.resize(1 << nbase);
        for (int i = 0; i < (1 << nbase); i++) {
            rev[i] = (rev[i >> 1] >> 1) + ((i & 1) << (nbase - 1));
        }
        assert(nbase <= max_base);
        while (base < nbase) {
            int z = mod_pow(root, 1 << (max_base - 1 - base));
            for (int i = 1 << (base - 1); i < (1 << base); i++) {
                rts[i << 1] = rts[i];
                rts[(i << 1) + 1] = mul(rts[i], z);
            }
            ++base;
        }
    }

    void ntt(vector<int> &a) {
        const int n = (int)a.size();
        assert((n & (n - 1)) == 0);
        int zeros = __builtin_ctz(n);
        ensure_base(zeros);
        int shift = base - zeros;
        for (int i = 0; i < n; i++) {
            if (i < (rev[i] >> shift)) {
                swap(a[i], a[rev[i] >> shift]);
            }
        }
        for (int k = 1; k < n; k <<= 1) {
            for (int i = 0; i < n; i += 2 * k) {
                for (int j = 0; j < k; j++) {
                    int z = mul(a[i + j + k], rts[j + k]);
                    a[i + j + k] = add(a[i + j], mod - z);
                    a[i + j] = add(a[i + j], z);
                }
            }
        }
    }

    vector<int> multiply(vector<int> a, vector<int> b) {
        int need = a.size() + b.size() - 1;
        int nbase = 1;
        while ((1 << nbase) < need) nbase++;
        ensure_base(nbase);
        int sz = 1 << nbase;
        a.resize(sz, 0);
        b.resize(sz, 0);
        ntt(a);
        ntt(b);
        int inv_sz = inverse(sz);
        for (int i = 0; i < sz; i++) {
            a[i] = mul(a[i], mul(b[i], inv_sz));
        }
        reverse(a.begin() + 1, a.end());
        ntt(a);
        a.resize(need);
        return a;
    }
};

const Int MOD = 998244353;
signed main() {
    NumberTheoreticTransform<MOD> ntt;
    Int n, Q;
    std::cin >> n >> Q;
    std::vector<Int> a(n);
    REP(i, n) std::cin >> a[i];
    auto dfs = [&](auto&& f, Int l, Int r) -> std::vector<int> {
        if (r - l == 1) return {(a[l] - 1 + MOD) % MOD, 1};
        Int mid = (l + r) / 2;
        return ntt.multiply(f(f, l, mid), f(f, mid, r));
    };
    std::vector<int> ans = dfs(dfs, 0, n);
    REP(q, Q) {
        Int b;
        std::cin >> b;
        std::cout << ans[b] << "\n";
    }
}