Submission #2233848

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,n) for(int i=1;i<=(int)(n);i++)
#define rep3(i,n) for(int i=0;i<=(int)(n);i++)
#define REP(i,m,n) for(int i=m;i<(int)(n);i++)
#define repll(i,n) for(ll i=0;i<(ll)(n);i++)
#define repll2(i,n) for(ll i=1;i<=(ll)(n);i++)
#define REPLL(i,m,n) for(ll i=m;i<(ll)(n);i++)
#define INF 1000000000 //
#define LINF (ll)4000000000000000000 //
#define MOD (ll)1000000007
#define MP make_pair
#define YES(n) cout << ((n) ? "YES" : "NO"  ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define PI 3.1415926535898
#define NP(v) next_permutation(v.begin(),v.end())

//------------------------------------------------------

int main() {
    int n, p;
    cin >> n >> p;
    int a[n];
    rep(i, n) cin >> a[i];

    ll dp[2][n + 1];

    dp[0][0] = 1;
    dp[1][0] = 0;

    rep(i, n) {
        if (a[i] % 2 == 0) {
            dp[0][i + 1] = dp[0][i]*2;
            dp[1][i + 1] = dp[1][i]*2;
        } else {
            dp[0][i + 1] = dp[0][i] + dp[1][i];
            dp[1][i + 1] = dp[1][i] + dp[0][i];
        }
    }

    cout << dp[p][n] << endl;

    return 0;
}

Submission Info

Judge Result