Submission #1443741

---

Source Code Expand

#include<bits/stdc++.h>

#define int long long int
#define rep(a,b,c) for(int a=b;a<c;a++)
#define repm(a,b,c) for(int a=(b-1);a>=c;a--)
#define pb push_back
#define str string
#define sf(a) scanfs("%d",&a)
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) (v).begin(), (v).end()
#define clean(used) memset(used,false,sizeof(used))
using namespace std;

const int INF = 1e18 + 9;
const int Mod = 1e9 + 7;
inline int replac(str s){double ans=0;rep(i,0,s.length()){ans+=(s[i]-'0')*pow(10,s.length()-i-1);}return (int)ans;}
inline string numstr(int m){str s="";while(m>0){char c;int a=m/10;if(a>0)a=m%(a*10);else a=m;c=(char)('0'+a);s+=c;m/=10;}str st="";for(int i=s.size()-1;i>=0;i--){st+=s[i];}return st;}
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
int h,a[200],s;
int me[200][2];
int f(int num,int sum){
    if(num >= s)return 0;
    else if(me[num][sum]>=0){
        return me[num][sum];
    }
    else{
        if((sum+a[num])%2 == h){
            return me[num][sum] = f(num+1,(sum+a[num])%2)+f(num+1,sum)+1;
        }else{
            return me[num][sum] = f(num+1,(sum+a[num])%2)+f(num+1,sum);
        }
    }
}
signed main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    rep(i,0,200){
        rep(j,0,2){
            me[i][j]=-1;
        }
    }
    cin >> s;
    cin >> h;
    if(h > 1){
        cout << 0 << endl;
        return 0;
    }
    rep(i,0,s){
        cin >> a[i];
    }
    int ans = 0;
    ans = f(0,0);
    if(h==0)ans++;
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result