結果
問題 | No.1741 Arrays and XOR Procedure |
ユーザー | nawawan |
提出日時 | 2021-11-12 22:47:55 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 58 ms / 2,000 ms |
コード長 | 3,978 bytes |
コンパイル時間 | 2,191 ms |
コンパイル使用メモリ | 205,340 KB |
実行使用メモリ | 18,268 KB |
最終ジャッジ日時 | 2023-08-17 03:07:25 |
合計ジャッジ時間 | 5,460 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 21 ms
14,056 KB |
testcase_01 | AC | 21 ms
14,040 KB |
testcase_02 | AC | 21 ms
13,880 KB |
testcase_03 | AC | 58 ms
18,104 KB |
testcase_04 | AC | 20 ms
14,228 KB |
testcase_05 | AC | 51 ms
18,156 KB |
testcase_06 | AC | 57 ms
18,168 KB |
testcase_07 | AC | 58 ms
18,268 KB |
testcase_08 | AC | 53 ms
18,208 KB |
testcase_09 | AC | 52 ms
17,468 KB |
testcase_10 | AC | 53 ms
17,628 KB |
testcase_11 | AC | 45 ms
16,692 KB |
testcase_12 | AC | 41 ms
16,084 KB |
testcase_13 | AC | 51 ms
17,412 KB |
testcase_14 | AC | 42 ms
16,172 KB |
testcase_15 | AC | 50 ms
17,156 KB |
testcase_16 | AC | 23 ms
14,256 KB |
testcase_17 | AC | 32 ms
14,920 KB |
testcase_18 | AC | 44 ms
16,408 KB |
testcase_19 | AC | 22 ms
13,932 KB |
testcase_20 | AC | 56 ms
17,948 KB |
testcase_21 | AC | 47 ms
16,776 KB |
testcase_22 | AC | 45 ms
16,476 KB |
testcase_23 | AC | 30 ms
14,784 KB |
testcase_24 | AC | 23 ms
14,252 KB |
testcase_25 | AC | 56 ms
17,948 KB |
testcase_26 | AC | 36 ms
15,516 KB |
testcase_27 | AC | 22 ms
13,924 KB |
testcase_28 | AC | 46 ms
16,564 KB |
testcase_29 | AC | 50 ms
17,036 KB |
testcase_30 | AC | 47 ms
16,524 KB |
testcase_31 | AC | 23 ms
13,868 KB |
testcase_32 | AC | 36 ms
15,520 KB |
testcase_33 | AC | 39 ms
15,712 KB |
testcase_34 | AC | 28 ms
14,556 KB |
testcase_35 | AC | 22 ms
13,872 KB |
testcase_36 | AC | 24 ms
14,252 KB |
testcase_37 | AC | 34 ms
15,444 KB |
testcase_38 | AC | 55 ms
18,184 KB |
testcase_39 | AC | 33 ms
15,048 KB |
testcase_40 | AC | 21 ms
13,932 KB |
testcase_41 | AC | 27 ms
14,464 KB |
testcase_42 | AC | 23 ms
13,968 KB |
testcase_43 | AC | 21 ms
13,868 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; template<const int MOD> struct modint{ long long val; modint(): val(0) {} modint(long long x){ if(x < 0) val = x % MOD + MOD; else val = x % MOD; } modint(const modint &t){ val = t.val; } modint& operator =(const modint m){ val = m.val; return *this; } modint operator -(){ return modint(-val); } modint& operator-=(const modint &m){ val -= m.val; if(val < 0) val += MOD; return *this; } modint& operator+=(const modint &m){ val += m.val; if(val >= MOD) val -= MOD; return *this; } modint& operator*=(const modint &m){ val *= m.val; val %= MOD; return *this; } modint& operator/=(modint m){ *this *= m.inv(); return *this; } modint inv(){ long long x = 1, y = 0; long long a = val, b = MOD; while(b != 0){ long long t = a / b; a -= t * b; x -= t * y; swap(a, b); swap(x, y); } x %= MOD; if(x < 0) x += MOD; return modint(x); } modint pow(long long k){ long long res = 1; long long v = val; while(k > 0){ if(k & 1) res = res * v % MOD; v = v * v % MOD; k >>= 1; } return modint(res); } bool operator==(const modint &m){ return val == m.val; } modint operator+(const modint &m){ return modint(*this) += m; } modint operator-(const modint &m){ return modint(*this) -= m; } modint operator*(const modint &m){ return modint(*this) *= m; } modint operator/(const modint &m){ return modint(*this) /= m; } bool operator!=(const modint &m){ return modint(*this).val != m.val; } bool operator!=(const int &m){ return modint(*this).val != m; } }; const int MOD = 998244353; using mint = modint<MOD>; const int MAX = 410000; mint fac[MAX], finv[MAX], inv[MAX]; void COMinit(){ fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for(int i = 2; i < MAX; i++){ fac[i] = fac[i - 1] * i; inv[i] = mint(MOD) - inv[MOD % i] * (MOD / i); finv[i] = finv[i - 1] * inv[i]; } } mint COM(int n, int k){ if (n < k) return 0; if (n < 0 || k < 0) return 0; return fac[n] * finv[k] * finv[n - k]; } int main(){ int N; cin >> N; vector<int> B(N); for(int i = 0; i < N; i++) cin >> B[i]; vector<vector<mint>> dp(2, vector<mint>(N)); vector<int> cnt(300000); for(int i = 1; i < 300000; i++){ int ni = 2; while(i >= ni){ cnt[i] += i / ni; ni *= 2; } } for(int i = 0; i < N; i++){ int rest = cnt[N - 1] - cnt[i] - cnt[N - 1 - i]; if(i == 0){ if(B[i] == -1){ dp[0][i] = 1; dp[1][i] = 1; } else{ dp[B[i]][i] = 1; } } else{ if(rest > 0){ if(B[i] == -1){ dp[1][i] = dp[1][i - 1] * 2; dp[0][i] = dp[0][i - 1] * 2; } else{ dp[1][i] = dp[1][i - 1]; dp[0][i] = dp[0][i - 1]; } } else{ if(B[i] == 0){ dp[0][i] = dp[0][i - 1]; dp[1][i] = dp[1][i - 1]; } else if(B[i] == 1){ dp[1][i] = dp[0][i - 1]; dp[0][i] = dp[1][i - 1]; } else{ dp[1][i] = dp[1][i - 1] + dp[0][i - 1]; dp[0][i] = dp[1][i - 1] + dp[0][i - 1]; } } } } cout << dp[1][N - 1].val << endl; }