Submission #994221
Source Code Expand
#include <bits/stdc++.h> #define MOD 1000000007 using namespace std; typedef long long LL; LL gcd(LL a, LL b){ if(b == 0) return a; return gcd(b,a%b); } int main(){ int a, b; cin >> a >> b; int freq[26]; string s[a]; for(int i = 0; i < a; i++) cin >> s[i]; LL ans = 1; LL all24 = 1; for(int i = 0; i < a-1-i; i++){ for(int j = 0; j < b-1-j; j++){ //cout << i << " " << j << endl; for(int z = 0; z < 26; z++) freq[z] = 0; freq[s[i][j]-'a']++; freq[s[a-1-i][j]-'a']++; freq[s[i][b-1-j]-'a']++; freq[s[a-1-i][b-1-j]-'a']++; LL r = 24; for(int z = 0; z < 26; z++){ if(freq[z] == 4) r /= 24; if(freq[z] == 3) r /= 6; if(freq[z] == 2) r /= 2; } if(r != 24) all24 = 0; ans *= r; ans %= MOD; } } if(all24 && a >= 4 && b >= 1){ ans *= 500000004; ans %= MOD; } if(a % 2){ int c = (a-1)/2; LL ok = 1; for(int j = 0; j < b; j++){ if(s[c][j] != s[c][b-1-j]) ok = 2; } ans *= ok; ans %= MOD; } if(b % 2){ int c = (b-1)/2; LL ok = 1; for(int j = 0; j < a; j++){ if(s[j][c] != s[a-1-j][c]) ok = 2; } ans *= ok; ans %= MOD; } cout << ans % MOD << endl; }
Submission Info
Submission Time | |
---|---|
Task | I - Reverse Grid |
User | ksun48 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1205 Byte |
Status | WA |
Exec Time | 467 ms |
Memory | 384 KB |
Judge Result
Set Name | sample | all | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 2 ms | 256 KB |
01-02.txt | AC | 2 ms | 256 KB |
01-03.txt | AC | 2 ms | 256 KB |
01-04.txt | AC | 2 ms | 256 KB |
01-05.txt | AC | 2 ms | 256 KB |
01-06.txt | AC | 2 ms | 256 KB |
01-07.txt | AC | 2 ms | 256 KB |
01-08.txt | WA | 2 ms | 256 KB |
01-09.txt | WA | 2 ms | 256 KB |
01-10.txt | AC | 4 ms | 256 KB |
01-11.txt | AC | 5 ms | 256 KB |
01-12.txt | AC | 5 ms | 256 KB |
01-13.txt | AC | 4 ms | 256 KB |
01-14.txt | WA | 3 ms | 256 KB |
01-15.txt | WA | 3 ms | 256 KB |
01-16.txt | WA | 4 ms | 256 KB |
01-17.txt | WA | 4 ms | 256 KB |
01-18.txt | WA | 5 ms | 256 KB |
01-19.txt | WA | 5 ms | 256 KB |
01-20.txt | WA | 4 ms | 256 KB |
01-21.txt | WA | 4 ms | 256 KB |
01-22.txt | WA | 2 ms | 256 KB |
01-23.txt | WA | 3 ms | 256 KB |
01-24.txt | WA | 4 ms | 256 KB |
01-25.txt | WA | 4 ms | 256 KB |
01-26.txt | WA | 4 ms | 256 KB |
01-27.txt | WA | 2 ms | 256 KB |
01-28.txt | WA | 2 ms | 256 KB |
01-29.txt | AC | 467 ms | 384 KB |
01-30.txt | WA | 3 ms | 256 KB |
01-31.txt | WA | 4 ms | 256 KB |
01-32.txt | WA | 5 ms | 256 KB |
01-33.txt | WA | 4 ms | 256 KB |
01-34.txt | WA | 4 ms | 256 KB |
01-35.txt | WA | 4 ms | 256 KB |
sample-01.txt | AC | 2 ms | 256 KB |
sample-02.txt | AC | 2 ms | 256 KB |