AcWing 4727. 摆放棋子

4727. 摆放棋子 - AcWing题库

 

【DP】dp[i][j][k][u]代表当前黑棋i个，白棋j个，末尾连续的黑棋k个，末尾连续的白棋u个时的方案数，那么当前dp[i][j][k][u]这个状态可以：

1.放个黑棋，转移到dp[i + 1][j][k + 1][0]

2.放个白棋，转移到dp[i][j + 1][0][u + 1]

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

int n1, n2, k1, k2, mod = 1e8;
int dp[101][101][11][11];

int main() {
    cin >> n1 >> n2 >> k1 >> k2;
    dp[0][0][0][0] = 1;
    for (int i = 0; i <= n1; i++) {
        for (int j = 0; j <= n2; j++) {
            for (int k = 0; k <= k1; k++) {
                for (int u = 0; u <= k2; u++) {
                    int t = dp[i][j][k][u];
                    if (i + 1 <= n1 && k + 1 <= k1) dp[i + 1][j][k + 1][0] = (dp[i + 1][j][k + 1][0] + t) % mod;
                    if (j + 1 <= n2 && u + 1 <= k2) dp[i][j + 1][0][u + 1] = (dp[i][j + 1][0][u + 1] + t) % mod;
                }
            }
        }
    }
    long long ans = 0;
    for (int i = 0; i <= k1; i++) {
        for (int j = 0; j <= k2; j++) {
            ans += dp[n1][n2][i][j];
        }
    }
    cout << ans % mod << endl;
}