結果

問題 No.1958 Bit Game
ユーザー eQeeQe
提出日時 2022-05-27 22:19:15
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 472 ms / 2,000 ms
コード長 4,620 bytes
コンパイル時間 4,657 ms
コンパイル使用メモリ 276,588 KB
実行使用メモリ 18,432 KB
最終ジャッジ日時 2024-09-20 16:03:37
合計ジャッジ時間 16,204 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 472 ms
18,288 KB
testcase_01 AC 458 ms
18,304 KB
testcase_02 AC 456 ms
18,276 KB
testcase_03 AC 448 ms
18,152 KB
testcase_04 AC 460 ms
18,432 KB
testcase_05 AC 460 ms
18,304 KB
testcase_06 AC 440 ms
18,204 KB
testcase_07 AC 458 ms
18,256 KB
testcase_08 AC 458 ms
18,260 KB
testcase_09 AC 456 ms
18,156 KB
testcase_10 AC 146 ms
7,824 KB
testcase_11 AC 232 ms
10,624 KB
testcase_12 AC 199 ms
10,240 KB
testcase_13 AC 316 ms
13,068 KB
testcase_14 AC 283 ms
12,544 KB
testcase_15 AC 97 ms
7,552 KB
testcase_16 AC 51 ms
5,964 KB
testcase_17 AC 377 ms
15,552 KB
testcase_18 AC 294 ms
13,280 KB
testcase_19 AC 101 ms
7,372 KB
testcase_20 AC 399 ms
15,920 KB
testcase_21 AC 149 ms
9,088 KB
testcase_22 AC 233 ms
10,496 KB
testcase_23 AC 90 ms
6,712 KB
testcase_24 AC 414 ms
16,256 KB
testcase_25 AC 139 ms
8,064 KB
testcase_26 AC 386 ms
14,296 KB
testcase_27 AC 76 ms
6,844 KB
testcase_28 AC 471 ms
15,936 KB
testcase_29 AC 224 ms
10,112 KB
testcase_30 AC 2 ms
5,376 KB
testcase_31 AC 2 ms
5,376 KB
testcase_32 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<atcoder/all>
#include<bits/stdc++.h>
using namespace atcoder;
using namespace std;
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fin(a) return pt(a)
using ll=long long;
using ld=long double;
using v1=vector<ll>;
using v2=vector<v1>;
using v3=vector<v2>;
using v4=vector<v3>;
using pll=pair<ll,ll>;
using mll=map<ll,ll>;
ll inf=1LL<<60;
ld pi=acos(-1);
ld eps=1e-10;
template<class T>using ascending_priority_queue=std::priority_queue<T,vector<T>,greater<T>>;
template<class T>using descending_priority_queue=std::priority_queue<T>;
template<class T>bool chmax(T&a,const T&b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,const T&b){if(b<a){a=b;return 1;}return 0;}
template<class V,class T>T max(vector<V>&vec,const T&id){T r=id;for(auto&v:vec)chmax(r,max(v,id));return r;}
template<class V,class T>T min(vector<V>&vec,const T&id){T r=id;for(auto&v:vec)chmin(r,min(v,id));return r;}
template<class T>pll mima(const T&a,const T&b){return {min(a,b),max(a,b)};}
template<class T>T sum(vector<T>&a){return accumulate(all(a),T(0));}
template<class T>T popcnt(T a){return __builtin_popcountll(a);}
istream&operator>>(istream&is,modint1000000007&x){unsigned int t;is>>t;x=t;return is;}
istream&operator>>(istream&is,modint998244353&x){unsigned int t;is>>t;x=t;return is;}
istream&operator>>(istream&is,modint&x){unsigned int t;is>>t;x=t;return is;}
ostream&operator<<(ostream&os,const modint1000000007&x){os<<x.val();return os;}
ostream&operator<<(ostream&os,const modint998244353&x){os<<x.val();return os;}
ostream&operator<<(ostream&os,const modint&x){os<<x.val();return os;}
template<class T1,class T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<class T1,class T2>ostream&operator<<(ostream&os,const pair<T1,T2>&p){os<<p.first<<" "<<p.second;return os;}
template<class T>istream&operator>>(istream&is,vector<T>&v){for(T&x:v)is>>x;return is;}
template<class T>ostream&operator<<(ostream&os,const vector<T>&v){for(int i=0;i<(int)v.size();i++){os<<v[i]<<(i+1==(int)v.size()?"":" ");}return os;}
template<class...A>int pt_rest(){cout<<'\n';return 0;}
template<class...A>int pt(){cout<<'\n';return 0;}
template<class T,class...A>int pt_rest(const T&first,const A&...rest){cout<<" "<<first;pt_rest(rest...);return 0;}
template<class T,class...A>int pt(const T&first,const A&...rest){cout<<first;pt_rest(rest...);return 0;}
template<class V,class H>void resize(vector<V>&vec,const H head){vec.resize(head);}
template<class V,class H,class...T>void resize(vector<V>&vec,const H&head,const T...tail){vec.resize(head);for(auto&v:vec)resize(v,tail...);}
template<class V,class T>void fill(V&x,const T&val){x=val;}
template<class V,class T>void fill(vector<V>&vec,const T&val){for(auto&v:vec)fill(v,val);}
template<class H>void vin(istream&is,const int idx,vector<H>&head){is>>head[idx];}
template<class H,class...T>void vin(istream&is,const int idx,vector<H>&head,T&...tail){vin(is>>head[idx],idx,tail...);}
template<class H,class...T>void vin(istream&is,vector<H>&head,T&...tail){for(int i=0;i<(int)head.size();i++)vin(is,i,head,tail...);}
template<class H,class...T>void vin(vector<H>&head,T&...tail){vin(cin,head,tail...);}
template<class H>void sin(istream&is,H&head){is>>head;}
template<class H,class...T>void sin(istream&is,H&head,T&...tail){sin(is>>head,tail...);}
template<class H,class...T>void sin(H&head,T&...tail){sin(cin,head,tail...);}
void divisor(ll n,mll&div){for(ll i=1;i*i<=n;i++)if(n%i==0){div[i]++;div[n/i]++;}}
void factrization(ll n,mll&fact){for(ll i=2;i*i<=n;i++)while(n%i==0){fact[i]++;n/=i;}if(n>1)fact[n]++;}
ll lsqrt(ll x){assert(x>=0);if(x<=1)return x;ll r=sqrt(x)-1;while((r+1)<=x/(r+1))r++;return r;};
using S=ll;
S op(S a,S b){return a+b;}
S e(){return 0;}

int main(void){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  
  ll N,X,Y;sin(N,X,Y);
  v1 a(X),b(Y);sin(a,b);
  
  using mint=modint998244353;
  
  const ll L=19;
  
  v1 ca(L),cb(L);
  for(ll i=0;i<X;i++){
    bitset<L>s(a[i]);
    for(ll k=0;k<L;k++)ca[k]+=s[k];
  }
  for(ll i=0;i<Y;i++){
    bitset<L>s(b[i]);
    for(ll k=0;k<L;k++)cb[k]+=s[k];
  }
  
  mint ans=0;
  for(ll k=0;k<L;k++){
    vector<vector<mint>>dp;resize(dp,N+1,2);
    dp[0][0]=1;
    
    mint q1=mint(ca[k])/X,q0=(X-mint(ca[k]))/X;
    mint r1=mint(cb[k])/Y,r0=(Y-mint(cb[k]))/Y;
    
    for(ll i=0;i<N;i++){
      dp[i+1][0]+=(dp[i][0]+dp[i][1])*r0;
      dp[i+1][0]+=dp[i][0]*q0*r1;
      dp[i+1][1]+=dp[i][0]*q1*r1;
      dp[i+1][1]+=dp[i][1]*q0*r1;
      dp[i+1][1]+=dp[i][1]*q1*r1;
    }
    ans+=(1LL<<k)*dp[N][1];
  }
  pt(ans*mint(X*Y).pow(N));;
}
0