#792089 (C++17) No.1958 Bit Game

• 問題: No.1958 Bit Game
• ユーザー: karinohito
• 提出日時: 2022-08-24 17:14:03
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 224 ms / 2,000 ms
• コード長: 2,440 bytes
• コンパイル時間: 2,087 ms
• コンパイル使用メモリ: 196,092 KB
• 最終ジャッジ日時: 2025-01-31 03:37:21
• ジャッジサーバーID （参考情報）: judge4 / judge1

ファイルパターン	結果
sample	AC * 3
other	AC * 30

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
#include <bits/stdc++.h>
#include <random>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvvvll = vector<vvvll>;
using vvvvvll = vector<vvvvll>;
using vvvvvvll = vector<vvvvvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vvvvb = vector<vvvb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
using vvvvd = vector<vvvd>;
using vvvvvd = vector<vvvvd>;
#define all(A) A.begin(),A.end()
#define ALL(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
using pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;
template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}
template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}
ll gcd(ll(a), ll(b)) {
    if (b == 0)return a;
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}
ll mod = 998244353;
ll modPow(long long a, long long n, long long p = mod) {
    if (n == 0) return 1; // 0乗にも対応する場合
    if (n == 1) return a % p;
    if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
    long long t = modPow(a, n / 2, p);
    return (t * t) % p;
}
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll N,X,Y;
    cin>>N>>X>>Y;
    vll A(X);
    vll B(Y);
    rep(i,X)cin>>A[i];
    rep(i,Y)cin>>B[i];
    ll an=0;
    rep(bit,18){
        ll ZX=0,ZY=0;
        rep(i,X)if(A[i]&(1<<bit))ZX++;
        rep(i,Y)if(B[i]&(1<<bit))ZY++;
        ll a=0,b=1;
        rep(i,N){
            ll c=0,d=0;//ctati
            c+=(a+b)*ZX;
            c+=(a)*(X-ZX);
            d+=b*(X-ZX);
            //cout<<c<<" "<<d<<endl;
            c%=mod;
            d%=mod;
            a=0,b=0;
            a+=(c)*ZY;
            b+=(c+d)*(Y-ZY);
            b+=(d)*(ZY);
            a%=mod;
            b%=mod;
            //cout<<a<<" "<<b<<endl;
        }
        an+=(1<<bit)*a;
        //cout<<"LLLLLL"<<(1<<bit)<<" "<<a<<endl;
        an%=mod;
    }
    cout<<an<<endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX