传送门
题目描述
分析
可以观察出来横排和数列之间的贡献是互不影响的
然后我们就去搞一下连续一段内长度为
c
n
t
cnt
cnt的贡献是多少
首先如果我们长度为
c
n
t
cnt
cnt,那么第
c
n
t
cnt
cnt位如果填不符合要求的颜色的话,那么不会产生影响,也就是
f
[
c
n
t
]
+
=
f
[
c
n
t
−
1
]
f[cnt] += f[cnt - 1]
f[cnt]+=f[cnt−1]
如果第
c
n
t
cnt
cnt位的颜色符合要求的话,第
c
n
t
cnt
cnt位和
c
n
t
−
1
cnt - 1
cnt−1位就就要堪称一个整体,
f
[
c
n
t
]
+
=
2
∗
f
[
c
n
t
−
2
]
f[cnt] += 2 * f[cnt - 2]
f[cnt]+=2∗f[cnt−2]
最后如果第
c
n
t
cnt
cnt位和
c
n
t
−
1
cnt - 1
cnt−1位都符合要求,需要加上
2
c
n
t
−
2
2 ^ {cnt - 2}
2cnt−2的贡献
最后需要注意的话,这一段的贡献不影响其他的贡献,所以最后还需要乘
2
s
u
m
−
c
n
t
2 ^ {sum - cnt}
2sum−cnt
代码
#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;}
ll f[N];
ll res[N];
int n,m;
string str[N];
ll ksm(ll x, ll y) {
ll ans = 1, base = x;
while (y) {
if (y & 1)ans *= base, ans %= mod;
base *= base; base %= mod;
y >>= 1;
}
return ans;
}
int main() {
read(n),read(m);
for(int i = 0;i < n;i++) cin >> str[i];
f[0] = f[1] = 0;
res[1] = 2;
res[0] = 1;
ll ans = 0;
ll sum = 0;
for(int i = 2;i < N;i++){
f[i] = (f[i - 1] + f[i - 2] * 2) % mod + ksm(2,i - 2) % mod;
res[i] = res[i - 1] * 2 % mod;
f[i] = f[i] % mod;
}
for(int i = 0;i < n;i++) for(int j = 0;j < m;j++) sum += (str[i][j] == 'o');
for(int i = 0;i < n;i++){
int cnt = 0;
for(int j = 0;j < m;j++){
if(str[i][j] == 'o') cnt++;
if(str[i][j] != 'o' || j == m - 1){
if(cnt == 1 || cnt == 0){
cnt = 0;
continue;
}
ans = (ans + f[cnt] % mod * res[sum - cnt] % mod) % mod;
cnt = 0;
}
}
}
for(int j = 0;j < m;j++){
int cnt = 0;
for(int i = 0;i < n;i++){
// cout << i<< ' ' << j << ' ' << str[i][j] << endl;
if(str[i][j] == 'o') cnt++;
// cout << cnt << endl;
if(str[i][j] != 'o' || i == n - 1){
if(cnt == 1 || cnt == 0){
cnt = 0;
continue;
}
ans = (ans + f[cnt] % mod * res[sum - cnt] % mod) % mod;
cnt = 0;
}
}
}
dl(ans);
return 0;
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/