Submission #2138151
Source Code Expand
#include <bits/stdc++.h> using namespace std; const int N = 250; const int mod = 1e9 + 7; int n, m; char a[N][N]; int res = 1; int par[N]; int anc(int p) { return p == par[p] ? p : par[p] = anc(par[p]); } void join(int p, int q) { par[anc(p)] = anc(q); } bool is_palind(string &s) { for (int i = 0; i < s.size() / 2; ++i) { if (s[i] != s[s.size() - 1 - i]) return false; } return true; } void cut_row() { string s = ""; int mid = n / 2; for (int i = 0; i < m; ++i) { s += a[mid][i]; } if (!is_palind(s)) { res *= 2; } --n; for (int i = mid; i < n; ++i) { for (int j = 0; j < m; ++j) a[i][j] = a[i + 1][j]; } } void cut_col() { string s = ""; int mid = m / 2; for (int i = 0; i < n; ++i) { s += a[i][mid]; } if (!is_palind(s)) { res *= 2; } --m; for (int i = mid; i < m; ++i) { for (int j = 0; j < n; ++j) a[j][i] = a[j][i + 1]; } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> m; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { cin >> a[i][j]; } } if (n & 1) { cut_row(); } if (m & 1) { cut_col(); } // solve 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) { vector<char> cur; cur.push_back(a[i][j]); cur.push_back(a[n - i - 1][j]); cur.push_back(a[i][m - j - 1]); cur.push_back(a[n - i - 1][m - j - 1]); sort(cur.begin(), cur.end()); int cnt = 0; do { ++cnt; } while(next_permutation(cur.begin(), cur.end())); if (cnt == 24) { res = 12LL * res % mod; join(i, j + n / 2); } else { res = 1LL * res * cnt % mod; } } } int ncomp = 0; for (int i = 0; i < n / 2 + m / 2; ++i) { if (i == par[i]) { ++ncomp; } } for (int i = 0; i < n / 2 + m / 2 - ncomp; ++i) { res = 2LL * res % mod; } cout << res << endl; }
Submission Info
Submission Time | |
---|---|
Task | I - Reverse Grid |
User | cheater2k |
Language | C++14 (GCC 5.4.1) |
Score | 1900 |
Code Size | 2238 Byte |
Status | AC |
Exec Time | 4 ms |
Memory | 256 KB |
Judge Result
Set Name | sample | all | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1900 / 1900 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
sample | sample-01.txt, sample-02.txt |
all | sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt, 01-32.txt, 01-33.txt, 01-34.txt, 01-35.txt, sample-01.txt, sample-02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 1 ms | 256 KB |
01-02.txt | AC | 1 ms | 256 KB |
01-03.txt | AC | 1 ms | 256 KB |
01-04.txt | AC | 1 ms | 256 KB |
01-05.txt | AC | 1 ms | 256 KB |
01-06.txt | AC | 1 ms | 256 KB |
01-07.txt | AC | 1 ms | 256 KB |
01-08.txt | AC | 1 ms | 256 KB |
01-09.txt | AC | 1 ms | 256 KB |
01-10.txt | AC | 3 ms | 256 KB |
01-11.txt | AC | 3 ms | 256 KB |
01-12.txt | AC | 3 ms | 256 KB |
01-13.txt | AC | 3 ms | 256 KB |
01-14.txt | AC | 2 ms | 256 KB |
01-15.txt | AC | 2 ms | 256 KB |
01-16.txt | AC | 4 ms | 256 KB |
01-17.txt | AC | 4 ms | 256 KB |
01-18.txt | AC | 4 ms | 256 KB |
01-19.txt | AC | 4 ms | 256 KB |
01-20.txt | AC | 4 ms | 256 KB |
01-21.txt | AC | 4 ms | 256 KB |
01-22.txt | AC | 1 ms | 256 KB |
01-23.txt | AC | 2 ms | 256 KB |
01-24.txt | AC | 4 ms | 256 KB |
01-25.txt | AC | 4 ms | 256 KB |
01-26.txt | AC | 4 ms | 256 KB |
01-27.txt | AC | 1 ms | 256 KB |
01-28.txt | AC | 2 ms | 256 KB |
01-29.txt | AC | 1 ms | 256 KB |
01-30.txt | AC | 2 ms | 256 KB |
01-31.txt | AC | 4 ms | 256 KB |
01-32.txt | AC | 4 ms | 256 KB |
01-33.txt | AC | 4 ms | 256 KB |
01-34.txt | AC | 4 ms | 256 KB |
01-35.txt | AC | 4 ms | 256 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |