Leetcode-5224 Dice Roll Simulation(掷骰子模拟)

typedef pair<int,int> P;
typedef long long ll;
#define _for(i,a,b) for(register int i = (a);i < b;i ++)
#define _rep(i,a,b) for(register int i = (a);i > b;i --)
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define maxn 10003
#define pb push_back
#define debug() printf("Miku Check OK!
")


class Solution
{
    public:
        ll dp[7][16][5005];
        int dieSimulator(int n, vector<int>& rollMax)
        {
            _for(i,1,7)
                dp[i][1][1] = 1;
            
            _for(i,2,n+1)
                _for(j,1,7)
                {
                    _for(k,1,rollMax[j-1]+1)
                        dp[j][k][i] += dp[j][k-1][i-1],
                        dp[j][k][i] %= MOD;
                    _for(k,1,7)
                    {
                        if(k==j)
                            continue;
                        _for(m,1,rollMax[k-1]+1)
                            dp[j][1][i] += dp[k][m][i-1];
                        dp[j][1][i] %= MOD;
                    }
                }
            ll ans = 0;
            _for(i,1,7)
                _for(j,1,rollMax[i-1]+1)
                    ans += dp[i][j][n],ans %= MOD;
            return ans;
        }
};