1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
| #include<bits/stdc++.h>
using namespace std;
#define int long long
const int MAXn = 12;
const int MAXm = 12;
const int MAXcntsta = 5e4;
const int MOD = 1009;
template <typename T>
inline void read(T &a) {
char c;for (c = getchar(); (c < '0' || c > '9') && c != '-'; c = getchar());bool f = c == '-';T x = f ? 0 : (c ^ '0');for (c = getchar(); c >= '0' && c <= '9'; c = getchar()) {x = x * 10 + (c ^ '0');}a = f ? -x : x;
}
template <typename T, typename ...Argv>
inline void read(T &a, Argv &...argv) {
read(a), read(argv...);
}
vector<pair<int, int>> hx[2][MOD + 10];
inline void Clear(int idx) {
for (int i = 0; i < MOD; ++i) {
hx[idx][i].clear();
}
}
inline void Add(int idx, int k, int v) {
int hxk = k % MOD;
for (auto i = begin(hx[idx][hxk]), topi = end(hx[idx][hxk]); i != topi; ++i) {
if ((*i).first == k) {
(*i).second += v;
return;
}
}
hx[idx][hxk].push_back(make_pair(k, v));
}
inline int deg(int num, int deg) {
return (num >> (deg << 1)) & 3;
}
inline int assdeg(int num, int deg, int val) {
return (num & ~(3 << (deg << 1))) | (val << (deg << 1));
}
int n, m, ans; char a[MAXn + 10][MAXm + 10];
signed main() {
read(n, m);
for (int i = 1; i <= n; ++i) {
scanf("%s", a[i] + 1);
}
int begini, beginj, endi, endj;
bool ok = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
if (a[i][j] == '.') {
begini = i, beginj = j;
ok = 1;
break;
}
}
if (ok) break;
}
ok = 0;
for (int i = n; i; --i) {
for (int j = m; j; --j) {
if (a[i][j] == '.') {
endi = i, endj = j;
ok = 1;
break;
}
}
if (ok) break;
}
for (int i = begini; i <= n; ++i) {
for (int j = (i == begini) ? beginj : 1; j <= m; ++j) {
int now = ((i - 1) * m + j) & 1, last = now ^ 1;
int x = j - 1, y = j;
if (i == begini && j == beginj) Add(last, 0, 1);
Clear(now);
for (int k = 0; k < MOD; ++k) {
if (hx[last][k].empty()) continue;
for (auto l = begin(hx[last][k]), topl = end(hx[last][k]); l != topl; ++l) {
int sta = (*l).first, val = (*l).second;
if (!val) continue;
int degx = deg(sta, x), degy = deg(sta, y);
if (a[i][j] == '*') {
if (degx == 0 && degy == 0) Add(now, sta, val);
} else {
if (degx == 0 && degy == 0) {
if (i != n && j != m) Add(now, assdeg(assdeg(sta, x, 1), y, 2), val);
} else if (degx && degy == 0) {
if (i != n) Add(now, sta, val);
if (j != m) Add(now, assdeg(assdeg(sta, x, 0), y, degx), val);
} else if (degx == 0 && degy) {
if (i != n) Add(now, assdeg(assdeg(sta, x, degy), y, 0), val);
if (j != m) Add(now, sta, val);
} else if (degx == 1 && degy == 1) {
int tmpsta = sta;
tmpsta = assdeg(assdeg(tmpsta, x, 0), y, 0);
for (int o = y + 1, cnt = 1; ; ++o) {
int dego = deg(tmpsta, o);
if (dego == 1) ++cnt;
else if (dego == 2) --cnt;
if (!cnt) {
tmpsta = assdeg(tmpsta, o, 1);
break;
}
}
Add(now, tmpsta, val);
} else if (degx == 2 && degy == 2) {
int tmpsta = sta;
tmpsta = assdeg(assdeg(tmpsta, x, 0), y, 0);
for (int o = x - 1, cnt = 1; ; --o) {
int dego = deg(tmpsta, o);
if (dego == 1) --cnt;
else if (dego == 2) ++cnt;
if (!cnt) {
tmpsta = assdeg(tmpsta, o, 2);
break;
}
}
Add(now, tmpsta, val);
} else if (degx == 2 && degy == 1) {
Add(now, assdeg(assdeg(sta, x, 0), y, 0), val);
} else if (i == endi && j == endj) {
if (!assdeg(assdeg(sta, x, 0), y, 0)) ans += val;
}
}
}
}
if (j == m) {
for (int k = 0; k < MOD; ++k) {
if (hx[now][k].empty()) continue;
for (auto l = begin(hx[now][k]), topl = end(hx[now][k]); l != topl; ++l) {
(*l).first <<= 2;
}
}
}
}
}
printf("%lld\n", ans);
return 0;
}
|
