CF118D Caesar‘s Legions(dp)

吹梦到西周啊啊啊

于 2020-05-22 22:09:50 发布

阅读量267

点赞数 1

分类专栏： dp

本文链接：https://blog.csdn.net/qq_43054573/article/details/106291914

版权

dp 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Caesar’s Legions

题意：将n1个0和n2个1排列，最多允许k1个0或k2个1连续，求排列数

分析：
1.显然还是线性dp（反正是dp，是不是线性不清楚）
2.最开始的想法：f(i,j,k) 长度为i的排序，以j结尾，最后连续k个j，后来发现转移方程很复杂，遂放弃
3.f(i,j,k,m) 选i个0，j个1，最后连续k个m，以m结尾，虽然转移方程还是有一点点复杂，但至少我能实现了（还是我太菜了）
4.转移方程分为k=1和k>1两种情况：
a. k=1时以0结尾为例 $\sum ^{min(j,k2)}_{k=1} dp[i-1][j][k][1]$
b. k>1时以0结尾为例 $d p [i] [j] [k] [0] + = d p [i - 1] [j] [k - 1] [0]$
5.最后求和就行了
Code:

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define mem(a, b) memset(a, b, sizeof(a));
#define lowbit(x) (x & -x)
#define lrt nl, nr, rt << 1
#define rrt nl, nr, rt << 1 | 1
template <typename T>
inline void read(T& t) {
    t = 0;
    int f = 1;
    char ch = getchar();
    while (!isdigit(ch)) {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (isdigit(ch)) {
        t = t * 10 + ch - '0';
        ch = getchar();
    }
    t *= f;
}
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const ll Inf = 9223372036854775807;
const int inf = 0x3f3f3f3f;
const double eps = 1e-5;
const int maxn = 110;
const int maxk = 20;
const int mod = 1e8;

int dp[maxn][maxn][maxk][2];

int main(void) {
    int n1, n2, k1, k2;
    read(n1), read(n2), read(k1), read(k2);
    for (int i = 1; i <= k1; i++)
        dp[i][0][i][0] = 1;
    for (int i = 1; i <= k2; i++)
        dp[0][i][i][1] = 1;
    for (int i = 1; i <= n1; i++) {
        for (int j = 1; j <= n2; j++) {
            // k > 1
            for (int k = 2; k <= min(i, k1); k++)
                (dp[i][j][k][0] += dp[i - 1][j][k - 1][0]) %= mod;
            for (int k = 2; k <= min(j, k2); k++)
                (dp[i][j][k][1] += dp[i][j - 1][k - 1][1]) %= mod;
            // k = 1
            for (int k = 1; k <= min(j, k2); k++)
                (dp[i][j][1][0] += dp[i - 1][j][k][1]) %= mod;
            for (int k = 1; k <= min(i, k1); k++)
                (dp[i][j][1][1] += dp[i][j - 1][k][0]) %= mod;
        }
    }
    int ans = 0;
    for (int i = 1; i <= k1; i++)
        (ans += dp[n1][n2][i][0]) %= mod;
    for (int i = 1; i <= k2; i++)
        (ans += dp[n1][n2][i][1]) %= mod;
    printf("%d\n", ans);
    return 0;
}