結果

問題 No.1239 Multiplication -2
ユーザー minatominato
提出日時 2020-09-25 22:44:34
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 44 ms / 2,000 ms
コード長 7,029 bytes
コンパイル時間 2,803 ms
コンパイル使用メモリ 220,708 KB
実行使用メモリ 18,100 KB
最終ジャッジ日時 2023-09-10 15:57:25
合計ジャッジ時間 4,875 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 2 ms
4,384 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 2 ms
4,376 KB
testcase_09 AC 1 ms
4,376 KB
testcase_10 AC 2 ms
4,380 KB
testcase_11 AC 1 ms
4,376 KB
testcase_12 AC 1 ms
4,380 KB
testcase_13 AC 2 ms
4,380 KB
testcase_14 AC 2 ms
4,380 KB
testcase_15 AC 15 ms
7,764 KB
testcase_16 AC 24 ms
10,976 KB
testcase_17 AC 40 ms
18,032 KB
testcase_18 AC 40 ms
17,712 KB
testcase_19 AC 41 ms
18,100 KB
testcase_20 AC 41 ms
17,916 KB
testcase_21 AC 40 ms
17,448 KB
testcase_22 AC 39 ms
16,988 KB
testcase_23 AC 30 ms
13,436 KB
testcase_24 AC 29 ms
13,148 KB
testcase_25 AC 21 ms
11,456 KB
testcase_26 AC 24 ms
12,292 KB
testcase_27 AC 13 ms
7,096 KB
testcase_28 AC 38 ms
15,712 KB
testcase_29 AC 42 ms
16,656 KB
testcase_30 AC 18 ms
8,820 KB
testcase_31 AC 28 ms
11,724 KB
testcase_32 AC 44 ms
17,764 KB
testcase_33 AC 32 ms
13,408 KB
testcase_34 AC 29 ms
12,568 KB
testcase_35 AC 15 ms
7,756 KB
testcase_36 AC 14 ms
7,356 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#pragma GCC target("avx2,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#include <atcoder/all>
//using namespace atcoder;
//using mint = modint998244353;
//using mint = modint1000000007;
#include <bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//using i128 = __int128_t;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
constexpr char ln = '\n';
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}
inline int topbit(int x) {return x == 0 ? -1 : 31-__builtin_clz(x);}
inline int topbit(long long x) {return x == 0 ? -1 : 63-__builtin_clzll(x);}
inline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}
inline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}
inline int popcount(int x) {return __builtin_popcount(x);}
inline int popcount(long long x) {return __builtin_popcountll(x);}
inline int kthbit(long long x, int k) {return (x>>k)&1;}
inline void print() {cout << "\n";}
template<class T>
inline void print(const vector<T> &v) {
    for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << " ";
    print();
}
template<class T, class... Args>
inline void print(const T &x, const Args &... args) {
    cout << x << " ";
    print(args...);
}
#ifdef MINATO_LOCAL
#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
inline void debug() {cerr << endl;}
template<class T>
inline void debug(const vector<T> &v) {
    for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << " ";
    debug();
}
template<class T, class... Args>
inline void debug(const T &x, const Args &... args) {
    cerr << x << " ";
    debug(args...);
}
#else
#define dump(x) void(0)
inline void debug() {}
template<class T> inline void debug(const vector<T> &v) {}
template<class T, class... Args> inline void debug(const T &x, const Args &... args) {}
#endif
struct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

template <uint_fast64_t Modulus> 
struct ModInt {
    using u64 = uint_fast64_t;

    u64 a;

    constexpr ModInt(const long long x = 0) noexcept : a(x >= 0 ? x % Modulus : (Modulus - (-x) % Modulus) % Modulus) {}
    constexpr u64 &value() noexcept {return a;}
    constexpr const u64 &value() const noexcept {return a;}
    constexpr ModInt operator+(const ModInt rhs) const noexcept {return ModInt(*this) += rhs;}
    constexpr ModInt operator-(const ModInt rhs) const noexcept {return ModInt(*this) -= rhs;}
    constexpr ModInt operator*(const ModInt rhs) const noexcept {return ModInt(*this) *= rhs;}
    constexpr ModInt operator/(const ModInt rhs) const noexcept {return ModInt(*this) /= rhs;}
    constexpr ModInt operator^(const long long rhs) const noexcept {return ModInt(*this) ^= rhs;}
    constexpr bool operator==(const ModInt &rhs) const noexcept {return a == rhs.a;}
    constexpr bool operator!=(const ModInt &rhs) const noexcept {return a != rhs.a;}
    constexpr ModInt &operator+=(const ModInt rhs) noexcept {
        a += rhs.a;
        if (a >= Modulus) {
            a -= Modulus;
        }
        return *this;
    }
    constexpr ModInt &operator-=(const ModInt rhs) noexcept {
        if (a < rhs.a) {
            a += Modulus;
        }
        a -= rhs.a;
        return *this;
    }
    constexpr ModInt &operator*=(const ModInt rhs) noexcept {
        a = a * rhs.a % Modulus;
        return *this;
    }
    constexpr ModInt &operator/=(ModInt rhs) noexcept {
        u64 exp = Modulus - 2;
        while (exp) {
            if (exp&1) *this *= rhs;
            exp >>= 1;
            rhs *= rhs;
        }
        return *this;
    }
    constexpr ModInt &operator^=(long long exp) noexcept {
        ModInt rhs = a;
        a = 1;
        while (exp) {
            if (exp&1) *this *= rhs;
            exp >>= 1;
            rhs *= rhs;
        }
        return *this;
    }

    friend ostream &operator<<(ostream& os, const ModInt& rhs) noexcept {return os << rhs.a;}
    friend istream &operator>>(istream& is, ModInt& rhs) noexcept {long long a; is >> a; rhs = a; return is;}
};

//constexpr long long MOD = 1000000007;
constexpr long long MOD = 998244353;

using mint = ModInt<MOD>;

int main() {
    int N; cin >> N;
    vector<int> A(N);
    rep(i,N) cin >> A[i];

    //[-2,2]
    vector<vector<mint>> dp(N+1, vector<mint>(5));
    dp[0][3] = 1;

    mint ans = 0;
    mint a = 2;
    a ^= (N-1);
    mint b = 1;
    b /= 2;
    int o = 2;
    rep(i,N) {
        for (int j = -2; j <= 2; j++) {
            dp[i+1][o+1] += dp[i][o+j];
            if (A[i]==-2) {
                if (j==-2 or j==2 or j==0) {
                    dp[i+1][o+0] += dp[i][o+j];
                } else if (j == -1) {
                    dp[i+1][o+2] += dp[i][o+j];
                } else if (j == 1) {
                    dp[i+1][o-2] += dp[i][o+j];
                    ans += dp[i][o+j]*a;
                }
            } else if (A[i]==-1) {
                if (j==-2) {
                    dp[i+1][o+2] += dp[i][o+j];
                } else if (j==-1) {
                    dp[i+1][o+1] += dp[i][o+j];
                } else if (j==0) {
                    dp[i+1][o+0] += dp[i][o+j];
                } else if (j==1) {
                    dp[i+1][o-1] += dp[i][o+j];
                } else if (j==2) {
                    dp[i+1][o-2] += dp[i][o+j];
                    ans += dp[i][o+j]*a;
                }
            } else if (A[i]==0) {
                dp[i+1][o+0] += dp[i][o+j];
            } else if (A[i]==1) {
                if (j==-2) {
                    dp[i+1][o-2] += dp[i][o+j];
                    ans += dp[i][o+j]*a;
                } else if (j==-1) {
                    dp[i+1][o-1] += dp[i][o+j];
                } else if (j==0) {
                    dp[i+1][o+0] += dp[i][o+j];
                } else if (j==1) {
                    dp[i+1][o+1] += dp[i][o+j];
                } else if (j==2) {
                    dp[i+1][o+2] += dp[i][o+j];
                }
            } else if (A[i]==2) {
                if (j==-2 or j==2 or j==0) {
                    dp[i+1][o+0] += dp[i][o+j];
                } else if (j == -1) {
                    dp[i+1][o-2] += dp[i][o+j];
                    ans += dp[i][o+j]*a;
                } else if (j == 1) {
                    dp[i+1][o+2] += dp[i][o+j];
                }
            }
        }
        a *= b;
    }
    
    ans += dp[N][0];
    rep(i,N) ans *= b;

    cout << ans << ln;
    
}
0