Submission #2039750
Source Code Expand
#include <iostream> #include <vector> #include<algorithm> #include<iomanip> #include<queue> using namespace std; #define rep(i,n) for(int i=0;i<(int)(n);i++) #define REP(i,m,n) for(int i=m;i<(int)(n);i++) typedef pair<int,int> pint; typedef pair<long long,long long> pll; typedef long long ll; const int inf = 1<<30-1; const ll longinf = 1LL<<60; int dx[4]={1,0,-1,0}, dy[4]={0,1,0,-1}; int gcd(int x,int y){ if(x>y)swap(x,y); if(y%x==0) return x; else return gcd(y%x,x); } int main(){ int n,p; cin>>n>>p; int odd=0,even=0; rep(i,n){ int a; cin>>a; if(a%2==0)even++; else odd++; } if(p==1&&odd==0){ cout<<"0"<<endl; return 0; } if(odd==0){ cout<<(1LL<<even)<<endl; return 0; } cout<<(1LL<<even)*(1LL<<(odd-1))<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Biscuits |
User | tempura0224 |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 848 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
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 | AC | 1 ms | 256 KB |
in2.txt | AC | 1 ms | 256 KB |
in3.txt | AC | 1 ms | 256 KB |
in4.txt | AC | 1 ms | 256 KB |
in5.txt | AC | 1 ms | 256 KB |
in6.txt | AC | 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 | AC | 1 ms | 256 KB |