Submission #2141444

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

const int N = 205;
const int mod = 1e9 + 7;

int n, m, res = 1;
int par[N];
char a[N][N];

int find(int u) { return (u == par[u]) ? u : par[u] = find(par[u]); }

void join(int u, int v) { par[find(u)] = find(v); }

int main() {
	ios::sync_with_stdio(false);
	cin >> n >> m;
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			cin >> a[i][j];
		}
	}
	if (n & 1) {
		string s, t;
		for (int i = 0; i < m; ++i) {
			s.push_back(a[n / 2][i]);
		}
		t = s, reverse(t.begin(), t.end());
		res *= (s != t) + 1;
	}
	if (m & 1) {
		string s, t;
		for (int i = 0; i < n; ++i) {
			s.push_back(a[i][m / 2]);
		}
		t = s, reverse(t.begin(), t.end());
		res *= (s != t) + 1;		
	}
	for (int i = 0; i < n / 2 + m / 2; ++i) par[i] = i;
	for (int i = 0; i < n / 2; ++i) {
		for (int j = 0; j < m / 2; ++j) {
			set<string> ss;
			vector<char> v;
			vector<int> p;
			v.push_back(a[i][j]), v.push_back(a[n - 1 - i][j]);
			v.push_back(a[i][m - 1 - j]), v.push_back(a[n - 1 - i][m - 1 - j]);
			for (int k = 0; k < 4; ++k) p.push_back(k);
			do {
				string s;
				for (int k = 0; k < 4; ++k) s.push_back(v[p[k]]);
				ss.insert(s);
			} while (next_permutation(p.begin(), p.end()));
			res = 1LL * res * ss.size() / 2 % mod;
			if (ss.size() != 24) join(i, j + n / 2);
		}
	}
	int cnt = n / 2 + m / 2;
	for (int i = 0; i < n / 2 + m / 2; ++i) cnt -= find(i) == i;
	for (int i = 0; i < cnt; ++i) res = 2 * res % mod;
	cout << res;
}

Submission Info

Judge Result