結果
問題 | No.1958 Bit Game |
ユーザー |
![]() |
提出日時 | 2022-05-21 01:29:42 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 111 ms / 2,000 ms |
コード長 | 5,017 bytes |
コンパイル時間 | 4,554 ms |
コンパイル使用メモリ | 262,084 KB |
最終ジャッジ日時 | 2025-01-29 12:28:46 |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 30 |
ソースコード
#include <bits/stdc++.h>using namespace std;#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;#endifusing ll = long long;using ld = long double;using ull = unsigned long long;#define endl "\n"typedef pair<int,int> Pii;#define REP(i, n) for (int i = 0; i < (n); ++i)#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)#define ALL(x) begin(x), end(x)#define PB push_back#define rrep(i,a,b) for(int i=a;i>=b;i--)#define fore(i,a) for(auto &i:a)#define all(s) (s).begin(),(s).end()#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)#define drep(i, n) drep2(i, n, 0)#define rever(vec) reverse(vec.begin(), vec.end())#define sor(vec) sort(vec.begin(), vec.end())#define fi first#define se second#define pb push_back#define P pair<ll,ll>#define PQminll priority_queue<ll, vector<ll>, greater<ll>>#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>#define PQminP priority_queue<P, vector<P>, greater<P>>#define PQmaxP priority_queue<P,vector<P>,less<P>>#define NP next_permutationtypedef string::const_iterator State;class ParseError {};//const ll mod = 1000000009;const ll mod = 998244353;//const ll mod = 1000000007;const ll inf = 4100000000000000000ll;const ld eps = ld(0.00000000000001);const long double pi = 3.141592653589793;template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}void yes(bool a){cout<<(a?"yes":"no")<<endl;}void YES(bool a){cout<<(a?"YES":"NO")<<endl;}void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }template<class T>void print(T a){cout<<a<<endl;}template<class T>auto min(const T& a){ return *min_element(all(a)); }template<class T>auto max(const T& a){ return *max_element(all(a)); }template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}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 T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1;} return ret; }vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }ll pop(ll x){return __builtin_popcountll(x);}ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}void cincout() {ios::sync_with_stdio(false);std::cin.tie(nullptr);cout<< fixed << setprecision(20);}using mint = modint998244353;//単位元ちゃんと確認しろ!!!template<class T>vector<vector<T>> multi(vector<vector<T>> &a,vector<vector<T>> &b){vector<vector<T>> c(a.size(),vector<T>(b[0].size()));for(int i=0;i<int(a.size());i++){for(int j=0;j<int(b.size());j++){for(int k=0;k<int(b[0].size());k++){c[i][k]+=a[i][j]*b[j][k];}}}return c;}template<class T>vector<vector<T>> mul_exp(vector<vector<T>> adj, ll k){if (k == 1) return adj;vector<vector<T>> res(int(adj.size()),vector<T>(int(adj[0].size())));for(int i=0;i<int(adj.size());i++){res[i][i]=1;}while(k>0){if(k&1) res=multi(adj,res);adj=multi(adj,adj);k/=2;}return res;}int main() {cincout();ll n,x,y;cin>>n>>x>>y;vector<ll> a(x),b(y);vcin(a);vcin(b);mint ans=0;for(int i=0;i<18;i++){ll p=0,q=0;for(auto e:a) if((e>>i)&1) p++;for(auto e:b) if((e>>i)&1) q++;vector<vector<mint>> u(2,vector<mint>(2)),v(2,vector<mint>(2));u[0][1]+=p;u[1][1]+=p;u[0][0]+=x-p;u[1][1]+=x-p;v[0][0]+=q;v[1][1]+=q;v[0][0]+=y-q;v[1][0]+=y-q;u=multi(u,v);u=mul_exp(u,n);ans+=u[0][1]*mint(2).pow(i);}cout<<ans.val()<<endl;}