結果

問題 No.2082 AND OR XOR
ユーザー asaringoasaringo
提出日時 2023-11-07 20:35:31
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 485 ms / 2,000 ms
コード長 5,194 bytes
コンパイル時間 2,145 ms
コンパイル使用メモリ 208,204 KB
実行使用メモリ 23,680 KB
最終ジャッジ日時 2024-09-25 23:26:55
合計ジャッジ時間 12,178 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 18 ms
23,552 KB
testcase_01 AC 19 ms
23,552 KB
testcase_02 AC 28 ms
23,680 KB
testcase_03 AC 408 ms
23,552 KB
testcase_04 AC 132 ms
23,552 KB
testcase_05 AC 246 ms
23,524 KB
testcase_06 AC 347 ms
23,552 KB
testcase_07 AC 272 ms
23,648 KB
testcase_08 AC 195 ms
23,680 KB
testcase_09 AC 113 ms
23,500 KB
testcase_10 AC 271 ms
23,664 KB
testcase_11 AC 198 ms
23,568 KB
testcase_12 AC 477 ms
23,680 KB
testcase_13 AC 220 ms
23,652 KB
testcase_14 AC 192 ms
23,592 KB
testcase_15 AC 286 ms
23,512 KB
testcase_16 AC 382 ms
23,680 KB
testcase_17 AC 313 ms
23,680 KB
testcase_18 AC 83 ms
23,680 KB
testcase_19 AC 379 ms
23,680 KB
testcase_20 AC 241 ms
23,680 KB
testcase_21 AC 326 ms
23,552 KB
testcase_22 AC 271 ms
23,552 KB
testcase_23 AC 422 ms
23,680 KB
testcase_24 AC 413 ms
23,680 KB
testcase_25 AC 428 ms
23,568 KB
testcase_26 AC 158 ms
23,540 KB
testcase_27 AC 228 ms
23,680 KB
testcase_28 AC 480 ms
23,680 KB
testcase_29 AC 485 ms
23,680 KB
testcase_30 AC 483 ms
23,624 KB
testcase_31 AC 478 ms
23,552 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define overload2(a, b, c, ...) c
#define overload3(a, b, c, d, ...) d
#define overload4(a, b, c, d, e ...) e
#define overload5(a, b, c, d, e, f ...) f
#define overload6(a, b, c, d, e, f, g ...) g
#define fast_io ios::sync_with_stdio(false); cin.tie(nullptr);
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
typedef long long ll;
typedef long double ld;
#define chmin(a,b) a = min(a,b);
#define chmax(a,b) a = max(a,b);
#define bit_count(x) __builtin_popcountll(x)
#define leading_zero_count(x) __builtin_clz(x)
#define trailing_zero_count(x) __builtin_ctz(x)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a / gcd(a,b) * b
#define rep(...) overload3(__VA_ARGS__, rrep, rep1)(__VA_ARGS__)
#define rep1(i,n) for(int i = 0 ; i < n ; i++)
#define rrep(i,a,b) for(int i = a ; i < b ; i++)
#define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++)
#define pt(a) cout << a << endl;
#define print(...) printall(__VA_ARGS__);
#define debug(a) cout << #a << " " << a << endl;
#define all(a) a.begin(), a.end()
#define endl "\n";
#define v1(T,n,a) vector<T>(n,a)
#define v2(T,n,m,a) vector<vector<T>>(n,v1(T,m,a))
#define v3(T,n,m,k,a) vector<vector<vector<T>>>(n,v2(T,m,k,a))
#define v4(T,n,m,k,l,a) vector<vector<vector<vector<T>>>>(n,v3(T,m,k,l,a))
template<typename T,typename U>istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<typename T,typename U>ostream &operator<<(ostream&os,const pair<T,U>&p){os<<p.first<<" "<<p.second;return os;}
template<typename T>istream &operator>>(istream&is,vector<T>&v){for(T &in:v){is>>in;}return is;}
template<typename T>ostream &operator<<(ostream&os,const vector<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<typename T>istream &operator>>(istream&is,vector<vector<T>>&v){for(T &in:v){is>>in;}return is;}
template<typename T>ostream &operator<<(ostream&os,const vector<vector<T>>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?"\n":"");}return os;}
template<typename T>ostream &operator<<(ostream&os,const set<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<typename T>ostream &operator<<(ostream&os,const multiset<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<class... Args> void printall(Args... args){for(auto i:initializer_list<common_type_t<Args...>>{args...}) cout<<i<<" ";cout<<endl;}

const int mod = 998244353 ;

template< int mod >
struct ModInt {
    int x;

    ModInt() : x(0) {}

    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    ModInt &operator+=(const ModInt &p) {
        if((x += p.x) >= mod) x -= mod;
        return *this;
    }

    ModInt &operator-=(const ModInt &p) {
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    ModInt &operator*=(const ModInt &p) {
        x = (int) (1LL * x * p.x % mod);
        return *this;
    }

    ModInt &operator/=(const ModInt &p) {
        *this *= p.inverse();
        return *this;
    }

    ModInt operator-() const { return ModInt(-x); }

    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

    bool operator==(const ModInt &p) const { return x == p.x; }

    bool operator!=(const ModInt &p) const { return x != p.x; }

    ModInt inverse() const {
        int a = x, b = mod, u = 1, v = 0, t;
        while(b > 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        return ModInt(u);
    }

    ModInt pow(int64_t n) const {
        ModInt ret(1), mul(x);
        while(n > 0) {
            if(n & 1) ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }

    friend ostream &operator<<(ostream &os, const ModInt &p) {
        return os << p.x;
    }

    friend istream &operator>>(istream &is, ModInt &a) {
        int64_t t;
        is >> t;
        a = ModInt< mod >(t);
        return (is);
    }

    static int get_mod() { return mod; }
};

using modint = ModInt< mod >;

int n, a, b, c;

int f(int x, int y){
    int r = a * (x & y) + b * (x | y) + c * (x ^ y);
    r %= 4;
    return r;
}

modint dp[5050][4][4][4][4][4];
int C[4][4];

void solve(){
    cin >> n >> a >> b >> c;
    rep(i,4) rep(j,4) C[i][j] = f(i,j);
    rep(i,4) dp[0][i][C[0][i]][C[1][i]][C[2][i]][C[3][i]] = 1;
    rep(i,1,n){
        rep(r,4) rep(s,4) rep(t,4) rep(u,4) rep(v,4) rep(x,4) {
            vector<int> X = {s,t,u,v};
            dp[i][C[r][x]][X[C[0][x]]][X[C[1][x]]][X[C[2][x]]][X[C[3][x]]] += dp[i-1][r][s][t][u][v];
        }
    }
    modint res = 0;
    rep(r,4) rep(s,4) rep(t,4) rep(u,4) rep(v,4) rep(x,4) {
        vector<int> X = {s,t,u,v};
        if(C[r][x] == X[x]) res += dp[n-2][r][s][t][u][v];
    }
    pt(res)
}

int main(){
    fast_io
    int t = 1;
    // cin >> t;
    rep(i,t) solve();
}
0