当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

6122:Color the chessboard

题目描述
There is a chessboard with $n$ rows and $m$ columns, at first every position is colored red or blue or white. HazelFan want to change the color of every white position into red one or blue one, so that every rectangle in the chessboard with even rows and even colums, contains same number of red positions and blue positions. HazelFan wants to know how many ways are there to color the chessboard, module $998244353$.
输入解释
The first line contains a positive integer $T(1\leq T\leq5)$, denoting the number of test cases.
For each test case:
The first line contains two positive integers $n,m(1\leq n,m\leq10^3)$.
The next $n$ lines, the $i$th line contains a string of length $m$, the $j$th character describes the position in the $i$th row and the $j$th column as below:
'R': the position is colored red.
'B': the position is colored blue.
'?': the position is colored white.
输出解释
For each test case:
A single line contains a nonnegative integer, denoting the answer.
输入样例
2
2 2
RB
??
3 3
???
?R?
???
输出样例
2
7
来自杭电HDUOJ的附加信息
Recommend liuyiding

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-6122

最后修改于 2020-10-25T23:28:33+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 524288/524288K(Java/Others)