結果
問題 | No.985 Hadamard |
ユーザー |
![]() |
提出日時 | 2020-02-11 11:17:48 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 88 ms / 2,000 ms |
コード長 | 2,557 bytes |
コンパイル時間 | 2,069 ms |
コンパイル使用メモリ | 197,360 KB |
最終ジャッジ日時 | 2025-01-08 23:28:27 |
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 |
ソースコード
#include<bits/stdc++.h>using namespace std;using Int = long long;template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}template<typename T,T MOD = 1000000007>struct Mint{static constexpr T mod = MOD;T v;Mint():v(0){}Mint(signed v):v(v){}Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}Mint pow(long long k){Mint res(1),tmp(v);while(k){if(k&1) res*=tmp;tmp*=tmp;k>>=1;}return res;}static Mint add_identity(){return Mint(0);}static Mint mul_identity(){return Mint(1);}Mint inv(){return pow(MOD-2);}Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}Mint& operator/=(Mint a){return (*this)*=a.inv();}Mint operator+(Mint a) const{return Mint(v)+=a;}Mint operator-(Mint a) const{return Mint(v)-=a;}Mint operator*(Mint a) const{return Mint(v)*=a;}Mint operator/(Mint a) const{return Mint(v)/=a;}Mint operator-() const{return v?Mint(MOD-v):Mint(v);}bool operator==(const Mint a)const{return v==a.v;}bool operator!=(const Mint a)const{return v!=a.v;}bool operator <(const Mint a)const{return v <a.v;}static Mint comb(long long n,int k){Mint num(1),dom(1);for(int i=0;i<k;i++){num*=Mint(n-i);dom*=Mint(i+1);}return num/dom;}};template<typename T,T MOD> constexpr T Mint<T, MOD>::mod;template<typename T,T MOD>ostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}struct FastIO{FastIO(){cin.tie(0);ios::sync_with_stdio(0);}}fastio_beet;//INSERT ABOVE HEREsigned main(){int n;cin>>n;assert(1<=n && n<=18);int sz=1<<n;using ll = long long;vector<ll> cs(sz),ls(sz),hs(sz);for(int i=0;i<sz;i++) cin>>cs[i];for(int i=0;i<sz;i++) cin>>ls[i]>>hs[i];for(ll c:cs) assert(abs(c)<=1e5);for(ll l:ls) assert(abs(l)<=1e5);for(ll h:hs) assert(abs(h)<=1e5);for(int d=1;d<sz;d<<=1){for(int m=d<<1,i=0;i<sz;i+=m){for(int j=0;j<d;j++){auto x=cs[i+j+0],y=cs[i+j+d];cs[i+j+0]=x+y;cs[i+j+d]=x-y;}}}using M = Mint<int, 998244353>;M ans{0};for(int i=0;i<sz;i++){if(cs[i]<0) ans+=M(cs[i])*M(ls[i]);else ans+=M(cs[i])*M(hs[i]);}ans/=M(sz);cout<<ans<<endl;return 0;}