結果
| 問題 | No.1741 Arrays and XOR Procedure |
| ユーザー |
 ゆにぽけ
|
| 提出日時 | 2023-10-19 10:11:48 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 16 ms / 2,000 ms |
| コード長 | 3,266 bytes |
| コンパイル時間 | 917 ms |
| コンパイル使用メモリ | 121,060 KB |
| 最終ジャッジ日時 | 2025-02-17 08:20:48 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 41 |
ソースコード
#include<iostream>#include<vector>#include<algorithm>#include<cstring>#include<cassert>#include<cmath>#include<ctime>#include<iomanip>#include<numeric>#include<stack>#include<queue>#include<map>#include<unordered_map>#include<set>#include<unordered_set>#include<bitset>#include<random>using namespace std;template<int m> struct modint{private:unsigned int value;static constexpr int mod() {return m;}public:constexpr modint(const long long x = 0) noexcept{long long y = x;if(y < 0 || y >= mod()){y %= mod();if(y < 0) y += mod();}value = (unsigned int)y;}constexpr unsigned int val() noexcept {return value;}constexpr modint &operator+=(const modint &other) noexcept{value += other.value;if(value >= mod()) value -= mod();return *this;}constexpr modint &operator-=(const modint &other) noexcept{unsigned int x = value;if(x < other.value) x += mod();x -= other.value;value = x;return *this;}constexpr modint &operator*=(const modint &other) noexcept{unsigned long long x = value;x *= other.value;value = (unsigned int) (x % mod());return *this;}constexpr modint &operator/=(const modint &other) noexcept{return *this *= other.inverse();}constexpr modint inverse() const noexcept{assert(value);long long a = value,b = mod(),x = 1,y = 0;while(b){long long q = a/b;a -= q*b; swap(a,b);x -= q*y; swap(x,y);}return modint(x);}constexpr modint power(long long N) const noexcept{assert(N >= 0);modint p = *this,ret = 1;while(N){if(N & 1) ret *= p;p *= p;N >>= 1;}return ret;}constexpr modint operator+() {return *this;}constexpr modint operator-() {return modint() - *this;}constexpr modint &operator++(int) noexcept {return *this += 1;}constexpr modint &operator--(int) noexcept {return *this -= 1;}friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}};using mint = modint<998244353>;//using mint = modint<1000000007>;int N,cnt2[2 << 17];mint dp[2][2];void solve(){cin >> N;for(int i = 1;i < 2 << 17;i++){int j = i;int e = 0;while(j%2 == 0) j >>= 1,e++;cnt2[i] = cnt2[i-1] + e;}int cur = 0;dp[cur][0] = 1;for(int i = 0;i < N;i++){int nxt = 1-cur;for(int j = 0;j < 2;j++) dp[nxt][j] = 0;//C(N-1,i)int P = cnt2[N-1]-cnt2[i]-cnt2[N-i-1];assert(P >= 0);int even = P > 0;int B;cin >> B;if(B == 0) for(int j = 0;j < 2;j++) dp[nxt][j] += dp[cur][j];else if(B == 1) for(int j = 0;j < 2;j++) dp[nxt][j^1^even] += dp[cur][j];else{for(int j = 0;j < 2;j++) dp[nxt][j] += dp[cur][j];for(int j = 0;j < 2;j++) dp[nxt][j^1^even] += dp[cur][j];}swap(cur,nxt);}cout << dp[cur][1] << endl;}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);int tt = 1;//cin >> tt;while(tt--) solve();}