Submission

Score: 100

User: C12

Problemset: กองไฟ

Language: cpp

Time: 0.006 second

Submitted On: 2026-01-20 00:13:39

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

#define f first
#define s second
#define pii pair<ll,ll>
#define puii pair<ull,ull>
#define piii pair<ll,pii>
#define ll long long
#define ull unsigned long long
#define mp make_pair
 
#define mpiii(a,b,c) make_pair(a,make_pair(b,c));
int32_t mod = 1e9+7;

#define SIZE 52

// bool check(int32_t i,int32_t j,int32_t k){
    
// }

int32_t dp[SIZE][SIZE][SIZE][3][3] = {0};

void solve(){
    ll n;
    ll a,b,c;
    
    // cout << "1\n";
    cin >> n;

    cin >> a >> b >> c;

    dp[1][0][0][0][0] = 1;
    dp[0][1][0][1][1] = 1;
    dp[0][0][1][2][2] = 1;
    
    for(int l = 0;l < 3;l++){
        for(int i = 0;i <= a;i++){
            for(int j = 0;j <= b;j++){
                for(int k = 0;k <= c;k++){
                    // if(check(i,j,k)) continue;

                    if(i-1 >= 0) dp[i][j][k][l][0] = max(dp[i][j][k][l][0],(dp[i-1][j][k][l][1] + dp[i-1][j][k][l][2]) % mod);
                    if(j-1 >= 0) dp[i][j][k][l][1] = max(dp[i][j][k][l][1],(dp[i][j-1][k][l][0] + dp[i][j-1][k][l][2]) % mod);
                    if(k-1 >= 0) dp[i][j][k][l][2] = max(dp[i][j][k][l][2],(dp[i][j][k-1][l][0] + dp[i][j][k-1][l][1]) % mod);
                    
                    // cout << i << ' ' << j << ' ' << k << '\t' << dp[i][j][k][0] << ' ' << dp[i][j][k][1] << ' ' << dp[i][j][k][2] << '\n';
                }
            }
        }
    }

    ll aa = a;
    ll bb = b;
    ll cc = c;

    ll out = 0;
    for(int l = 0;l < 3;l++){
        out += (dp[a][b][c][l][0] + dp[a][b][c][l][1] + dp[a][b][c][l][2]) % mod;
    }
    out -= (dp[a][b][c][0][0] + dp[a][b][c][1][1] + dp[a][b][c][2][2]) % mod;
    while(out < 0)out += mod;
    out %= mod;
    
    cout << out;
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    // ll q;
 
    // cin >> q;
    
    // while(q--) 
    solve();

    return 0;
}