結果

問題 No.1753 Don't cheat.
コンテスト
ユーザー HIR180
提出日時 2021-11-27 17:09:56
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 203 ms / 3,000 ms
コード長 5,466 bytes
コンパイル時間 3,262 ms
コンパイル使用メモリ 191,052 KB
最終ジャッジ日時 2025-01-26 02:19:32
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff # 

//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <cassert>
#include <iomanip>
#include <chrono>
#include <random>
#include <bitset>
#include <complex>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
#define int long long
//#define L __int128
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define a first
#define b second
#define fi first
#define sc second
#define rng(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
#define si(x) int(x.size())
 
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif
 
template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}
 
template<class t> using vc=vector<t>;
 
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.fi<<","<<p.sc<<"}";
}
 
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}
 
 //https://codeforces.com/blog/entry/62393
struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		// http://xorshift.di.unimi.it/splitmix64.c
		x += 0x9e3779b97f4a7c15;
		x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
		x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
		return x ^ (x >> 31);
	}
 
	size_t operator()(uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
		return splitmix64(x + FIXED_RANDOM);
	}
	
	size_t operator()(pair<int,int> x)const{
		return operator()(uint64_t(x.first)<<32|x.second);
	}
};
//unordered_set -> dtype, null_type
//unordered_map -> dtype(key), dtype(value)
using namespace __gnu_pbds;
template<class t,class u>
using hash_table=gp_hash_table<t,u,custom_hash>;

template<class T>
void g(T &a){
	cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
	cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 998244353;
//const ll mod = 1000000007;
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
template<class T>
void add(T&a,T b){
	a+=b;
	if(a >= mod) a-=mod;
}
ll modpow(ll x,ll n){
	ll res=1;
	while(n>0){
		if(n&1) res=res*x%mod;
		x=x*x%mod;
		n>>=1;
	}
	return res;
}
#define _sz 3005
ll F[_sz],R[_sz];
void make(){
	F[0] = 1;
	for(int i=1;i<_sz;i++) F[i] = F[i-1]*i%mod;
	R[_sz-1] = modpow(F[_sz-1], mod-2);
	for(int i=_sz-2;i>=0;i--) R[i] = R[i+1] * (i+1) % mod;
}
ll C(int a,int b){
	if(b < 0 || a < b) return 0;
	return F[a]*R[b]%mod*R[a-b]%mod;
}
int s2 = 882049182;
#define pcnt(v) __builtin_popcount(v)
//orのみnot verified
template<class T, int mx=20>
vc<T>bitwise_conv(vc<T>p, vc<T>q, bool tmod = true){
	int n = p.size();
	int b = 0;
	while((1<<b) < n) b++;
	assert(b <= mx);
	auto fwt = [&](vc<T>&a){
		for(int d=1;d<n;d<<=1){
			for(int m=d<<1,i=0;i<n;i+=m){
				rep(j, d){
					auto x = a[i+j], y = a[i+j+d];
					x = a[i+j],y = a[i+j+d];
					//xor;
					a[i+j] = (x+y)%mod, a[i+j+d] = (x-y+mod)%mod;
					//and
					//a[i+j] = x+y;
					//or
					//a[i+j+d] = x+y;
					if(tmod && a[i+j] >= mod) a[i+j] -= mod;
					if(tmod && a[i+j+d] >= mod) a[i+j+d] -= mod;
				}
			}
		}
	};
	auto ufwt = [&](vc<T>&a){
		for(int d=1;d<n;d<<=1){
			for(int m=d<<1,i=0;i<n;i+=m){
				rep(j, d){
					auto x = a[i+j], y = a[i+j+d];
					x = a[i+j],y = a[i+j+d];
					//xor;
					a[i+j] = (x+y)%mod, a[i+j+d] = (x-y+mod)%mod;
					//and
					//a[i+j] = x-y+mod;
					//or
					//a[i+j+d] = y-x+mod;
					if(tmod && a[i+j] >= mod) a[i+j] -= mod;
					if(tmod && a[i+j+d] >= mod) a[i+j+d] -= mod;
				}
			}
		}
	};
	fwt(p);
	//fwt(q);
	rep(i, n) {
		//p[i] + p[i]*p[i] + ....
		p[i] = (p[i]%mod+mod)%mod;
		
		if(p[i] == 0) continue;
		assert(p[i] > 1);
		
		p[i] = (ll)p[i] * modpow(mod+1-p[i],mod-2) % mod;
		if(tmod) p[i] %= mod;
	}
	ufwt(p);
	//xor
	ll R = modpow(n, mod-2);
	rep(i, n){
		if(tmod) p[i] = p[i] * R % mod;
		else p[i] /= n;
	}
	
	return p;
}
void solve(){
	s2 = modpow(s2, mod-2);
	int n; cin>>n; n++;
	vc<int>a(n);
	rep(i, n) cin >> a[i];
	int sum = 0;
	rep(i, n) sum += a[i];
	rep(i, n) a[i] = a[i] * modpow(sum%mod, mod-2) % mod;
	int ans = 0;
	for(int i=1;i<(1<<10);i++){
		vc<int>f((1<<10), 0);
		repn(j, n-1) if(i != j) f[j] = a[j];
		auto ret = bitwise_conv<int>(f, f);
		int sum = 0;
		for(auto a:ret) sum += a;
		
		ans += ret[i] * a[0] % mod;
	}
	o((ans%mod+mod)%mod);
}
signed main(){
	make();
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	int t; t = 1; //cin >> t;
	while(t--) solve();
}
0