Submission #3040918

---

Source Code Expand

#!/usr/bin/env python

from collections import deque
import itertools as it
import sys
import math

sys.setrecursionlimit(10000000)

N, P = map(int, raw_input().split())
A = map(int, raw_input().split())
cnt = 0

for a in A:
    if a % 2 == 1:
        cnt += 1

m = {}
def comb(n, k):
    if (n, k) in m:
        return m[(n, k)]
    if n == k or k == 0:
        m[(n, k)] = 1
        return 1
    m[(n, k)] = comb(n - 1, k) + comb(n - 1, k - 1)
    return m[(n, k)]

ans = 0
rem = N - cnt
for i in range(0, cnt + 1, 2):
    ans += comb(cnt, i)
if P == 1:
    ans = 2 ** cnt - ans
print ans * (2 ** rem)

Submission Info

Judge Result