Submission #1411717
Source Code Expand
#include <iostream> #include <fstream> #include <cstdio> #include <cassert> #include <complex> #include <cmath> #include <algorithm> #include <vector> #include <string> #include <cstdlib> #include <cstring> #include <iomanip> #include <numeric> #include <sstream> #include <ctime> #include <cctype> #include <set> #include <map> #include <queue> #include <bitset> #include <deque> #include <stack> #include <memory.h> using namespace std; #define ll long long ll z=0,o=0,n,p; ll candy[51]; ll d2(ll x){ if(x==0){ return 1; } if(x==1){ return 2; } else{ if(x%2==0){ ll a=d2(x/2)*d2(x/2); return a; } else { ll a=d2((x-1)/2)*d2((x-1)/2)*2; return a; } } } ll co(ll a){ ll pro=1; a=o-a; if(a==0){ return 1; } else{ for(ll i=1;i<=a;i++){ pro*=(o-i+1); pro/=i; } } return pro; } ll all_one(){ ll sum=0; for(ll i=0;i<=o;i+=2){ ll b=co(i); sum+=b; } if(sum==0){ return 1; } return sum; } ll all_one2(){ ll sum=0; for(ll i=1;i<=o;i+=2){ ll b=co(i); sum+=b; } return sum; } ll all_zero(){ ll sum=d2(z); if(sum==0){ return 1; } else return sum; } int main() { ll ans=0; cin>>n>>p; for(ll i=0;i<n;i++){ cin>>candy[i]; candy[i]=candy[i]%2; if(candy[i]==0)z++; else o++; } ll ze=all_zero(); ll on=all_one(); ll one=all_one2(); //cout<<ze<<" "<<on<<" "<<one<<" "; if(p==0){ cout<<ze*on; } else cout<<ze*one; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Biscuits |
User | ZHR2017 |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 1511 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 |