#742153 (C++11) No.1857 Gacha Addiction

• 問題: No.1857 Gacha Addiction
• ユーザー: leaf_1415
• 提出日時: 2022-02-26 00:42:41
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 970 ms / 6,000 ms
• コード長: 9,873 bytes
• コンパイル時間: 1,688 ms
• コンパイル使用メモリ: 116,276 KB
• 実行使用メモリ: 30,628 KB
• 最終ジャッジ日時: 2024-07-03 19:52:38
• 合計ジャッジ時間: 30,408 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	5 ms; 5,248 KB
testcase_01	AC	5 ms; 5,376 KB
testcase_02	AC	4 ms; 5,376 KB
testcase_03	AC	5 ms; 5,376 KB
testcase_04	AC	16 ms; 5,376 KB
testcase_05	AC	15 ms; 5,376 KB
testcase_06	AC	15 ms; 5,376 KB
testcase_07	AC	16 ms; 5,376 KB
testcase_08	AC	15 ms; 5,376 KB
testcase_09	AC	277 ms; 13,592 KB
testcase_10	AC	271 ms; 13,848 KB
testcase_11	AC	281 ms; 13,720 KB
testcase_12	AC	271 ms; 13,716 KB
testcase_13	AC	275 ms; 13,720 KB
testcase_14	AC	909 ms; 30,624 KB
testcase_15	AC	883 ms; 30,628 KB
testcase_16	AC	906 ms; 30,628 KB
testcase_17	AC	898 ms; 30,496 KB
testcase_18	AC	887 ms; 30,496 KB
testcase_19	AC	891 ms; 30,616 KB
testcase_20	AC	897 ms; 30,628 KB
testcase_21	AC	953 ms; 30,588 KB
testcase_22	AC	882 ms; 30,504 KB
testcase_23	AC	892 ms; 30,500 KB
testcase_24	AC	880 ms; 30,500 KB
testcase_25	AC	970 ms; 30,500 KB
testcase_26	AC	889 ms; 30,628 KB
testcase_27	AC	895 ms; 30,628 KB
testcase_28	AC	883 ms; 30,500 KB
testcase_29	AC	898 ms; 30,504 KB
testcase_30	AC	884 ms; 30,500 KB
testcase_31	AC	901 ms; 30,504 KB
testcase_32	AC	895 ms; 30,628 KB
testcase_33	AC	898 ms; 30,496 KB
testcase_34	AC	887 ms; 30,496 KB
testcase_35	AC	915 ms; 30,500 KB
testcase_36	AC	890 ms; 30,496 KB
testcase_37	AC	937 ms; 30,624 KB
testcase_38	AC	893 ms; 30,624 KB
testcase_39	AC	309 ms; 14,668 KB
testcase_40	AC	330 ms; 14,820 KB
testcase_41	AC	406 ms; 16,848 KB
testcase_42	AC	84 ms; 7,568 KB
testcase_43	AC	797 ms; 28,460 KB
testcase_44	AC	875 ms; 30,500 KB
testcase_45	AC	5 ms; 5,376 KB
testcase_46	AC	5 ms; 5,376 KB

ソースコード

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#include <array>
#include <unordered_set>
#include <unordered_map>
#define rep(x, s, t) for(ll x = (s); (x) <= (t); (x)++)
#define per(x, s, t) for(ll x = (s); (x) >= (t); (x)--)
#define reps(x, s) for(ll x = 0; (x) < (ll)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define outf(x) cout << fixed << setprecision(16) << (x) << endl
#define pb push_back
#define fi first
#define se second
#define inf 2e18
#define eps 1e-9
const double PI = 3.1415926535897932384626433;

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){ to = a, cost = b;}
};
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};

//const int mod = 1000000007;
const int mod = 998244353;

struct mint{
	int x;
	mint(ll y = 0){if(y < 0 || y >= mod) y = (y%mod+mod)%mod; x = y;}
	mint(const mint &ope) {x = ope.x;}
	mint operator-(){return mint(-x);}
	mint operator+(const mint &ope){return mint(x) += ope;}
	mint operator-(const mint &ope){return mint(x) -= ope;}
	mint operator*(const mint &ope){return mint(x) *= ope;}
	mint operator/(const mint &ope){return mint(x) /= ope;}
	mint& operator+=(const mint &ope){x += ope.x; if(x >= mod) x -= mod; return *this;}
	mint& operator-=(const mint &ope){x += mod - ope.x; if(x >= mod) x -= mod; return *this;}
	mint& operator*=(const mint &ope){ll tmp = x; tmp *= ope.x, tmp %= mod; x = tmp; return *this;}
	mint& operator/=(const mint &ope){
		ll n = mod-2; mint mul = ope;
		while(n){if(n & 1) *this *= mul; mul *= mul; n >>= 1;}
		return *this;
	}
	mint inverse(){return mint(1) / *this;}
	bool operator ==(const mint &ope){return x == ope.x;}
	bool operator !=(const mint &ope){return x != ope.x;}
	bool operator <(const mint &ope)const{return x < ope.x;}
};
mint modpow(mint a, ll n){
	if(n == 0) return mint(1);
	if(n % 2) return a * modpow(a, n-1);
	else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){ll t; is >> t, ope.x = t; return is;}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}

ll modpow(ll a, ll n, ll mod){
	if(n == 0) return 1;
	if(n % 2) return ((a%mod) * (modpow(a, n-1, mod)%mod)) % mod;
	else return modpow((a*a)%mod, n/2, mod) % mod;
}

vector<mint> fact, fact_inv;
void make_fact(int n){
	fact.resize(n+1), fact_inv.resize(n+1);
	fact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i);
	fact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1);
}
mint comb(int n, int k){ if(n < 0 || k < 0 || n < k) return mint(0); return fact[n] * fact_inv[k] * fact_inv[n-k];}
mint perm(int n, int k){ return comb(n, k) * fact[k]; }

vector<int> prime, pvec, qrime;
void make_prime(int n){
	prime.resize(n+1);
	rep(i, 2, n){
		if(prime[i] == 0) pvec.push_back(i), prime[i] = i;
		for(auto p : pvec){ if(i*p > n || p > prime[i]) break; prime[i*p] = p;}
	}
}
void make_qrime(int n){
	qrime.resize(n+1);
	rep(i, 2, n){int ni = i / prime[i]; if(prime[i] == prime[ni]) qrime[i] = qrime[ni] * prime[i]; else qrime[i] = prime[i];}
}

bool exceed(ll x, ll y, ll m){return y > 0 && x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "YES" << endl; }
void no(){ cout << "NO" << endl; }
ll floor(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return a/b; else return -((-a+b-1)/b); }
ll ceil(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return (a+b-1)/b; else return -((-a)/b); }
ll modulo(ll a, ll b){ b = abs(b); return a - floor(a, b) * b;}
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
ll arith(ll x){return x*(x+1)/2;}
ll arith(ll l, ll r){return arith(r) - arith(l-1);}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}
string lltos(ll x, ll b = 10){string ret; for(;x;x/=b) ret += x % b + '0'; reverse(all(ret)); return ret;}
ll stoll(string &s, ll b = 10){ll ret = 0; for(auto c : s) ret *= b, ret += c - '0'; return ret;}
template<typename T> void uniq(T &vec){sort(all(vec)); vec.erase(unique(all(vec)), vec.end());}
int popcount(ull x){
	x -= ((x>>1)&0x5555555555555555ULL), x = (x & 0x3333333333333333ULL) + ((x>>2) & 0x3333333333333333ULL);
	return (((x + (x>>4)) & 0x0F0F0F0F0F0F0F0FULL) * 0x0101010101010101ULL) >> 56;
}

template<class S, class T> pair<S, T>& operator+=(pair<S, T> &s, const pair<S, T> &t){s.first += t.first, s.second += t.second; return s;}
template<class S, class T> pair<S, T>& operator-=(pair<S, T> &s, const pair<S, T> &t){s.first -= t.first, s.second -= t.second; return s;}
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first-t.first, s.second-t.second);}
template<class T> T dot(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.first + s.second*t.second;}
template<class T> T cross(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.second - s.second*t.first;}

template<typename T> ostream& operator << (ostream& os, vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;}
template<typename T> ostream& operator << (ostream& os, const vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;}
template<typename T> ostream& operator << (ostream& os, list<T>& ls){for(auto x : ls) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, const list<T>& ls){for(auto x : ls) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, deque<T>& deq){reps(i,  deq) os << deq[i] << " "; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, const pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& ope){ for(auto p : ope) os << "(" << p.first << ", " << p.second << "),";return os;}
template<typename T> ostream& operator << (ostream& os, set<T>& ope){for(auto x : ope) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, multiset<T>& ope){for(auto x : ope) os << x << " "; return os;}
template<typename T> void outa(T a[], ll s, ll t){rep(i, s, t){ cout << a[i]; if(i < t) cout << " ";} cout << endl;}
template<typename T, size_t N> ostream& operator << (ostream& os, array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;}
template<typename T, size_t N> ostream& operator << (ostream& os, const array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;}
void dump_func(){cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail){cout << head; if(sizeof...(Tail) > 0) cout << " "; dump_func(std::move(tail)...);}


struct NTT_Convolution{
	NTT_Convolution(){};
	static int rev(int x, int n){
		int ret = 0;
		for(int i = 0; i < n; i++) ret <<= 1, ret |= (x>>i) & 1;
		return ret;
	}
	static void DFT(vector<mint> &f, vector<mint> &F, int n, mint root, bool inv = false)
	{
		int N = 1<<n;
		F.resize(N);
		for(int i = 0; i < N; i++) F[rev(i, n)] = f[i];
		if(inv) root = root.inverse();
		
		mint a, b, x, z;
		for(int i = 0; i < n; i++){
			int l = 1<<i;
			z = modpow(root, 1<<(n-(i+1)));
			for(int j = 0; j < N; j+=l*2){
				x = 1;
				for(int k = j; k < j+l; k++){
					a = F[k], b = F[k+l] * x;
					F[k] = a + b, F[k+l] = a - b, x *= z;
				}
			}
		}
		if(inv){
			mint Ninv = mint(N).inverse();
			for(int i = 0; i < N; i++) F[i] *= Ninv;
		}
	}
	static void conv(vector<mint> f, vector<mint> g, vector<mint> &dest)
	{
		ll logf = 0, logg = 0, len = f.size() + g.size();
		for(int i = f.size(); i; i /= 2) logf++;
		for(int i = g.size(); i; i /= 2) logg++;
		
		ll n = max(logf, logg)+1, N = 1<<n;
		f.resize(N), g.resize(N);
		mint root = modpow(mint(3), 119 * (1<<23-n));
		
		vector<mint> F, G;
		DFT(f, F, n, root), DFT(g, G, n, root);
		for(int i = 0; i < N; i++) F[i] *= G[i];
		DFT(F, f, n, root, true);
		
		f.resize(len-1);
		dest = f;
	}
};


struct ConvolutionMerge{
	int id;
	vector<vector<mint> > vec;
	priority_queue<P, vector<P>, greater<P> >Q;
	
	ConvolutionMerge(){init();}
	void init(){
		id = 0;
		vec.clear();
		while(Q.size()) Q.pop();
		vector<mint> f;
		f.push_back(mint(1));
		add(f);
	}
	void add(vector<mint> &f){
		Q.push(P(f.size(), id++));
		vec.push_back(f);
	}
	void calc(vector<mint> &dest){
		while(Q.size() >= 2){
			ll u = Q.top().second; Q.pop();
			ll v = Q.top().second; Q.pop();
			NTT_Convolution::conv(vec[u], vec[v], vec[u]);
			Q.push(P(vec[u].size(), u));
		}
		dest = vec[Q.top().second];
	}
};

ll n, s;
ll p[200005];
ConvolutionMerge cm;

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	make_fact(200005);
	
	cin >> n >> s;
	rep(i, 1, n) cin >> p[i];
	
	rep(i, 1, n){
		vector<mint> vec;
		vec.pb(1);
		vec.pb(mint(p[i])/mint(s));
		cm.add(vec);
	}
	vector<mint> res;
	cm.calc(res);
	
	mint ans = 0;
	rep(i, 0, n) ans += res[i] * fact[i];
	outl(ans);
	
	return 0;
}