Submission #3783297

---

Source Code Expand

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using std::cin;
using std::cout;
using std::endl;

int main(void) {
    cout << std::fixed << std::setprecision(10);
    cin.tie(0);
    std::ios::sync_with_stdio(false);
    int64_t res = 0;
    int64_t n, p;
    cin >> n >> p;
    int64_t odd = 0, even = 0;
    for (int i = 0; i < n; i++) {
        int m1;
        cin >> m1;
        if (m1 % 2 == 0)
            even++;
        else
            odd++;
    }
    switch (p) {
    case 0:
        break;
    case 1:
        if (odd == 0) {
            cout << 0;
            exit(0);
        }
        break;
    default:
        break;
    }
    cout << (int64_t)(std::pow(2, even) * std::pow(2, odd) / 2);
    return 0;
}

Submission Info

Judge Result