[HDU 6122] Color the chessboard

题目链接： http://acm.hdu.edu.cn/showproblem.php?pid=6122

题目大意：给你一个n*m的棋盘， 有的格子已经被染成蓝色或红色， 有的格子是空的， 求有多少种染色方案是的每个长和宽均为偶数的连续子棋盘中蓝红格子个数相等。（$1\leq n, m \leq 10^3$）

思路： 这是一道套路题。。。设蓝色为0，红色为1， 并且按照行号列号的和奇偶性反色后， 可以发现（这个自己拿个2*2的画下就知道了）， 所有可行解必须满足每行全0或者全1， 或者每列全0或全1。 最后就变成了考虑每行或者每列统一染成什么颜色， 即2的没有被确定的行数或列数次方， 注意全0或全1的情况可能会被算两遍。

#include <cstdio>
#include <cstdlib>
#include <algorithm>

#define ll long long

using namespace std;

const int N = 1010;
const int mo = 998244353;

int n, m, G[N][N]; char str[N];
int row[N], col[N], bin[N];

int main(){
    bin[0] = 1;
    for (int i = 1; i < N; i ++) bin[i] = 1LL * 2 * bin[i - 1] % mo;

    int T = 0; scanf("%d", &T);
    while (T --){
        scanf("%d %d", &n, &m);
        for (int i = 1; i <= n; i ++){
            scanf("%s", str + 1);
            for (int j = 1; j <= m; j ++){
                if (str[j] == '?') G[i][j] = -1;
                else G[i][j] = (str[j] == 'R') ^ ((i + j) & 1); 
            }
        }

        for (int i = 1; i <= n; i ++) row[i] = -1;
        for (int j = 1; j <= m; j ++) col[j] = -1;

        bool ok1 = 1, ok2 = 1;
        for (int i = 1; i <= n; i ++)
            for (int j = 1; j <= m; j ++){
                if (G[i][j] == -1) continue;
                if (row[i] == -1) row[i] = G[i][j];
                else if (row[i] != G[i][j]) ok1 = 0;
                if (col[j] == -1) col[j] = G[i][j];
                else if (col[j] != G[i][j]) ok2 = 0;
            }

        ll ans = 0;
        if (ok1){
            int num = 0;
            for (int i = 1; i <= n; i ++)
                num += row[i] == -1;
            ans = (ans + bin[num]) % mo;
        }
        if (ok2){
            int num = 0;
            for (int i = 1; i <= m; i ++)
                num += col[i] == -1;
            ans = (ans + bin[num]) % mo;
        }
        if (ok1 && ok2){
            bool b0 = 1, b1 = 1;
            for (int i = 1; i <= n; i ++)
                if (row[i] == 1) b0 = 0;
                else if (row[i] == 0) b1 = 0;
            for (int i = 1; i <= m; i ++)
                if (col[i] == 1) b0 = 0;
                else if (col[i] == 0) b1 = 0;

            ans = (ans - b0 - b1 + mo) % mo;
        }

        printf("%lld\n", ans);
    }

    return 0;
}