Submission #1443263


Source Code Expand

#include "bits/stdc++.h"
#define MOD 1000000007
#define INF 11234567890
#define in std::cin
#define out std::cout
#define rep(i,N) for(int i=0;i<N;++i)
typedef long long int LL;

LL N, P, A[51];
LL cou[2];

int main()
{
	in >> N >> P;
	rep(i, N) { in >> A[i]; }

	rep(i, N) { ++cou[A[i] % 2]; }
	
	if (cou[1]) { out << (1 << (N - 1)) << std::endl; }
	else { out << (P ? 0 : (1 << N)) << std::endl; }
	return 0;
}

Submission Info

Submission Time
Task A - Biscuits
User Bwambocos
Language C++14 (GCC 5.4.1)
Score 0
Code Size 433 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
AC × 3
WA × 1
AC × 9
WA × 7
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt, sample4.txt
All sample1.txt, sample2.txt, sample3.txt, sample4.txt, in1.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, sample1.txt, sample2.txt, sample3.txt, sample4.txt
Case Name Status Exec Time Memory
in1.txt WA 1 ms 256 KB
in2.txt WA 1 ms 256 KB
in3.txt WA 1 ms 256 KB
in4.txt WA 1 ms 256 KB
in5.txt AC 1 ms 256 KB
in6.txt WA 1 ms 256 KB
in7.txt AC 1 ms 256 KB
in8.txt AC 1 ms 256 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB
sample3.txt AC 1 ms 256 KB
sample4.txt WA 1 ms 256 KB