Submission #5693616
Source Code Expand
#include<bitset>
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)
template<class T> inline void amin(T &x, const T &y) { if (y<x) x=y; }
template<class T> inline void amax(T &x, const T &y) { if (x<y) x=y; }
template<class Iter> void rprintf(const char *fmt, Iter begin, Iter end) {
for (bool sp=0; begin!=end; ++begin) { if (sp) putchar(' '); else sp = true; printf(fmt, *begin); }
putchar('\n');
}
template<unsigned MOD_> struct ModInt {
static const unsigned MOD = MOD_;
unsigned x;
void undef() { x = (unsigned)-1; }
bool isnan() const { return x == (unsigned)-1; }
inline int geti() const { return (int)x; }
ModInt() { x = 0; }
ModInt(const ModInt &y) { x = y.x; }
ModInt(int y) { if (y<0 || (int)MOD<=y) y %= (int)MOD; if (y<0) y += MOD; x=y; }
ModInt(unsigned y) { if (MOD<=y) x = y % MOD; else x = y; }
ModInt(long long y) { if (y<0 || MOD<=y) y %= MOD; if (y<0) y += MOD; x=y; }
ModInt(unsigned long long y) { if (MOD<=y) x = y % MOD; else x = y; }
ModInt &operator+=(const ModInt y) { if ((x += y.x) >= MOD) x -= MOD; return *this; }
ModInt &operator-=(const ModInt y) { if ((x -= y.x) & (1u<<31)) x += MOD; return *this; }
ModInt &operator*=(const ModInt y) { x = (unsigned long long)x * y.x % MOD; return *this; }
ModInt &operator/=(const ModInt y) { x = (unsigned long long)x * y.inv().x % MOD; return *this; }
ModInt operator-() const { return (x ? MOD-x: 0); }
ModInt inv() const { return pow(MOD-2); }
ModInt pow(long long y) const {
ModInt b = *this, r = 1;
if (y < 0) { b = b.inv(); y = -y; }
for (; y; y>>=1) {
if (y&1) r *= b;
b *= b;
}
return r;
}
ModInt extgcd() const {
unsigned a = MOD, b = x; int u = 0, v = 1;
while (b) {
int t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
if (u < 0) u += MOD;
return ModInt(u);
}
friend ModInt operator+(ModInt x, const ModInt y) { return x += y; }
friend ModInt operator-(ModInt x, const ModInt y) { return x -= y; }
friend ModInt operator*(ModInt x, const ModInt y) { return x *= y; }
friend ModInt operator/(ModInt x, const ModInt y) { return x *= y.inv(); }
friend bool operator<(const ModInt x, const ModInt y) { return x.x < y.x; }
friend bool operator==(const ModInt x, const ModInt y) { return x.x == y.x; }
friend bool operator!=(const ModInt x, const ModInt y) { return x.x != y.x; }
};
const LL MOD = 1000000007;
//const LL MOD = 998244353;
typedef ModInt<MOD> Mint;
const int SIZE = 10800;
using Bits = bitset<SIZE>;
int H, W;
char S[211][211];
Bits B[SIZE];
void add(Bits b) {
REP (i, SIZE) if (b.test(i)) {
if (B[i].test(i)) {
b ^= B[i];
} else {
B[i] = b;
return;
}
}
}
void MAIN() {
scanf("%d%d", &H, &W);
REP (i, H) scanf("%s", S[i]);
Mint ans = 1;
if (H % 2) {
string g = S[H/2];
reverse(g.begin(), g.end());
if (S[H/2] != g) ans *= 2;
for (int i=H/2; i<H; i++) REP (j, W) S[i][j] = S[i+1][j];
H--;
}
if (W % 2) {
string g;
REP (i, H) g.push_back(S[i][W/2]);
string h = g;
reverse(g.begin(), g.end());
if (g != h) ans *= 2;
REP (i, H) for (int j=W/2; j<W; j++) S[i][j] = S[i][j+1];
W--;
}
REP (i, H/2) REP (j, W/2) {
int row[] = {i, H-1-i};
int col[] = {j, W-1-j};
string g;
REP (a, 2) REP (b, 2) g.push_back(S[row[a]][col[b]]);
sort(g.begin(), g.end());
if (g[0] != g[1] && g[1] != g[2] && g[2] != g[3]) { // 1 1 1 1;
ans *= 12;
} else {
if (g[0] == g[3]) { // 4;
// nope;
} else if (g[0] == g[2] || g[1] == g[3]) { // 1 3;
ans *= 4;
} else if (g[0] == g[1] && g[2] == g[3]) { // 2 2;
ans *= 6;
} else { // 1 1 2;
ans *= 12;
}
REP (a, 2) REP (b, 2) S[row[a]][col[b]] = '.';
}
}
REP (i, H/2) {
Bits b;
REP (j, W/2) if (S[i][j] != '.') b.set(i*(W/2)+j);
add(b);
}
REP (j, W/2) {
Bits b;
REP (i, H/2) if (S[i][j] != '.') b.set(i*(W/2)+j);
add(b);
}
REP (i, SIZE) if (B[i].test(i)) ans += ans;
printf("%d\n", ans.geti());
}
int main() {
int TC = 1;
// scanf("%d", &TC);
REP (tc, TC) MAIN();
return 0;
}
Submission Info
Submission Time |
|
Task |
I - Reverse Grid |
User |
natsugiri |
Language |
C++14 (GCC 5.4.1) |
Score |
1900 |
Code Size |
4728 Byte |
Status |
AC |
Exec Time |
7 ms |
Memory |
11008 KB |
Compile Error
./Main.cpp: In function ‘void MAIN()’:
./Main.cpp:103:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &H, &W);
^
./Main.cpp:104:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
REP (i, H) scanf("%s", S[i]);
^
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 |
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 |
3 ms |
256 KB |
01-07.txt |
AC |
3 ms |
256 KB |
01-08.txt |
AC |
3 ms |
256 KB |
01-09.txt |
AC |
3 ms |
256 KB |
01-10.txt |
AC |
6 ms |
256 KB |
01-11.txt |
AC |
5 ms |
256 KB |
01-12.txt |
AC |
6 ms |
256 KB |
01-13.txt |
AC |
5 ms |
256 KB |
01-14.txt |
AC |
3 ms |
2560 KB |
01-15.txt |
AC |
2 ms |
2688 KB |
01-16.txt |
AC |
6 ms |
10880 KB |
01-17.txt |
AC |
6 ms |
10880 KB |
01-18.txt |
AC |
6 ms |
10880 KB |
01-19.txt |
AC |
7 ms |
11008 KB |
01-20.txt |
AC |
7 ms |
11008 KB |
01-21.txt |
AC |
7 ms |
11008 KB |
01-22.txt |
AC |
2 ms |
384 KB |
01-23.txt |
AC |
4 ms |
6784 KB |
01-24.txt |
AC |
6 ms |
11008 KB |
01-25.txt |
AC |
6 ms |
11008 KB |
01-26.txt |
AC |
7 ms |
11008 KB |
01-27.txt |
AC |
2 ms |
512 KB |
01-28.txt |
AC |
2 ms |
512 KB |
01-29.txt |
AC |
2 ms |
384 KB |
01-30.txt |
AC |
3 ms |
2560 KB |
01-31.txt |
AC |
6 ms |
10752 KB |
01-32.txt |
AC |
6 ms |
10752 KB |
01-33.txt |
AC |
6 ms |
10880 KB |
01-34.txt |
AC |
6 ms |
10880 KB |
01-35.txt |
AC |
6 ms |
10880 KB |
sample-01.txt |
AC |
2 ms |
256 KB |
sample-02.txt |
AC |
2 ms |
256 KB |