Submission #1703581

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1));
int n,a,dp[15][2]={};
	
int main(){
	cin >> n;
	dp[0][1]=1;
	REP(i,0,n){
		cin >> a;
		if(a%2){
			dp[i+1][0]=dp[i][0]*3+dp[i][1]*2;
			dp[i+1][1]=dp[i][1];
		}else{
			dp[i+1][0]=dp[i][0]*3+dp[i][1]*1;
			dp[i+1][1]=dp[i][1]*2;
		}
	}
	
	cout << dp[n][0] << endl;
	return 0;
}

Submission Info

Judge Result