Educational Codeforces Round 51 (Rated for Div. 2) -D Bicolorings

最新推荐文章于 2024-08-23 23:26:17 发布

LPA20020220

最新推荐文章于 2024-08-23 23:26:17 发布

阅读量189

点赞数

分类专栏：动态规划 Codeforces 文章标签：动态规划 Codeforces

本文链接：https://blog.csdn.net/LPA20020220/article/details/82835906

版权

动态规划同时被 2 个专栏收录

126 篇文章 1 订阅

订阅专栏

Codeforces

32 篇文章 0 订阅

订阅专栏

题目描述

You are given a grid, consisting of $2$ rows and $n$ columns. Each cell of this grid should be colored either black or white.

Two cells are considered neighbours if they have a common border and share the same color. Two cells $A$ and $B$ belong to the same component if they are neighbours, or if there is a neighbour of $A$ that belongs to the same component with $B$ .

Let’s call some bicoloring beautiful if it has exactly $k$ components.

Count the number of beautiful bicolorings. The number can be big enough, so print the answer modulo $998244353$ .

输入输出格式

输入格式：

The only line contains two integers $n$ and $k$ ( $\le n \le 1000$ , $\le k \le 2n$ ) — the number of columns in a grid and the number of components required.

输出格式：

Print a single integer — the number of beautiful bicolorings modulo $998244353 $.

输入输出样例

输入样例#1：

3 4

输出样例#1：

输入样例#2：

4 1

输出样例#2：

输入样例#3：

1 2

输出样例#3：

说明

One of possible bicolorings in sample $1$ :

解题分析

一开始想的是轮廓线 $d p$ ，然后发现状态有点多，然后发现好像暴力两行一起转移就可以了。

显然如果上一行的状态共有4种情况：黑黑，黑白，白白，白黑，那么转移就是 $O (4 * 4)$ 的，总复杂度 $O (16 * N)$ 。

代码如下：

#include <cstdio>
#include <cmath>
#include <cctype>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#define R register
#define IN inline
#define W while
#define gc getchar()
#define MX 1050
#define MOD 998244353ll
#define ll long long
int dp[2][2][MX][MX * 2];
int n, k;
IN void mod(int &x, R int y) {x += y; if(x >= MOD) x -= MOD;}
int main(void)
{
	scanf("%d%d", &n, &k);
	dp[0][0][1][1] = 1;
	dp[1][1][1][1] = 1;
	dp[0][1][1][2] = 1;
	dp[1][0][1][2] = 1;
	for (R int i = 2; i <= n; ++i)
	{
		int bd = i * 2, pre = i - 1;
		for (R int j = 1; j <= bd; ++j)
		{
			mod(dp[0][0][i][j + 1], dp[1][1][pre][j]);
			mod(dp[0][0][i][j], dp[0][1][pre][j]);
			mod(dp[0][0][i][j], dp[1][0][pre][j]);
			mod(dp[0][0][i][j], dp[0][0][pre][j]);
			mod(dp[1][1][i][j + 1], dp[0][0][pre][j]);
			mod(dp[1][1][i][j], dp[0][1][pre][j]);
			mod(dp[1][1][i][j], dp[1][0][pre][j]);
			mod(dp[1][1][i][j], dp[1][1][pre][j]);
			mod(dp[0][1][i][j + 2], dp[1][0][pre][j]);
			mod(dp[0][1][i][j + 1], dp[1][1][pre][j]);
			mod(dp[0][1][i][j + 1], dp[0][0][pre][j]);
			mod(dp[0][1][i][j], dp[0][1][pre][j]);
			mod(dp[1][0][i][j + 2], dp[0][1][pre][j]);
			mod(dp[1][0][i][j + 1], dp[1][1][pre][j]);
			mod(dp[1][0][i][j + 1], dp[0][0][pre][j]);
			mod(dp[1][0][i][j], dp[1][0][pre][j]);
		}
	}
	int ans = 0;
	mod(ans, dp[1][1][n][k]), mod(ans, dp[0][0][n][k]), mod(ans, dp[0][1][n][k]), mod(ans, dp[1][0][n][k]);
	printf("%d", ans);
}