結果
問題 | No.1068 #いろいろな色 / Red and Blue and more various colors (Hard) |
ユーザー |
|
提出日時 | 2020-09-15 10:59:50 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2,535 ms / 3,500 ms |
コード長 | 2,489 bytes |
コンパイル時間 | 920 ms |
コンパイル使用メモリ | 65,868 KB |
最終ジャッジ日時 | 2025-01-14 15:01:01 |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 29 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:96:18: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 96 | int N, Q; scanf("%d%d", &N, &Q); | ~~~~~^~~~~~~~~~~~~~~~ main.cpp:99:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 99 | uint64_t a; scanf("%lu", &a); | ~~~~~^~~~~~~~~~~ main.cpp:109:19: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 109 | int pos; scanf("%d", &pos); | ~~~~~^~~~~~~~~~~~
ソースコード
#include <cstdint>#include <cstdio>#include <queue>#include <map>#include <vector>using namespace std;using u32 = uint32_t;constexpr u32 O = 3,D = 119,S = 23,M = D << S | 1,M2 = M - 2;inline constexpr u32 mod_mul(u32 x, uint64_t y) {return static_cast<u32>(x * y % M);}inline constexpr u32 mod_pow(u32 a, u32 n) {u32 res = 1;for(; n; n>>=1) {if(n & 1) { res = mod_mul(res, a); }a = mod_mul(a, a);}return res;}template <size_t N> struct Seq {u32 arr[N+N];constexpr Seq() : arr() {arr[0] = mod_pow(O, D);arr[N] = mod_pow(arr[0], M-2);for(size_t i=0; i<N-1; ++i) {arr[ i+1] = mod_mul(arr[ i], arr[ i]);arr[N+i+1] = mod_mul(arr[N+i], arr[N+i]);}}};constexpr auto cache = Seq<S>();void myfmt(vector<u32> &a, bool inv, size_t ln) {u32 n = static_cast<u32>(a.size());if(n == 1) { return; }size_t m = n / 2;vector<u32> a0(m), a1(m);for(size_t i=0, j=0; i<m; ++i) {a0[i] = a[j++];a1[i] = a[j++];}myfmt(a0, inv, ln-1);myfmt(a1, inv, ln-1);u32 z = cache.arr[inv*S + S-ln];u32 pz = 1;for(size_t i=0, k=0; k<m; ++i, ++k) {a[k] = a0[i] + mod_mul(a1[i], pz);if(a[k] >= M) { a[k] -= M; }pz = mod_mul(pz, z);}for(size_t i=0, k=m; k<n; ++i, ++k) {a[k] = a0[i] + mod_mul(a1[i], pz);if(a[k] >= M) { a[k] -= M; }pz = mod_mul(pz, z);}}void fmt(vector<u32> &a, size_t ln) {myfmt(a, false, ln);}void ifmt(vector<u32> &a, size_t ln) {myfmt(a, true, ln);u32 n = static_cast<u32>(a.size());u32 inv = mod_pow(n, M2);for(size_t i=0; i<n; ++i) {a[i] = mod_mul(a[i], inv);}}vector<u32> convol(vector<u32> &a, vector<u32> &b) {size_t n = 1, ln = 0;while(n < a.size() + b.size() - 1) { n <<= 1; ++ln; }a.resize(n);b.resize(n);fmt(a, ln);fmt(b, ln);vector<u32> c(n);for(size_t i=0; i<n; ++i) {c[i] = mod_mul(a[i], b[i]);}ifmt(c, ln);return c;}int main(void) {int N, Q; scanf("%d%d", &N, &Q);queue<vector<u32>> que;for(int i=0; i<N; ++i) {uint64_t a; scanf("%lu", &a);que.push({static_cast<u32>(--a % M), 1});}while(que.size() > 1) {vector<u32> a = que.front(); que.pop();vector<u32> b = que.front(); que.pop();que.emplace(convol(a, b));}vector<u32> v = que.front();for(int q=0; q<Q; ++q) {int pos; scanf("%d", &pos);printf("%u\n", v[pos]);}return 0;}