Codeforces-118D. Caesar's Legions(lazy dynamics)

传送门

把n1个步兵和n2个骑兵派成一列，已知连续的步兵不超过k1个，连续的骑兵不超过k2个，求总可能排列情况数

定义dp[i][j][2]，指使用i个步兵，j个骑兵的排列。0代表排头为步兵，1代表排头为骑兵

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define INF 0x3f3f3f3f
#define MOD 100000000
using namespace std;
typedef long long LL;int N1, N2, K1, K2;
const int maxn = 110;
int dp[maxn][maxn][2];int main() {scanf("%d%d%d%d", &N1, &N2, &K1, &K2);for (int i = 0; i <= K1; i++) dp[i][0][0] = 1;for (int i = 0; i <= K2; i++) dp[0][i][1] = 1;for (int i = 1; i <= N1; i++) {for (int j = 1; j <= N2; j++) {for (int k = 1; k <= min(i, K1); k++) {dp[i][j][0] = (dp[i][j][0] + dp[i - k][j][1]) % MOD;}for (int k = 1; k <= min(j, K2); k++) {dp[i][j][1] = (dp[i][j][1] + dp[i][j - k][0]) % MOD;}}}int ans = (dp[N1][N2][0] + dp[N1][N2][1]) % MOD;printf("%d\n", ans);return 0;
}

转载于:https://www.cnblogs.com/xFANx/p/8436652.html

Codeforces-118D. Caesar's Legions(lazy dynamics)相关推荐

Codeforces 118 D. Caesar's Legions (dp)
题目链接:http://codeforces.com/contest/118/problem/D 有n个步兵和m个骑兵要排成一排,其中连续的步兵不能超过k1个,连续的骑兵不能超过k2个. dp[i][ ...
Codeforces118D Caesar's Legions（DP）
题目 Source http://codeforces.com/problemset/problem/118/D Description Gaius Julius Caesar, a famous g ...
Codeforces - 102222C - Caesar Cipher
https://codeforc.es/gym/102222/my 好像在哪里见过这个东西?字符的左右移还是小心,注意在mod26范围内. #include<bits/stdc++.h> ...
acm竞赛小结5 BUAA Training 2013 #1
上周参加了北航2013训练赛#1 挺有意思的对于初学者难度也挺适中一共一周时间所以时间相当充裕全A完了. A - Coins Time Limit:2000MS Memory Limi ...
Codeforces Round #335 (Div. 2) D. Lazy Student 构造
D. Lazy Student Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/606/probl ...
CodeForces - 817F MEX Queries(线段树lazy序)
题目链接:点击查看题目大意:初始时有一个空的集合,需要执行 n 次操作: 1 l r:将区间 [ l , r ] 内未出现的数加入到集合中 2 l r:将区间 [ l , r ] 内出现的数字全部删 ...
(CodeForces 548B 暴力) Mike and Fun
http://codeforces.com/problemset/problem/548/B Mike and some bears are playing a game just for fun. ...
CodeForces 390E Inna and Large Sweet Matrix(树状数组改段求段）
CodeForces 390E Inna and Large Sweet Matrix(树状数组改段求段) 树状数组仅仅能实现线段树区间改动和区间查询的功能,能够取代不须要lazy tag的线段树.且 ...
Codeforces Round #321 (Div. 2) E
终于补好了. 题目链接: http://codeforces.com/contest/580/problem/E E. Kefa and Watch time limit per test 1 sec ...

Codeforces-118D. Caesar's Legions(lazy dynamics)

Codeforces-118D. Caesar's Legions(lazy dynamics)相关推荐

最新文章

热门文章