結果
| 問題 | No.1068 #いろいろな色 / Red and Blue and more various colors (Hard) |
| ユーザー |
 satanic
|
| 提出日時 | 2020-05-29 22:01:06 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 842 ms / 3,500 ms |
| コード長 | 12,430 bytes |
| コンパイル時間 | 1,623 ms |
| コンパイル使用メモリ | 134,684 KB |
| 実行使用メモリ | 12,076 KB |
| 最終ジャッジ日時 | 2024-11-06 04:40:27 |
| 合計ジャッジ時間 | 18,434 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,816 KB |
| testcase_01 | AC | 2 ms
6,816 KB |
| testcase_02 | AC | 2 ms
6,820 KB |
| testcase_03 | AC | 20 ms
6,816 KB |
| testcase_04 | AC | 12 ms
6,816 KB |
| testcase_05 | AC | 14 ms
6,816 KB |
| testcase_06 | AC | 11 ms
6,820 KB |
| testcase_07 | AC | 11 ms
6,820 KB |
| testcase_08 | AC | 13 ms
6,816 KB |
| testcase_09 | AC | 15 ms
6,816 KB |
| testcase_10 | AC | 8 ms
6,820 KB |
| testcase_11 | AC | 11 ms
6,816 KB |
| testcase_12 | AC | 7 ms
6,816 KB |
| testcase_13 | AC | 840 ms
11,940 KB |
| testcase_14 | AC | 834 ms
11,944 KB |
| testcase_15 | AC | 825 ms
11,860 KB |
| testcase_16 | AC | 829 ms
11,944 KB |
| testcase_17 | AC | 838 ms
11,944 KB |
| testcase_18 | AC | 842 ms
11,968 KB |
| testcase_19 | AC | 832 ms
12,072 KB |
| testcase_20 | AC | 840 ms
11,980 KB |
| testcase_21 | AC | 842 ms
11,944 KB |
| testcase_22 | AC | 833 ms
12,068 KB |
| testcase_23 | AC | 834 ms
11,944 KB |
| testcase_24 | AC | 839 ms
12,076 KB |
| testcase_25 | AC | 830 ms
11,944 KB |
| testcase_26 | AC | 840 ms
11,948 KB |
| testcase_27 | AC | 834 ms
11,944 KB |
| testcase_28 | AC | 841 ms
11,944 KB |
| testcase_29 | AC | 819 ms
11,948 KB |
| testcase_30 | AC | 821 ms
12,072 KB |
| testcase_31 | AC | 2 ms
6,816 KB |
コンパイルメッセージ
main.cpp: In instantiation of 'main()::<lambda(auto:1&&, int, int)> [with auto:1 = main()::<lambda(auto:1&&, int, int)>&]':
main.cpp:261:14: required from here
main.cpp:257:52: warning: narrowing conversion of '(((& a)->std::vector<long int>::operator[](((std::vector<long int>::size_type)l)) == 0) ? (((long int)MOD) - 1) : ((& a)->std::vector<long int>::operator[](((std::vector<long int>::size_type)l)) - 1))' from 'long int' to 'int' [-Wnarrowing]
257 | if (r - l == 1) return { a[l] == 0 ? (MOD - 1) : (a[l] - 1), 1 };
main.cpp:257:52: warning: narrowing conversion of '(((& a)->std::vector<long int>::operator[](((std::vector<long int>::size_type)l)) == 0) ? (((long int)MOD) - 1) : ((& a)->std::vector<long int>::operator[](((std::vector<long int>::size_type)l)) - 1))' from 'long int' to 'int' [-Wnarrowing]
ソースコード
//
// S i r o t a n w a t c h e s o v e r y o u .
//
// ...Jggg+J+JJJg@NQmgJa.....,
// ....gH@@@@HHB""""7"YYYYHMMMMMMM@@@@@@@Hma,.
// ...JH@@MMHY"! ? __""YH@@@@N&...
// ..JH@@HY"~ _TW@@@Mme.
// .Jg@@#"= _TTM@@N..
// .Jg@@MY! ?T@@@h,.
// .-@@@B! (TM@@@L
// .(H@MY ?W@@@+
// .W@@@ .T@@@[
// .d@@M! .T@@N,
// .d@M@' -W@@o.
// (@@M\ ?M@N,
// -d@M% .., .., j@@b
// d@@M= TM9 ?MD W@@[
// .H@M: .W@H,
// H@Ht ,@@#
// (@@M~ .@@h.
// .@@M% ..gmHHJ. .JdHga. .H@@e
// j@@#_ .@@@@@@@b J@@@@@@@h. .H@@\
// d@@@ .4@@@@@@MF (@@@@@@@@ H@@b
// d@@[ ?"BMY"= .d@@@@H, ?TWHHY"! d@@e
// J@@b .JJJ-.., ,@@@@@@M% ......... -@@@M.
// ?@@M\ ?YHHM@@@@b .. .W@@HP X@@HMWY"= d@@@#
// ,@@@L. ?H@Ng&+gd@@#H@@NHaJ+gH@[ J@@@]
// X@@@[ ...... ?"YYYYY"" ?"YHHHB"^ ..... (@@@#
// WH@N+. .W@@@@MHB= .TWH@M@Hmc .H@@M~
// .H@@@@N, _!~ .d@@@N,
// .J@@#T@@@N, .d@@@@@@@b.
// (@@@@! .T@@@n, .(H@@@H>.W@@@x
// (@@@F 4@@@@MaJ. .d@@@@Y77 4@@@r
//.H@@P ?TM@@@@N... .-JH@HMY= d@@N,
//(@@@F ?"WM@@@MQa-,. .(J(JN@@M#" Z@@@L
// d@@H, (M@@@@@@@Ng&maJ.... .. ...J.J+W@@@@@@HY! .dH@b
// ?M@@@N&. ..(JW@@@MM"?7""TYHMH@@HH@@@@@HHHgkHagHa(mggdmmagH@H@@Q@@HMMMHY"7!TMM@@@HaJ,. ..H@@@M^
// ?"W@@@@MN@@@@@H@@MMY" _???!"= ?WMMBYYTMH=7""Y@""?"~^ _"YM@@@@@@@@MH@@@@@#"^
// ?77WMMMYB""! _7"WWMMMY"7=
// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
//#include <deque>
#include <valarray>
#include <unordered_map>
#include <unordered_set>
#include <array>
// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
#include <fstream>
// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest& ...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest& ...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest& ...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)std::cin>>w;
// output
template<typename T>void MACRO_OUT(const T t) { std::cout << t; }
template<typename First, typename...Rest>void MACRO_OUT(const First first, const Rest...rest) { std::cout << first << " "; MACRO_OUT(rest...); }
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define FOUT(n, dist) std::cout<<std::fixed<<std::setprecision(n)<<(dist);
#define SOUT(n, c, dist) std::cout<<std::setw(n)<<std::setfill(c)<<(dist);
#define EOUT(...) { OUT(__VA_ARGS__)BR; exit(0); }
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(dist) {std::cerr << #dist << "\t: " << (dist) << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t: ";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t: ";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
#define SHOWSTACK(a) {auto tmp(a);std::cerr << #a << "\t: ";while(!tmp.empty()){std::cerr << tmp.top() << " ";tmp.pop();}std::cerr << "\n";}
// utility
#define ALL(a) (a).begin(),(a).end()
#define FOR(w, a, n) for(int w=(a);w<(n);++w)
#define REP(w, n) FOR(w, 0, n)
#define RFOR(w, a, n) for(int w=(n)-1;w>=(a);--w)
#define RREP(w, n) RFOR(w, 0, n)
template<class S, class T, class U> bool IN(S a, T x, U b) { return a <= x && x < b; }
template<class T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
// test
template<class T> using V = std::vector<T>;
template<class T> using VV = V<V<T>>;
template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
os << "(" << p.first << ", " << p.second << ")"; return os;
}
// type/const
using i64 = std::int_fast64_t;
using u64 = std::uint_fast64_t;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<i64, i64>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = (1 << 30) - 1; // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60; // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18
constexpr double EPS = 1e-6;
constexpr i64 MOD = 998244353;
constexpr double PI = 3.141592653589793238462643383279;
template<class T, size_t N> void FILL(T(&a)[N], const T & val) { for (auto& x : a) x = val; }
template<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T & val) { for (auto& b : a) FILL(b, val); }
template<class T> void FILL(std::vector<T> & a, const T & val) { for (auto& x : a) x = val; }
template<class ARY, class T> void FILL(std::vector<std::vector<ARY>> & a, const T & val) { for (auto& b : a) FILL(b, val); }
// ------------>8---------
// Description: 整数列a[i],b[i]から列c[k]=sum{a[i]*b[k-i]}を生成する.任意modに対応.O(NlogN).
namespace NTT {
std::vector<int> tmp;
size_t sz = 1;
inline int powMod(int n, int p, int m) {
int res = 1;
while (p) {
if (p & 1) res = (ll)res * n % m;
n = (ll)n * n % m;
p >>= 1;
}
return (int)res;
}
inline int invMod(int n, int m) {
return powMod(n, m - 2, m);
}
template <int Mod, int PrimitiveRoot>
struct NTTPart {
static std::vector<int> ntt(std::vector<int> a, bool inv = false) {
size_t mask = sz - 1;
size_t p = 0;
for (size_t i = sz >> 1; i >= 1; i >>= 1) {
auto& cur = (p & 1) ? tmp : a;
auto& nex = (p & 1) ? a : tmp;
int e = powMod(PrimitiveRoot, (Mod - 1) / sz * i, Mod);
if (inv) e = invMod(e, Mod);
int w = 1;
for (size_t j = 0; j < sz; j += i) {
for (size_t k = 0; k < i; ++k) {
nex[j + k] = (cur[((j << 1) & mask) + k] + (ll)w * cur[(((j << 1) + i) & mask) + k]) % Mod;
}
w = (ll)w * e % Mod;
}
++p;
}
if (p & 1) std::swap(a, tmp);
if (inv) {
int invSz = invMod(sz, Mod);
for (size_t i = 0; i < sz; ++i) a[i] = (ll)a[i] * invSz % Mod;
}
return a;
}
static std::vector<int> mul(std::vector<int> a, std::vector<int> b) {
a = ntt(a);
b = ntt(b);
for (size_t i = 0; i < sz; ++i) a[i] = (ll)a[i] * b[i] % Mod;
a = ntt(a, true);
return a;
}
};
constexpr int M[] = { 998244353, 469762049, 167772161 };
constexpr int PR[] = { 3, 3, 3 };
constexpr int NTT_CONVOLUTION_TIME = 1;
/*
X := max(a)*max(b)*min(|a|, |b|) のとき,
NTT_CONVOLUTION_TIME <- 1: X < 1224736769 = 1.2*10^ 9 ~ 2^30
NTT_CONVOLUTION_TIME <- 2: X < 575334854091079681 = 5.8*10^17 ~ 2^59
NTT_CONVOLUTION_TIME <- 3: X < 2^86 (32bit * 32bit * 10^7くらいまで)
*/
inline void garner(std::vector<int> * c, int mod) {
if (NTT_CONVOLUTION_TIME == 1) {
for (auto& x : c[0]) x %= mod;
}
else if (NTT_CONVOLUTION_TIME == 2) {
const int r01 = invMod(M[0], M[1]);
for (size_t i = 0; i < sz; ++i) {
c[1][i] = (c[1][i] - c[0][i]) * (ll)r01 % M[1];
if (c[1][i] < 0) c[1][i] += M[1];
c[0][i] = (c[0][i] + (ll)c[1][i] * M[0]) % mod;
}
}
else if (NTT_CONVOLUTION_TIME == 1) {
const int R01 = invMod(M[0], M[1]);
const int R02 = invMod(M[0], M[2]);
const int R12 = invMod(M[1], M[2]);
const int M01 = (ll)M[0] * M[1] % mod;
for (size_t i = 0; i < sz; ++i) {
c[1][i] = (c[1][i] - c[0][i]) * (ll)R01 % M[1];
if (c[1][i] < 0) c[1][i] += M[1];
c[2][i] = ((c[2][i] - c[0][i]) * (ll)R02 % M[2] - c[1][i]) * R12 % M[2];
if (c[2][i] < 0) c[2][i] += M[2];
c[0][i] = (c[0][i] + (ll)c[1][i] * M[0] + (ll)c[2][i] * M01) % mod;
}
}
}
std::vector<int> mul(std::vector<int> a, std::vector<int> b, int mod) {
for (auto& x : a) x %= mod;
for (auto& x : b) x %= mod;
size_t m = a.size() + b.size() - 1;
sz = 1;
while (m > sz) sz <<= 1;
tmp.resize(sz);
a.resize(sz, 0);
b.resize(sz, 0);
std::vector<int> c[NTT_CONVOLUTION_TIME];
if (NTT_CONVOLUTION_TIME >= 1) c[0] = NTTPart<M[0], PR[0]>::mul(a, b);
if (NTT_CONVOLUTION_TIME >= 2) c[1] = NTTPart<M[1], PR[1]>::mul(a, b);
if (NTT_CONVOLUTION_TIME >= 3) c[2] = NTTPart<M[2], PR[2]>::mul(a, b);
for (auto& v : c) v.resize(m);
garner(c, mod);
return c[0];
}
}; // !!! CHECK NTT_CONVOLUTION_TIME !!!
signed main() {
INIT;
VAR(int, n, q);
VEC(i64, a, n); REP(i, n) a[i] %= MOD;
VEC(int, b, q);
auto rec = [&](auto && f, int l, int r) -> std::vector<int> {
if (r - l == 1) return { a[l] == 0 ? (MOD - 1) : (a[l] - 1), 1 };
int m = (l + r) / 2;
return NTT::mul(f(f, l, m), f(f, m, r), MOD);
};
auto v = rec(rec, 0, n);
REP(i, q) {
OUT(v[b[i]])BR;
}
return 0;
}