結果
問題 | No.1741 Arrays and XOR Procedure |
ユーザー | suta28407928 |
提出日時 | 2021-11-12 21:54:51 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,412 bytes |
コンパイル時間 | 1,820 ms |
コンパイル使用メモリ | 181,916 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-25 18:14:18 |
合計ジャッジ時間 | 3,769 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,248 KB |
testcase_03 | AC | 37 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 30 ms
5,248 KB |
testcase_06 | AC | 34 ms
5,248 KB |
testcase_07 | AC | 36 ms
5,248 KB |
testcase_08 | AC | 30 ms
5,248 KB |
testcase_09 | WA | - |
testcase_10 | AC | 31 ms
5,248 KB |
testcase_11 | AC | 24 ms
5,248 KB |
testcase_12 | AC | 19 ms
5,248 KB |
testcase_13 | WA | - |
testcase_14 | AC | 21 ms
5,248 KB |
testcase_15 | AC | 28 ms
5,248 KB |
testcase_16 | WA | - |
testcase_17 | AC | 11 ms
5,248 KB |
testcase_18 | WA | - |
testcase_19 | AC | 3 ms
5,248 KB |
testcase_20 | AC | 33 ms
5,248 KB |
testcase_21 | AC | 26 ms
5,248 KB |
testcase_22 | WA | - |
testcase_23 | AC | 11 ms
5,248 KB |
testcase_24 | AC | 4 ms
5,248 KB |
testcase_25 | AC | 33 ms
5,248 KB |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 26 ms
5,248 KB |
testcase_29 | WA | - |
testcase_30 | AC | 24 ms
5,248 KB |
testcase_31 | AC | 3 ms
5,248 KB |
testcase_32 | AC | 16 ms
5,248 KB |
testcase_33 | AC | 19 ms
5,248 KB |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | AC | 14 ms
5,248 KB |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | AC | 7 ms
5,248 KB |
testcase_42 | WA | - |
testcase_43 | AC | 2 ms
5,248 KB |
ソースコード
#pragma GCC ta g("avx2")#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;#define DEBUG#ifdef DEBUGtemplate <class T, class U>ostream &operator<<(ostream &os, const pair<T, U> &p) {os << '(' << p.first << ',' << p.second << ')';return os;}template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {os << '{';for(int i = 0; i < (int)v.size(); i++) {if(i) { os << ','; }os << v[i];}os << '}';return os;}void debugg() { cerr << endl; }template <class T, class... Args>void debugg(const T &x, const Args &... args) {cerr << " " << x;debugg(args...);}#define debug(...) \cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl#else#define debug(...) (void(0))#define dump(x) (void(0))#endifusing namespace std;typedef long long ll;typedef vector<ll> vl;typedef vector<vl> vvl;typedef vector<char> vc;typedef vector<string> vs;typedef vector<bool> vb;typedef vector<double> vd;typedef pair<ll,ll> P;typedef pair<int,int> pii;typedef vector<P> vpl;typedef tuple<ll,ll,ll> tapu;#define rep(i,n) for(int i=0; i<(n); i++)#define REP(i,a,b) for(int i=(a); i<(b); i++)#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){if(a>b){a = b; return true;}else return false;}template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){if(a<b){a = b; return true;}else return false;}template<typename T> inline void print(T &a){int sz = a.size();for(auto itr = a.begin(); itr != a.end(); itr++){cout << *itr;sz--;if(sz) cout << " ";}cout << "\n";}template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){cout << a << " " << b << " " << c << "\n";}void mark() {cout << "#" << "\n";}ll pcount(ll x) {return __builtin_popcountll(x);}//#include <atcoder/maxflow>//using namespace atcoder;const int inf = (1<<30)-1;const ll linf = 1LL<<61;const int MAX = 510000;int dy[8] = {0,1,0,-1,1,-1,-1,1};int dx[8] = {-1,0,1,0,1,-1,1,-1};const double pi = acos(-1);const double eps = 1e-9;//const int mod = 1e9 + 7;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 mint = ModInt<mod>;mint dp[2][2][2];int main(){int n; cin >> n;vl a(n); rep(i,n) cin >> a[i];dp[0][0][0] = 1;rep(i,n){rep(j,2) rep(k,2) dp[1][j][k] = 0;rep(j,2) rep(k,2) rep(l,2){if(a[i] >= 0 && l != a[i]) continue;dp[1][l][j^l] += dp[0][j][k];}swap(dp[0],dp[1]);}cout << dp[0][0][1] + dp[0][1][1] << endl;}