Submission #3025824
Source Code Expand
#include<iomanip> #include<limits> #include<thread> #include<utility> #include<iostream> #include<string> #include<algorithm> #include<set> #include<map> #include<vector> #include<stack> #include<queue> #include<cmath> #include<math.h> #include<numeric> #include<cassert> #include<random> #include<deque> #include<chrono> #include<unordered_map> #include<list> #include<fstream> using namespace std; typedef unsigned long long int ull; typedef long long int ll; typedef pair<ll,ll> pll; typedef pair<int,int> pi; typedef pair<double,double> pd; const ll E=1e18+7; #define F first #define S second #define MK make_pair const ll MOD=1000000007; vector<vector<ll>> mk_c(){ ll mx=60; vector<vector<ll>> c(mx+1,vector<ll>(mx+1,0)); for(ll i=0;i<=mx;i++){ c[i][i]=1; c[i][0]=1; for(ll t=1;t<i;t++){ c[i][t]=c[i-1][t-1]+c[i-1][t]; } } return c; } int main(){ vector<vector<ll>> c=mk_c(); ll n,p; cin>>n>>p; ll g=0,k=0; for(int i=0;i<n;i++){ ll b; cin>>b; if(b%2==0){g++;} else{k++;} } g=(ll)1<<g; ll K=0; if(p==1){ for(int i=1;i<=k;i+=2){ K+=c[k][i]; } } else{ for(int i=0;i<=k;i+=2){ K+=c[k][i]; } } cout<<g*K<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Biscuits |
User | tubuann |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 1414 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 |