結果
| 問題 | No.1066 #いろいろな色 / Red and Blue and more various colors (Easy) |
| ユーザー |
 バイト
|
| 提出日時 | 2020-05-30 13:48:56 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 251 ms / 2,000 ms |
| コード長 | 33,135 bytes |
| コンパイル時間 | 3,065 ms |
| コンパイル使用メモリ | 203,356 KB |
| 実行使用メモリ | 36,400 KB |
| 最終ジャッジ日時 | 2024-11-07 13:00:27 |
| 合計ジャッジ時間 | 6,725 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 67 ms
36,224 KB |
| testcase_01 | AC | 66 ms
36,216 KB |
| testcase_02 | AC | 64 ms
36,224 KB |
| testcase_03 | AC | 62 ms
36,172 KB |
| testcase_04 | AC | 67 ms
36,112 KB |
| testcase_05 | AC | 69 ms
36,108 KB |
| testcase_06 | AC | 65 ms
36,108 KB |
| testcase_07 | AC | 70 ms
36,044 KB |
| testcase_08 | AC | 140 ms
36,112 KB |
| testcase_09 | AC | 65 ms
36,208 KB |
| testcase_10 | AC | 246 ms
36,276 KB |
| testcase_11 | AC | 105 ms
36,176 KB |
| testcase_12 | AC | 94 ms
36,324 KB |
| testcase_13 | AC | 104 ms
36,224 KB |
| testcase_14 | AC | 110 ms
36,248 KB |
| testcase_15 | AC | 187 ms
36,268 KB |
| testcase_16 | AC | 85 ms
36,400 KB |
| testcase_17 | AC | 86 ms
36,224 KB |
| testcase_18 | AC | 181 ms
36,260 KB |
| testcase_19 | AC | 119 ms
36,224 KB |
| testcase_20 | AC | 75 ms
36,116 KB |
| testcase_21 | AC | 151 ms
36,380 KB |
| testcase_22 | AC | 66 ms
36,224 KB |
| testcase_23 | AC | 67 ms
36,212 KB |
| testcase_24 | AC | 64 ms
36,352 KB |
| testcase_25 | AC | 249 ms
36,284 KB |
| testcase_26 | AC | 251 ms
36,348 KB |
ソースコード
//tempa
//#pragma GCC optimize ("-O3")
#ifdef _DEBUG
#include<cassert>
#include "bits_stdc++.h"
#else
#include <bits/stdc++.h>
#endif
#define t_T template<class T>
using namespace std;
//@起動時
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
srand((unsigned) clock() + (unsigned) time(NULL));
};
} __initon;
//衝突対策
#define ws ___ws
#define over4(o1, o2, o3, o4, name, ...) name
#define int long long
#define ll long long
#define double long double
#define ull unsigned long long
using dou = double;
using itn = int;
using str = string;
using bo= bool;
#define au auto
using P = pair<ll, ll>;
#define fi first
#define se second
#define vec vector
#define beg begin
#define rbeg rbegin
#define con continue
#define bre break
#define brk break
#define is ==
using vi = vector<ll>;
using vb = vector<bool>;
using vs = vector<string>;
using vd = vector<double>;
using vc = vector<char>;
using vp = vector<P>;
//#define V vector
#define vvt0(t) vector<vector<t>>
#define vvt1(t, a) vector<vector<t>>a
#define vvt2(t, a, b) vector<vector<t>>a(b)
#define vvt3(t, a, b, c) vector<vector<t>> a(b,vector<t>(c))
#define vvt4(t, a, b, c, d) vector<vector<t>> a(b,vector<t>(c,d))
#define vvi(...) over4(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(ll,__VA_ARGS__)
#define vvb(...) over4(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(bool,__VA_ARGS__)
#define vvs(...) over4(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(string,__VA_ARGS__)
#define vvd(...) over4(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(double,__VA_ARGS__)
#define vvc(...) over4(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(char,__VA_ARGS__)
#define vvp(...) over4(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(P,__VA_ARGS__)
#define v3i(a, b, c, d) vector<vector<vi>> a(b, vector<vi>(c, vi(d)))
#define v3d(a, b, c, d) vector<vector<vd>> a(b, vector<vd>(c, vd(d)))
#define v3m(a, b, c, d) vector<vector<vm>> a(b, vector<vm>(c, vm(d)))
#define PQ priority_queue<ll, vector<ll>, greater<ll> >
#define tos to_string
using mapi = map<int, int>;
using mapd = map<dou, int>;
using mapc = map<char, int>;
using maps = map<str, int>;
using seti = set<int>;
using setd = set<dou>;
using setc = set<char>;
using sets = set<str>;
using qui = queue<int>;
#define bset bitset
#define uset unordered_set
#define mset multiset
#define umap unordered_map
#define umapi unordered_map<int,int>
#define umapp unordered_map<P,int>
#define mmap multimap
//マクロ 繰り返し
#define _overloadrep(_1, _2, _3, _4, name, ...) name
# define _rep(i, n) for(int i = 0,_lim=n; i < _lim ; i++)
#define repi(i, m, n) for(int i = m,_lim=n; i < _lim ; i++)
#define repadd(i, m, n, ad) for(int i = m,_lim=n; i < _lim ; i+= ad)
#define rep(...) _overloadrep(__VA_ARGS__,repadd,repi,_rep,)(__VA_ARGS__)
#define _rer(i, n) for(int i = n; i >= 0 ; i--)
#define reri(i, m, n) for(int i = m,_lim=n; i >= _lim ; i--)
#define rerdec(i, m, n, dec) for(int i = m,_lim=n; i >= _lim ; i-=dec)
#define rer(...) _overloadrep(__VA_ARGS__,rerdec,reri,_rer,)(__VA_ARGS__)
#define fora(a, b) for(auto&& a : b)
//マクロ 定数
#define k3 1010
#define k4 10101
#define k5 101010
#define k6 1010101
#define k7 10101010
t_T T MAX() { return numeric_limits<T>::max(); }
t_T T MIN() { return numeric_limits<T>::min(); }
const int inf = (int) 1e9 + 100;
const ll linf = (ll) 1e18 + 100;
t_T T INF() { return MAX<T>() / 2; }
template<> signed INF() { return inf; }
template<> ll INF() { return linf; }
template<> double INF() { return (double) linf * linf; }
const double eps = 1e-9;
const double PI = 3.1415926535897932384626433832795029L;
ll ma = numeric_limits<ll>::min();
ll mi = numeric_limits<ll>::max();
const int y4[] = {-1, 1, 0, 0};
const int x4[] = {0, 0, -1, 1};
const int y8[] = {0, 1, 0, -1, -1, 1, 1, -1};
const int x8[] = {1, 0, -1, 0, 1, -1, 1, -1};
//マクロ省略形 関数等
#define sz(a) ((int)(a).size())
#define rs resize
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pf push_front
#define eb emplace_back
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
/*@formatter:off*/
inline void sort(string &a) { sort(all(a)); }
t_T inline void sort(vector<T> &a) { sort(all(a)); };
t_T inline void rsort(vector<T> &a) { sort(all(a), greater<T>()); };
template<class U> inline void sortp(vector<U> &a, vector<U> &b) { vp c; int n = sz(a); assert(n == sz(b)); rep(i, n)c.eb(a[i], b[i]); sort(c); rep(i, n) { a[i] = c[i].first; b[i] = c[i].second;; }};//F = T<T>
//例えばreturn p.fi + p.se;
template<class U> inline void rsortp(vector<U> &a, vector<U> &b) { vp c; int n = sz(a); assert(n == sz(b)); rep(i, n)c.eb(a[i], b[i]); rsort(c); rep(i, n) { a[i] = c[i].first; b[i] = c[i].second; }};
template<typename V, typename T>
void fill(V &xx, const T vall) {xx = vall;}
template<typename V, typename T>
void fill(vector<V> &vecc, const T vall) {for (auto &&vx: vecc) fill(vx, vall);}
//@汎用便利関数 入力
template<typename T = int> T _in() {T x;cin >> x;return (x);}
#define _overloadin(_1, _2, _3, _4, name, ...) name
#define in0() _in()
#define in1(a) cin>>a
#define in2(a, b) cin>>a>>b
#define in3(a, b, c) cin>>a>>b>>c
#define in4(a, b, c, d) cin>>a>>b>>c>>d
#define in(...) _overloadin(__VA_ARGS__,in4,in3,in2 ,in1,in0)(__VA_ARGS__)
#define _overloaddin(_1, _2, _3, _4, name, ...) name
#define din1(a) int a;cin>>a
#define din2(a, b) int a,b;cin>>a>>b
#define din3(a, b, c) int a,b,c;cin>>a>>b>>c
#define din4(a, b, c, d) int a,b,c,d;cin>>a>>b>>c>>d
#define din(...) _overloadin(__VA_ARGS__,din4,din3,din2 ,din1)(__VA_ARGS__)
#define _overloaddind(_1, _2, _3, _4, name, ...) name
#define din1d(a) int a;cin>>a;a--
#define din2d(a, b) int a,b;cin>>a>>b;a--,b--
#define din3d(a, b, c) int a,b,c;cin>>a>>b>>c;a--,b--,c--
#define din4d(a, b, c, d) int a,b,c,d;cin>>a>>b>>c>>d;;a--,b--,c--,d--
#define dind(...) _overloaddind(__VA_ARGS__,din4d,din3d,din2d ,din1d)(__VA_ARGS__)
template<typename W, typename H> void resize(W &vec_, const H head) { vec_.resize(head); }
template<typename W, typename H, typename ... T> void resize(W &vec_, const H &head, const T ... tail) {vec_.resize(head);for (auto &v: vec_)resize(v, tail...);}
string sin() { return _in<string>(); }
ll lin() { return _in<ll>(); }
t_T void na(vector<T> &a, ll n) {a.resize(n);rep(i, n)cin >> a[i];}
#define dna(a, n) vi a; na(a, n);/*nを複数使うと n==in()の時バグる事に注意*/
#define dnad(a, n) vi a; nad(a, n);
t_T void nad(vector<T> &a, ll n) {a.resize(n);rep(i, n)cin >> a[i], a[i]--;}
template<class T, class U> void na2(vector<T> &a, vector<U> &b, ll n) {a.resize(n);b.resize(n);rep(i, n)cin >> a[i] >> b[i];}
#define dna2(a, b, n) vi a,b; na2(a,b,n);
template<class T, class U, class W> void na3(vector<T> &a, vector<U> &b, vector<W> &c, ll n) {a.resize(n);b.resize(n);c.resize(n);rep(i, n)cin >> a[i] >> b[i] >> c[i];}
#define nt(a, h, w) resize(a,h,w);rep(nthi,h)rep(ntwi,w) cin >> a[nthi][ntwi];
#define ntd(a, h, w) resize(a,h,w);rep(ntdhi,h)rep(ntdwi,w) cin >> a[ntdhi][ntdwi], a[ntdhi][ntdwi]--;
#define ntp(a, h, w) resize(a,h+2,w+2);fill(a,'#');rep(ntphi,1,h+1)rep(ntpwi,1,w+1) cin >> a[ntphi][ntpwi];
#define dnt(S, h, w) vvi(S,h,w);nt(S,h,w);
#define dntc(S, h, w) vvc(S,h,w);nt(S,h,w);
#define dnts(S, h, w) vvs(S,h,w);nt(S,h,w);
//デバッグ
#define sp << " " <<
constexpr int DEB_LEN =20;
constexpr int DEB_LEN_H =12;
string deb_tos(const int &v) { if (abs(v) == inf || abs(v) == linf)return "e"; else return to_string(v); }
template<class T> string deb_tos(const T &a) {stringstream ss;ss << a;return ss.str();}
template<class T> string deb_tos(const vector<T> &a, ll W = inf) { stringstream ss; if (W == inf)W = min(sz(a), DEB_LEN); if (sz(a) == 0)return ss.str(); rep(i, W) { ss << deb_tos(a[i]); if (typeid(a[i]) == typeid(P)) { ss << endl; } else { ss << " "; } } return ss.str();}
template<class T> string deb_tos(const vector<vector<T> > &a, vi H, vi W, int key = -1) { stringstream ss; ss << endl; vi lens(sz(W)); fora(h, H) { rep(wi, sz(W)) { lens[wi] = max(lens[wi], sz(deb_tos(a[h][W[wi]])) + 1); lens[wi] = max(lens[wi], sz(deb_tos(W[wi])) + 1); } } if (key == -1)ss << " *|"; else ss << " " << key << "|"; int wi = 0; fora(w, W) { ss << std::right << std::setw(lens[wi]) << w; wi++; } ss << "" << endl; rep(i, sz(W))rep(_, lens[i]) ss << "_"; rep(i, 3)ss << "_"; ss << "" << endl; fora(h, H) { ss << std::right << std::setw(2) << h << "|"; int wi = 0; fora(w, W) { ss << std::right << std::setw(lens[wi]) << deb_tos(a[h][w]); wi++; } ss << "" << endl; } return ss.str();}
template<class T> string deb_tos(const vector<vector<T> > &a, ll H = inf, ll W = inf, int key = -1) { H = (H != inf) ? H : min({H, sz(a), DEB_LEN_H}); W = min({W, sz(a[0]), DEB_LEN_H}); vi hs, ws; rep(h, H) { hs.push_back(h); } rep(w, W) { ws.push_back(w); } return deb_tos(a, hs, ws, key);}
template<class T> string deb_tos(const vector<vector<vector<T> > > &a, ll H = inf) { stringstream ss; if (H == inf)H = DEB_LEN_H; H = min(H, sz(a)); rep(i, H) { ss << endl; ss << deb_tos(a[i], inf, inf, i); } return ss.str();}
template<class T, size_t A> string deb_tos(T (&a)[A]) { return deb_tos(vector<T>(begin(a), end(a))); }
template<class T, size_t A, size_t B> string deb_tos(T (&a)[A][B]) { return deb_tos(vector<vector<T> >(begin(a), end(a))); }
template<class T, size_t A, size_t B, size_t C> string deb_tos(T (&a)[A][B][C]) { return deb_tos(vector<vector<vector<T> > >(begin(a), end(a))); }
#define debugName(VariableName) # VariableName
#define _deb1(x) cerr << debugName(x)<<" = "<<deb_tos(x) << endl
#define _deb2(x, y) cerr << debugName(x)<<" = "<<deb_tos(x)<<", "<< debugName(y)<<" = "<<deb_tos(y)<< endl
#define _deb3(x, y, z) cerr << debugName(x)<<" = "<<deb_tos(x) << ", " << debugName(y)<<" = "<<deb_tos(y) <<", " debugName(z)<<" = "<<deb_tos(z) <<endl
#define _deb4(x, y, z, a) cerr << debugName(x)<<" = "<<deb_tos(x) <<", " << debugName(y)<<" = "<<deb_tos(y) <<", " << debugName(z)<<" = "<<deb_tos(z) <<", " << debugName(a)<<" = "<<deb_tos(a)<<endl
#define _deb5(x, y, z, a, b) cerr << debugName(x)<<" = "<<deb_tos(x) <<", " << debugName(y)<<" = "<<deb_tos(y) <<", " << debugName(z)<<" = "<<deb_tos(z) <<", " << debugName(a)<<" = "<<deb_tos(a)<<", " << debugName(b)<<" = "<<deb_tos(b)<<endl
#define _overloadebug(_1, _2, _3, _4, _5, name, ...) name
#define debug(...) _overloadebug(__VA_ARGS__,_deb5,_deb4,_deb3,_deb2,_deb1)(__VA_ARGS__)
#ifdef _DEBUG
#define deb(...) _overloadebug(__VA_ARGS__,_deb5,_deb4,_deb3,_deb2,_deb1)(__VA_ARGS__)
#else
#define deb(...) ;
#endif
#define debugline(x) cerr << x << " " << "(L:" << __LINE__ << ")" << '\n'
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll gcd(vi b) {ll res = b[0];for (auto &&v :b)res = gcd(v, res);return res;}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll rev(ll a) { ll res = 0; while (a) { res *= 10; res += a % 10; a /= 10; } return res;}
template<class T> auto rev(const T &v, int i) {return v[sz(v) - 1 - i];}
t_T vector<T> rev(vector<T> &a) { auto b = a; reverse(all(b)); return b;}
str rev(str &a) {str s = a;reverse(all(s));return s;}
ll ceil(ll a, ll b) {if (b == 0) {cerr<<"ceil"<<endl;exit(1);return -1;} else return (a + b - 1) / b;}
ll sqrt(ll a) { if (a < 0) { cerr<<"sqrt"<<endl; exit(1); } ll res = (ll) std::sqrt(a); while (res * res < a)res++; return res;}
double log(double e, double x) { return log(x) / log(e); }
ll sig(ll t) { return (1 + t) * t / 2; }
ll sig(ll s, ll t) { return (s + t) * (t - s + 1) / 2; }
vi divisors(int v) { vi res; double lim = std::sqrt(v); rep(i, 1, lim+1){ if (v % i == 0) { res.pb(i); if (i != v / i)res.pb(v / i); } } return res;}
vb isPrime;
vi primes;
void setPrime() { int len = 4010101; isPrime.resize(4010101); fill(isPrime, true); isPrime[0] = isPrime[1] = false; for (int i = 2; i <= sqrt(len) + 5; ++i) { if (!isPrime[i])continue; for (int j = 2; i * j < len; ++j) { isPrime[i * j] = false; } } rep(i, len)if (isPrime[i])primes.pb(i);}
vi factorization(int v) { int tv = v; vi res; if (isPrime.size() == 0)setPrime(); for (auto &&p :primes) { if (v % p == 0)res.push_back(p); while (v % p == 0) { v /= p; } if (v == 1 || p * p > tv)break; } if (v > 1)res.pb(v); return res;}
inline bool inside(int h, int w, int H, int W) { return h >= 0 && w >= 0 && h < H && w < W; }
inline bool inside(int v, int l, int r) { return l <= v && v < r; }
t_T vector<T> ruiv(vector<T> &a) { vector<T> ret(a.size() + 1); rep(i, a.size())ret[i + 1] = ret[i] + a[i]; return ret;}
//imoは0-indexed
//ruiは1-indexed
t_T vector<T> imo(vector<T> &v) { vector<T> ret = v; rep(i, sz(ret) - 1)ret[i + 1] += ret[i]; return ret;}
#define ins inside
ll u0(ll a) { return a < 0 ? 0 : a; }
t_T vector<T> u(const vector<T> &a) {
vector<T> ret = a;fora(v, ret)v = u0(v);return ret;}
#define MIN(a) numeric_limits<a>::min()
#define MAX(a) numeric_limits<a>::max()
template<class T, class U> pair<T,U> operator+(const pair<T,U> &a, const pair<T,U> & b) {return pair<T,U>(a.fi+b.fi,a.se+b.se);}
void yn(bool a) {
if (a)cout << "yes" << endl;
else cout << "no" << endl;
}
void Yn(bool a) {
if (a)cout << "Yes" << endl;
else cout << "No" << endl;
}
void YN(bool a) {
if (a)cout << "YES" << endl;
else cout << "NO" << endl;
}
void fyn(bool a) {
if (a)cout << "yes" << endl;
else cout << "no" << endl;
exit(0);
}
void fYn(bool a) {
if (a)cout << "Yes" << endl;
else cout << "No" << endl;
exit(0);
}
void fYN(bool a) {
if (a)cout << "YES" << endl;
else cout << "NO" << endl;
exit(0);
}
void Possible(bool a) {
if (a)cout << "Possible" << endl;
else cout << "Impossible" << endl;
exit(0);
}
void POSSIBLE(bool a) {
if (a)cout << "POSSIBLE" << endl;
else cout << "IMPOSSIBLE" << endl;
exit(0);
}
template<class T, class U> set<T> &operator+=(set<T> &a, U v) {
a.insert(v);
return a;
}
template<class T, class U> vector<T> &operator+=(vector<T> &a, U v) {
a.push_back(v);
return a;
}
template<class T> vector<T>& operator+=(vector<T> & a,const vector<T> & b){
rep(i, sz(b))a += b[i];
return a;
}
t_T T sum(vector<T> &v, int s = 0, int t = inf) { T ret = 0; rep(i, s, min(sz(v), t))ret += v[i]; return ret;}
void mod(int &a, int m) { a = (a % m + m) % m; }
template<class F> inline int mgr(int ok, int ng, F f) {
#define _mgrbody int mid = (ok + ng) / 2; if (f(mid))ok = mid; else ng = mid;
if (ok < ng)while (ng - ok > 1) { _mgrbody } else while (ok - ng > 1) { _mgrbody }
return ok;
}
template<class F> inline int mgr(int ok, int ng, int second, F f) {
#define _mgrbody2 int mid = (ok + ng) / 2; if (f(mid, second))ok = mid; else ng = mid;
if (ok < ng) while (ng - ok > 1) { _mgrbody2 } else while (ok - ng > 1) { _mgrbody2 }
return ok;
}
template<typename T> ostream &operator<<(ostream &os, vector<T> &m) { rep(i, sz(m)){os << m[i];if(i < sz(m)-1)os<<" ";} return os;}
ostream &operator<<(ostream &os, vector<char> &m) {rep(i, sz(m)){os << m[i];} return os;}
template<typename T> ostream &operator<<(ostream &os, vector<vector<T>> &m) {rep(i, sz(m)){os << m[i]; if(i < sz(m)-1)os << endl;} return os;}
constexpr bool bget(ll m, int keta) { return (m >> keta) & 1; }
int bget(ll m, int keta, int sinsuu) {m /= (ll) pow(sinsuu, keta);return m % sinsuu;}
ll bit(int n) { return (1LL << (n)); }
ll bit(int n, int sinsuu) { return (ll) pow(sinsuu, n); }
int mask(int n) { return (1ll << n) - 1; }
#define bcou __builtin_popcountll
template<class T, class U> inline bool chma(T &a, const U &b) {if (a < b) {a = b;return true;}return false;}
template<class U> inline bool chma(const U &b) { return chma(ma, b); }
template<class T, class U> inline bool chmi(T &a, const U &b) { if (b < a) { a = b; return true; } return false;}
template<class U> inline bool chmi(const U &b) { return chmi(mi, b); }
#define unique(v) v.erase( unique(v.begin(), v.end()), v.end() );
int max(vi &a) { int res = a[0]; fora(v, a) { res = max(res, v); } return res;}
int min(vi &a) { int res = a[0]; fora(v, a) { res = min(res, v); } return res;}
template<typename T> class fixed_point : T {public: explicit constexpr fixed_point(T &&t) noexcept: T(std::forward<T>(t)) {} template<typename... Args> constexpr decltype(auto) operator()(Args &&... args) const { return T::operator()(*this, std::forward<Args>(args)...); }};template<typename T> static inline constexpr decltype(auto) fix(T &&t) noexcept { return fixed_point<T>{std::forward<T>(t)}; }
constexpr ll h4[] = {1, -1, 0, 0};
constexpr ll w4[] = {0, 0, -1, 1};
constexpr ll h8[] = {0, 1, 0, -1, -1, 1, 1, -1};
constexpr ll w8[] = {1, 0, -1, 0, 1, -1, 1, -1};
int mei_inc(int h, int w, int H, int W, int i) {while (++i < 4) { if (inside(h + h4[i], w + w4[i], H, W))return i; }return i;}
#define mei(nh, nw, h, w) for (int i = mei_inc(h, w, H, W, -1), nh = i<4? h + h4[i] : 0, nw = i<4? w + w4[i] : 0; i < 4; i=mei_inc(h,w,H,W,i), nh = h+h4[i], nw = w+w4[i])
int mei_inc8(int h, int w, int H, int W, int i) { while (++i < 8) { if (inside(h + h8[i], w + w8[i], H, W))return i; } return i;}
#define mei8(nh, nw, h, w) for (int i = mei_inc8(h, w, H, W, -1), nh = i<8? h + h8[i] : 0, nw = i<8? w + w8[i] : 0; i < 8; i=mei_inc8(h,w,H,W,i), nh = h+h8[i], nw = w+w8[i])
int mei_incv(int h, int w, int H, int W, int i, vp &p) { while (++i < sz(p)) { if (inside(h + p[i].fi, w + p[i].se, H, W))return i; } return i;}
#define meiv(nh, nw, h, w, p) for (int i = mei_incv(h, w, H, W, -1, p), nh = i<sz(p)? h + p[i].fi : 0, nw = i<sz(p)? w + p[i].se : 0; i < sz(p); i=mei_incv(h,w,H,W,i,p), nh = h+p[i].fi, nw = w+p[i].se)
vi compress(vi &A) { vi B = A; sort(B); unique(B); vi inds(sz(B)); rep(i, sz(A)) { int ind = lower_bound(all(B), A[i]) - B.begin(); inds[ind] = A[i]; A[i] = ind; } return inds;}
vi compress(vi &A, umapi& map){ vi i_v = compress(A); rep(i, sz(i_v)){ map[i_v[i]] = i; } return i_v;}
t_T void out2(T head) { cout << head;}
template<class T, class... U> void out2(T head, U ... tail) { cout << head << " "; out2(tail...);}
template<class T, class... U> void out(T head, U ... tail) { cout << head << " "; out2(tail...); cout << "" << endl;}
t_T void out(T head) { cout << head << endl; }
void out() { cout << "" << endl; }
#define lowerIndex(a, v) (lower_bound(all(a),v)-a.begin())
#define upperIndex(a, v) (uppereturnbound(all(a),v)-a.begin())
template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...)); }
#define vni(name, ...) auto name = make_v<ll>(__VA_ARGS__)
#define vnb(name, ...) auto name = make_v<bool>(__VA_ARGS__)
#define vns(name, ...) auto name = make_v<string>(__VA_ARGS__)
#define vnd(name, ...) auto name = make_v<double>(__VA_ARGS__)
#define vnc(name, ...) auto name = make_v<char>(__VA_ARGS__)
#define vnp(name, ...) auto name = make_v<P>(__VA_ARGS__)
#define vn(type, name, ...) auto name = make_v<type>(__VA_ARGS__)
#define VEC vector
/*@formatter:on*/
int N, M, H, W;
vi A, B, C;
#ifndef MINT
#define MINT
/*@formatter:off*/
template <typename Mod_t> class modint;
template<typename T> T minv(T a, T m);
template<typename T> T minv(T a);
using Type = std::uint_fast64_t;
constexpr signed MOD =
998244353;
// 1e9 + 7;//MOD
using mint = modint<std::integral_constant<decay<decltype(MOD)>::type, MOD>>;
template <typename Mod_t> class modint {
constexpr static auto mod() { return Mod_t::value; }
public:
Type value;
constexpr modint() : value(){}
constexpr modint(const Type &x) noexcept {if (-mod() <= x && x < mod()) value = static_cast<Type>(x); else value = static_cast<Type>(x % mod());if (value < 0) value += mod();}
const Type &operator()() const { return value; }
template<typename U> explicit operator U() const { return static_cast<U>(value); }
constexpr modint operator+(const modint rhs) const noexcept {return modint(*this) += rhs;}
constexpr modint operator-(const modint rhs) const noexcept {return modint(*this) -= rhs;}
constexpr modint operator*(const modint rhs) const noexcept {return modint(*this) *= rhs;}
constexpr modint operator/(const modint rhs) const noexcept {return modint(*this) /= rhs;}
constexpr modint &operator+=(const modint rhs) noexcept { value += rhs.value; if (value >= mod()) { value -= mod(); } return *this; }
constexpr modint &operator-=(const modint rhs) noexcept { if (value < rhs.value) { value += mod(); } value -= rhs.value; return *this;}
constexpr modint &operator*=(const modint rhs) noexcept {value = value * rhs.value % mod();return *this;}
constexpr modint &operator/=(const modint& rhs) noexcept {return operator*=(minv(rhs.value));}
modint &operator++() { return *this += 1; }
modint &operator--() { return *this -= 1; }
modint operator++(signed) {modint result(*this);*this += 1;return result;}
modint operator--(signed) {modint result(*this);*this -= 1;return result;}
modint operator-() const { return modint(-value); }
template<typename U> friend bool operator==(const modint<U> &lhs, const modint<U> &rhs);
template<typename U> friend bool operator<(const modint<U> &lhs, const modint<U> &rhs);
template<typename U> friend std::istream &operator>>(std::istream &stream, modint<U> &number);
operator int() { return value; }
};
/*@formatter:off*/
template<typename T> bool operator==(const modint<T> &lhs, const modint<T> &rhs) { return lhs.value == rhs.value; }
template<typename T, typename U> bool operator==(const modint<T> &lhs, U rhs) { return lhs == modint<T>(rhs); }
template<typename T, typename U> bool operator==(U lhs, const modint<T> &rhs) { return modint<T>(lhs) == rhs; }
template<typename T> bool operator!=(const modint<T> &lhs, const modint<T> &rhs) { return !(lhs == rhs); }
template<typename T, typename U> bool operator!=(const modint<T> &lhs, U rhs) { return !(lhs == rhs); }
template<typename T, typename U> bool operator!=(U lhs, const modint<T> &rhs) { return !(lhs == rhs); }
template<typename T> bool operator<(const modint<T> &lhs, const modint<T> &rhs) { return lhs.value < rhs.value; }
template<typename T> modint<T> operator+(const modint<T> &lhs, const modint<T> &rhs) { return modint<T>(lhs) += rhs; }
template<typename T, typename U> modint<T> operator+(const modint<T> &lhs, U rhs) { return modint<T>(lhs) += rhs; }
template<typename T, typename U> modint<T> operator+(U lhs, const modint<T> &rhs) { return modint<T>(lhs) += rhs; }
template<typename T> modint<T> operator-(const modint<T> &lhs, const modint<T> &rhs) { return modint<T>(lhs) -= rhs; }
template<typename T, typename U> modint<T> operator-(const modint<T> &lhs, U rhs) { return modint<T>(lhs) -= rhs; }
template<typename T, typename U> modint<T> operator-(U lhs, const modint<T> &rhs) { return modint<T>(lhs) -= rhs; }
template<typename T> modint<T> operator*(const modint<T> &lhs, const modint<T> &rhs) { return modint<T>(lhs) *= rhs; }
template<typename T, typename U> modint<T> operator*(const modint<T> &lhs, U rhs) { return modint<T>(lhs) *= rhs; }
template<typename T, typename U> modint<T> operator*(U lhs, const modint<T> &rhs) { return modint<T>(lhs) *= rhs; }
template<typename T> modint<T> operator/(const modint<T> &lhs, const modint<T> &rhs) { return modint<T>(lhs) /= rhs; }
template<typename T, typename U> modint<T> operator/(const modint<T> &lhs, U rhs) { return modint<T>(lhs) /= rhs; }
template<typename T, typename U> modint<T> operator/(U lhs, const modint<T> &rhs) { return modint<T>(lhs) /= rhs; }
template<typename T, typename U> modint<T> operator%(const modint<T> &lhs, U rhs) { cerr << "can't mint % int" << endl; assert(0); exit(0); return 0;}
#ifdef optional
template<class T> optional<mint> operator+(const mint &mv, const optional<T> &opt) { if (opt.has_value())return mv + opt.value(); else return optional<mint>(); }
template<class T> optional<mint> operator-(const mint &mv, const optional<T> &opt) { if (opt.has_value())return mv * opt.value(); else return optional<mint>(); }
template<class T> optional<mint> operator*(const mint &mv, const optional<T> &opt) { if (opt.has_value())return mv * opt.value(); else return optional<mint>(); }
template<class T> optional<mint> operator/(const mint &mv, const optional<T> &opt) { if (opt.has_value())return mv / opt.value(); else return optional<mint>(); }
template<class T> optional<mint> operator+(const optional<T> &opt, const mint &mv) { if (opt.has_value())return mv + opt.value(); else return optional<mint>(); }
template<class T> optional<mint> operator-(const optional<T> &opt, const mint &mv) { if (opt.has_value())return mv * opt.value(); else return optional<mint>(); }
template<class T> optional<mint> operator*(const optional<T> &opt, const mint &mv) { if (opt.has_value())return mv * opt.value(); else return optional<mint>(); }
template<class T> optional<mint> operator/(const optional<T> &opt, const mint &mv) { if (opt.has_value())return mv / opt.value(); else return optional<mint>(); }
template<class T> void operator+=(mint &mv, const optional<T> &opt) { if (opt.has_value())mv += opt.value(); }
template<class T> void operator-=(mint &mv, const optional<T> &opt) { if (opt.has_value())mv -= opt.value(); }
template<class T> void operator*=(mint &mv, const optional<T> &opt) { if (opt.has_value())mv *= opt.value(); }
template<class T> void operator/=(mint &mv, const optional<T> &opt) { if (opt.has_value())mv /= opt.value(); }
template<class T> void operator+=(const optional<T> &opt, mint &mv) {if (opt.has_value())opt.value += mv;}
template<class T> void operator-=(const optional<T> &opt, mint &mv) {if (opt.has_value())opt.value -= mv;}
template<class T> void operator*=(const optional<T> &opt, mint &mv) {if (opt.has_value())opt.value *= mv;}
template<class T> void operator/=(const optional<T> &opt, mint &mv) {if (opt.has_value())opt.value /= mv;}
#endif
//constexpr int mint_len = std::min(1400001, MOD);
vector<Type> fac, finv, inv;
vector<Type> p2;
void setmod_resize(int mint_len) {
// p2.resize(mint_len);p2[0] = 1; for (int i = 1; i < mint_len; ++i) p2[i] = p2[i - 1] * 2 % MOD;
int tn = sz(fac);
fac.resize(mint_len);
finv.resize(mint_len);
inv.resize(mint_len);
inv[1] = fac[0] = finv[0] = 1;
for (int i = tn; i < mint_len; ++i) inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
for (int i = tn; i < mint_len; ++i) fac[i] = fac[i - 1] * i % MOD, finv[i] = finv[i - 1] * inv[i] % MOD;
}
//4e6 >= n なら O(r)で計算する
mint com_big(int n, int r) { Type fa = finv[r]; rep(i, r)fa *= n - i, fa %= MOD; return mint(fa);}
mint com(int n, int r) {if (r < 0 || r > n) return 0; /*nが大きくてrが小さい場合、nを上からr個掛ける*/ if (n >= sz(fac)) { if (n <= 4e6)setmod_resize(n + 1000); else return com_big(n, r); }return mint(finv[r] * fac[n] % MOD * finv[n - r]);}
mint pom(int n, int r) {/* if (!sz(fac)) com(0, -1);*/ if (r < 0 || r > n) return 0;return mint(fac[n] * finv[n - r]);}
mint npr(int n, int r) {/* if (!sz(fac)) com(0, -1);*/ if (r < 0 || r > n) return 0;return mint(fac[n] * finv[n - r]);}
mint com_grid(int n, int r) {assert(r);return com(n + r - 2, n - 1);}
Type nprin(int n, int r) {/* if (!sz(fac)) com(0, -1);*/ if (r < 0 || r > n) return 0;return fac[n] * finv[n - r] % MOD;}
Type icom(int n, int r) { const int NUM_ = 1400001; static ll fac[NUM_ + 1], finv[NUM_ + 1], inv[NUM_ + 1]; if (fac[0] == 0) { inv[1] = fac[0] = finv[0] = 1; for (int i = 2; i <= NUM_; ++i) inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD; for (int i = 1; i <= NUM_; ++i) fac[i] = fac[i - 1] * i % MOD, finv[i] = finv[i - 1] * inv[i] % MOD; } if (r < 0 || r > n) return 0; return ((finv[r] * fac[n] % MOD) * finv[n - r]) % MOD;}
#define ncr com
#define ncri icom
//n種類でr個選ぶ
//n個の場所にr個の物を置く
//負が渡された場合もcomが処理出来る
mint nhr(int n, int r) { if (n == 0 && r == 0)return 1; else return com(n + r - 1, r); }
//n種類でそれぞれ少なくとも1つは選び、r個揃える
mint nhr1(int n, int r) { return nhr(n, r - n); }
mint hom(int n, int r) { if (n == 0 && r == 0)return 1; else return com(n + r - 1, r); }
Type nhri(int n, int r) { if (n == 0 && r == 0)return 1; else return icom(n + r - 1, r); }
//グリッドで0-indexedの最短経路 pascal
mint pas(int h, int w) { return com(h + w, w); }
template<typename T> T minv(T a, T m) { T u = 0, v = 1; while (a != 0) { T t = m / a; m -= t * a; swap(a, m); u -= t * v; swap(u, v); } assert(m == 1); return u;}
template<typename T> T minv(T a) { if (a < sz(fac)){ return inv[a]; } T u = 0, v = 1; T m = MOD; while (a != 0) { T t = m / a; m -= t * a; swap(a, m); u -= t * v; swap(u, v); } assert(m == 1); return u;}
//int型 mod m
template<typename T, typename U> mint mpow(const T& a, const U &b) {if (b < 0)return minv(mpow(a, -b)); mint x = a, res = 1; U p = b; while (p > 0) { if (p & 1) res *= x; x *= x; p >>= 1; } return res;}
template<typename T, typename U, typename V> int mpowi(const T &a, const U &b, const V &m = MOD) {return mpow(a,b, m);}
template<typename T> string to_string(const modint<T> &number) { return to_string(number()); }
/*@formatter:off*/
#ifdef _DEBUG
void yuri(const mint &a) { stringstream st; rep(i, 300) { rep(j, 300) { if ((mint) i / j == a) { st << i << " / " << j; i = 2000; break; } } } string val = st.str(); if (val != "") { deb(val); return; } rep(i, 1000) { rep(j, 1000) { if ((mint) i / j == a) { st << i << " / " << j; i = 2000; break; } } } val = st.str(); deb(val);}
#else
#define yuri(...) ;
#endif
template<typename T> std::ostream &operator<<(std::ostream &stream, const modint<T> &number) {
stream << number();
#ifdef _DEBUG
// stream << " -> " << yuri(number);
#endif
return stream;
}
//@formatter:off
/*@formatter:on*/
template<typename T> std::istream &operator>>(std::istream &stream, modint<T> &number) {
typename common_type<typename modint<T>::Type, Type>::type x;
stream >> x;
number.value = modint<T>::normalize(x);
return stream;
}
/*@formatter:off*/
using PM = pair<mint, mint>;
using vm = vector<mint>;
using mapm = map<int, mint>;
using umapm = umap<int, mint>;
#define vvm(...) over4(__VA_ARGS__,vvt4,vvt3,vvt2 ,vvt1,vvt0)(mint,__VA_ARGS__)
#define vnm(name, ...) auto name = make_v<mint>(__VA_ARGS__)
string out_m2(mint a) { stringstream st; st<<(int)a ; rep(i, 300) { rep(j, 2, 300) { if ((i%j)&&(mint) i / j == a) { st <<"("<< i << "/" << j<<")"; i = 2000; break; } } } return st.str();}
//nhr n個の場所にr個の物を分ける
mint m1 = (mint) 1;
mint half = (mint) 1 / 2;
struct setmod{
//comで長さが足りない場合はsetmod_resizeでリサイズする
int mint_len =1.4*1e6;
setmod() {
//p2を使う場合setmod_resizeも変える
// p2.resize(mint_len);p2[0] = 1; for (int i = 1; i < mint_len; ++i) p2[i] = p2[i - 1] * 2 % MOD;
fac.resize(mint_len); finv.resize(mint_len); inv.resize(mint_len); inv[1] = fac[0] = finv[0] = 1; for (int i = 2; i < mint_len; ++i) inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD; for (int i = 1; i < mint_len; ++i) fac[i] = fac[i - 1] * i % MOD, finv[i] = finv[i - 1] * inv[i] % MOD;
}}setmodv;
template<signed S> using mint_ = modint<std::integral_constant<decay<signed>::type, S>>;
#endif
/*@formatter:on*/
void solve() {
din(N, Q);
na(A, N);
//組合せ
vm da(N + 1);
vm db(N + 1);
da[0] = 1;
fora(a, A) {
da[0] *= a;
}
rep(i, N) {
rep(k, i + 1) {
db[k] += da[k] * (A[i] - 1) / A[i];
//ひける
db[k + 1] += da[k] / A[i];
}
swap(da, db);
db.assign(N + 1, 0);
}
rep(_, Q) {
din(v);
out(da[v]);
}
}
signed main() {
solve();
return 0;
}