Uniformly Distributed

Posted 2021-07-19 thusloop

思路：i+j值相同的点 涂色相同

#include<bits/stdc++.h>
#define int long long
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int mod=998244353;
char a[600][600];
char b[1200];
int qpow(int a,int b)
{
	int ans=1;
	while(b)
	{
		if(b%2)ans=ans*a%mod;
		a=a*a%mod;
		b=b>>1;
	}
	return ans%mod;
}
signed main()
{
	int n,m,i,j;
	int flag=1;
	cin>>n>>m;
	for(i=0;i<1200;i++)b[i]='.';
	for(i=1; i<=n; i++)
	{
		for(j=1; j<=m; j++)
		{
			cin>>a[i][j];
			if(a[i][j]!='.')
			{
				if(b[i+j]!=a[i][j]&&b[i+j]!='.')flag=0;
				b[i+j]=a[i][j];
			}
		}
	}
	int cnt=1;
	for(i=2;i<=n+m;i++)
	{
		if(b[i]=='.')cnt++;
	}
	if(flag==0)cout<<"0"<<"\\n";
	else cout<<qpow(2,cnt-1)<<"\\n";
}