Submission #4805024

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

#define lint long long
#define P pair<int, int>
#define LLP pair<long long, long long>
#define REP(i, x, n) for(int i = (x), i##_len = (int)(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = (int)(n) ; i < i##_len ; ++i)
#define reps(i, n) for(int i = 1, i##_len = (int)(n) ; i <= i##_len ; ++i)
#define rrep(i, n) for(int i = (int)(n) - 1 ; i >= 0 ; --i)
#define rreps(i, n) for(int i = (int)(n) ; i > 0 ; --i)
#define SORT(x) sort((x).begin(), (x).end())
#define SORT_INV(x) sort((x).rbegin(), (x).rend())

const int IINF = (1 << 30) - 1;
const long long LLINF = 1LL << 61;
const long long MOD = 1000000007LL;
const int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};
const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};
const double EPS = 1e-8;

#define M 900

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    int t;
    cin >> t;

    vector<int> a(M);
    reps(i, t){
        cin >> a[i];
    }

    int dp[M][M];
    memset(dp, 0, sizeof(dp));

    rep(j, a[1] + 1){
        dp[1][j] = 1;
    }
    reps(i, t){
        dp[i][1] = min(1, a[i]);
    }

    REP(i, 2, M){
        for(int j = 0 ; j < M ; j += 2){
            rep(k, a[i] + 1){
                if((j / 2 + k) % 2 == 0 || (j == 2 && k == 0)){
                    dp[i][j / 2 + k] += dp[i - 1][j];
                    dp[i][j / 2 + k] %= MOD;
                }
            }
        }
    }

    int ans = 0;
    rep(i, M){
        ans += dp[i][1];
        ans %= MOD;
    }

    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result