Submission #994707

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<"("<<p.fs<<","<<p.sc<<")";}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;}
int H,W;
string s[200];
typedef long long ll;
ll mod=1e9+7;
int calc2(string s){
	string t=s;
	reverse(all(t));
	if(s==t) return 1;
	return 2;
}
int f[5]={1,1,2,6,24};
int calc(string s){
	map<char,int> mp;
	rep(i,4) mp[s[i]]++;
	int ret=24;
	for(auto it:mp){
		ret/=f[it.sc];
	}
//	show(s);
//	show(ret);
	return ret;
}
int main(){
	cin>>H>>W;
	rep(i,H) cin>>s[i];
	ll ans=1;
	rep(i,H/2) rep(j,W/2){
		string t;
		t+=s[i][j];
		t+=s[i][W-1-j];
		t+=s[H-1-i][j];
		t+=s[H-1-i][W-1-j];
		ans=ans*calc(t)%mod;
	}
	if(H%2){
		string t=s[H/2];
		ans=ans*calc2(t)%mod;
	}
	if(W%2){
		string t;
		rep(i,H) t+=s[i][W/2];
		ans=ans*calc2(t)%mod;
	}
	cout<<ans<<endl;
}

Submission Info

Judge Result