Submission #994711
Source Code Expand
// {{{ by shik
#include <bits/stdc++.h>
#include <unistd.h>
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x),end(x)
#define REP(i,n) for ( int i=0; i<int(n); i++ )
#define REP1(i,a,b) for ( int i=(a); i<=int(b); i++ )
#define FOR(it,c) for ( auto it=(c).begin(); it!=(c).end(); it++ )
#define MP make_pair
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
typedef vector<int> VI;
#ifdef SHIK
template<typename T>
void _dump( const char* s, T&& head ) { cerr<<s<<"="<<head<<endl; }
template<typename T, typename... Args>
void _dump( const char* s, T&& head, Args&&... tail ) {
int c=0;
while ( *s!=',' || c!=0 ) {
if ( *s=='(' || *s=='[' || *s=='{' ) c++;
if ( *s==')' || *s==']' || *s=='}' ) c--;
cerr<<*s++;
}
cerr<<"="<<head<<", ";
_dump(s+1,tail...);
}
#define dump(...) do { \
fprintf(stderr, "%s:%d - ", __PRETTY_FUNCTION__, __LINE__); \
_dump(#__VA_ARGS__, __VA_ARGS__); \
} while (0)
template<typename Iter>
ostream& _out( ostream &s, Iter b, Iter e ) {
s<<"[";
for ( auto it=b; it!=e; it++ ) s<<(it==b?"":" ")<<*it;
s<<"]";
return s;
}
template<typename A, typename B>
ostream& operator <<( ostream &s, const pair<A,B> &p ) { return s<<"("<<p.first<<","<<p.second<<")"; }
template<typename T>
ostream& operator <<( ostream &s, const vector<T> &c ) { return _out(s,ALL(c)); }
template<typename T, size_t N>
ostream& operator <<( ostream &s, const array<T,N> &c ) { return _out(s,ALL(c)); }
template<typename T>
ostream& operator <<( ostream &s, const set<T> &c ) { return _out(s,ALL(c)); }
template<typename A, typename B>
ostream& operator <<( ostream &s, const map<A,B> &c ) { return _out(s,ALL(c)); }
#else
#define dump(...)
#endif
template<typename T>
void _R( T &x ) { cin>>x; }
void _R( int &x ) { scanf("%d",&x); }
void _R( long long &x ) { scanf("%" PRId64,&x); }
void _R( double &x ) { scanf("%lf",&x); }
void _R( char &x ) { scanf(" %c",&x); }
void _R( char *x ) { scanf("%s",x); }
void R() {}
template<typename T, typename... U>
void R( T& head, U&... tail ) {
_R(head);
R(tail...);
}
template<typename T>
void _W( const T &x ) { cout<<x; }
void _W( const int &x ) { printf("%d",x); }
template<typename T>
void _W( const vector<T> &x ) {
for ( auto i=x.cbegin(); i!=x.cend(); i++ ) {
if ( i!=x.cbegin() ) putchar(' ');
_W(*i);
}
}
void W() {}
template<typename T, typename... U>
void W( const T& head, const U&... tail ) {
_W(head);
putchar(sizeof...(tail)?' ':'\n');
W(tail...);
}
#ifdef SHIK
#define FILEIO(...)
#else
#define FILEIO(name) do {\
freopen(name ".in","r",stdin); \
freopen(name ".out","w",stdout); \
} while (0)
#endif
// }}}
const int N=217;
const LL MOD=1e9+7;
const LL INV2=(MOD+1)/2;
const LL fac[5]={0,1,2,6,24};
int n,m;
char s[N][N];
int main() {
R(n,m);
REP(i,n) R(s[i]);
LL ans=1;
bool flag=0;
REP(x,n/2) REP(y,m/2) {
char t[4]={s[x][y],s[n-x-1][y],s[x][m-y-1],s[n-x-1][m-y-1]};
bool vis[4]={};
LL now=24;
REP(i,4) if ( !vis[i] ) {
int c=0;
REP(j,4) if ( t[i]==t[j] ) {
c++;
vis[j]=1;
}
now/=fac[c];
}
// dump(x,y,now);
if ( now!=24 ) flag=1;
ans=ans*now%MOD;
}
if ( !flag && n>=4 && m>=4 ) ans=ans*INV2%MOD;
if ( n%2==1 ) {
bool d=0;
REP(i,m) if ( s[n/2][i]!=s[n/2][m-i-1] ) d=1;
if ( d ) ans=ans*2%MOD;
}
if ( m%2==1 ) {
bool d=0;
REP(i,n) if ( s[i][m/2]!=s[n-i-1][m/2] ) d=1;
if ( d ) ans=ans*2%MOD;
}
W(ans);
return 0;
}
Submission Info
Submission Time
2016-11-26 15:10:40+0900
Task
I - Reverse Grid
User
shik
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
3837 Byte
Status
WA
Exec Time
3 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘void _R(long long int&)’:
./Main.cpp:62:46: warning: format ‘%ld’ expects argument of type ‘long int*’, but argument 2 has type ‘long long int*’ [-Wformat=]
void _R( long long &x ) { scanf("%" PRId64,&x); }
^
./Main.cpp: In function ‘void _R(int&)’:
./Main.cpp:61:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
void _R( int &x ) { scanf("%d",&x); }
^
./Main.cpp: In function ‘void _R(long long int&)’:
./Main.cpp:62:47: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
void _R( long long &x ) { scanf("%" PRId64,&x); }
^
./Main.cpp: In function ‘void _R(double&)’:
./Main.cpp:63:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-resu...
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
AC
2 ms
256 KB
01-09.txt
AC
2 ms
256 KB
01-10.txt
AC
2 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
WA
2 ms
256 KB
01-15.txt
WA
2 ms
256 KB
01-16.txt
WA
3 ms
256 KB
01-17.txt
WA
3 ms
256 KB
01-18.txt
WA
3 ms
256 KB
01-19.txt
WA
3 ms
256 KB
01-20.txt
WA
3 ms
256 KB
01-21.txt
WA
3 ms
256 KB
01-22.txt
WA
2 ms
256 KB
01-23.txt
WA
3 ms
256 KB
01-24.txt
WA
3 ms
256 KB
01-25.txt
WA
3 ms
256 KB
01-26.txt
WA
3 ms
256 KB
01-27.txt
WA
2 ms
256 KB
01-28.txt
WA
2 ms
256 KB
01-29.txt
AC
2 ms
256 KB
01-30.txt
WA
2 ms
256 KB
01-31.txt
WA
3 ms
256 KB
01-32.txt
WA
3 ms
256 KB
01-33.txt
WA
3 ms
256 KB
01-34.txt
WA
3 ms
256 KB
01-35.txt
WA
3 ms
256 KB
sample-01.txt
AC
2 ms
256 KB
sample-02.txt
AC
2 ms
256 KB