CodeForces 1511E :Colorings and Dominoes DP + 贡献

传送门

题意

分析

显然暴力枚举每一种颜色情况是不现实的，那么我们去考虑每两个小方格在什么情况下会被覆盖，计算他们各自的贡献即可
首先考虑到每一行和每一列是相互独立的，那么我们枚举每一行和每一列，处理出来连续的方格，设长度为$len$，假设我们要选择最后两个方格进行覆盖，那么我们的方案数就是$f[i]=(f[i]+ksm(2,i-3)+f[i-2])$
假设$i-2$的颜色不一样，那么剩下的$i-3$个方格颜色就可以随便涂，如果颜色相同，那么$i-3$颜色也必须相同，因为连续三个颜色相同的方块，贡献只有1

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 3e5 + 10;
const ll mod = 998244353;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
    char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
    while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
VI nums[N];
int n,m;
char str[N];
ll f[N];

ll ksm (ll a , ll b) {
    ll ans = 1 , base = a;
    while (b) {if (b & 1) ans = ans * base % mod; b >>= 1; base = base * base % mod;} return ans;
}

int main() {
    read(n),read(m);
    int res = 0;
    for(int i = 1;i <= n;i++){
        scanf("%s",str + 1);
        nums[i].pb(0);
        for(int j = 1;j <= m;j++){
            nums[i].pb(str[j] == 'o');
            res += str[j] == 'o';
        }
    }
    f[2] = f[3] = 1;
    for(int i = 4;i <= res;i++) f[i] = (f[i] + ksm(2,i - 3) + f[i - 2]) % mod;
    for(int i = 2;i <= res;i++) f[i] = f[i] * ksm(2,res - i) % mod;
    ll ans = 0; 
    for(int i = 1;i <= n;i++){
        int x = 0;
        for(int j = 1;j <= m;j++){
            x = x * nums[i][j] + nums[i][j];
            ans = (ans + f[x]) % mod;
        }
    }
    for(int j = 1;j <= m;j++){
        int x = 0;
        for(int i = 1;i <= n;i++){
            x = x * nums[i][j] + nums[i][j];
            ans = (ans + f[x]) % mod;
        }
       
    }
    dl(ans);
    return 0;
}