Codeforces 118D Caesar's Legions

最新推荐文章于 2020-10-04 13:36:02 发布

spongewxy

最新推荐文章于 2020-10-04 13:36:02 发布

阅读量614

点赞数

分类专栏： Codeforces

本文链接：https://blog.csdn.net/XDU_PYL/article/details/49506911

版权

Codeforces 专栏收录该内容

109 篇文章 1 订阅

订阅专栏

Gaius Julius Caesar, a famous general, loved to line up his soldiers. Overall the army had n₁ footmen and n₂ horsemen. Caesar thought that an arrangement is not beautiful if somewhere in the line there are strictly more that k₁ footmen standing successively one after another, or there are strictly more than k₂ horsemen standing successively one after another. Find the number of beautiful arrangements of the soldiers.

Note that all n₁ + n₂ warriors should be present at each arrangement. All footmen are considered indistinguishable among themselves. Similarly, all horsemen are considered indistinguishable among themselves.

Input

The only line contains four space-separated integers n₁, n₂, k₁, k₂ (1 ≤ n₁, n₂ ≤ 100, 1 ≤ k₁, k₂ ≤ 10) which represent how many footmen and horsemen there are and the largest acceptable number of footmen and horsemen standing in succession, correspondingly.

Output

Print the number of beautiful arrangements of the army modulo 100000000 (10⁸). That is, print the number of such ways to line up the soldiers, that no more than k₁ footmen stand successively, and no more than k₂ horsemen stand successively.

Sample test(s)

Input

2 1 1 10

Output

Input

2 3 1 2

Output

Input

2 4 1 1

Output

Note

Let's mark a footman as 1, and a horseman as 2.

In the first sample the only beautiful line-up is: 121

In the second sample 5 beautiful line-ups exist: 12122, 12212, 21212, 21221, 22121

解题思路:dp[i][j][0] 表示前i个人中有j个男生且最后一个人是男生的方案数, dp[i][j][1] 表示前i个人有j个男生且最后一个人是女生的方案数，则我们最终求得的结果为dp[n1+n2][n1][0]+dp[n1+n2][n1][1]，状态转移见代码。

#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
const int mod = 100000000;
int dp[210][110][2];

int main() {

    //freopen("aa.in", "r", stdin);

    int n1, n2, k1, k2;
    scanf("%d %d %d %d", &n1, &n2, &k1, &k2);
    memset(dp, 0, sizeof(dp));
    dp[0][0][0] = 1;
    dp[0][0][1] = 1;
    dp[1][1][0] = 1;
    dp[1][0][1] = 1;
    for(int i = 2; i <= n1 + n2; ++i) {
        for(int j = 0; j <= n1 && j <= i; ++j) {
            int t = min(j, k1);
            for(int k = i - t; k < i; ++k) {
                dp[i][j][0] = (dp[i][j][0] + dp[k][j-(i-k)][1]) % mod;
            }
            t = min(i - j, k2);
            for(int k = i - t; k < i; ++k) {
                dp[i][j][1] = (dp[i][j][1] + dp[k][j][0]) % mod;
            }
        }
    }
    printf("%d\n", (dp[n1+n2][n1][0]+dp[n1+n2][n1][1])%mod);
    return 0;
}