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
| #include <iostream>
#include <cstring>
#define PII pair<int, int>
#define x first
#define y second
using namespace std;
const int N = 11;
int st[N][N];
int res;
int dx[] = {1, -1, 2, -2, -1, 1, -2, 2};
int dy[] = {2, -2, 1, -1, 2, -2, 1, -1};
void dfs(int n, int m, PII p, int cnt)
{
if (cnt == n * m)
{
res ++;
return;
}
st[p.x][p.y] = true;
for (int i = 0; i < 8; ++i)
{
int x = p.x + dx[i], y = p.y + dy[i];
if (x < 0 || y < 0 || x >= n || y >= m || st[x][y]) continue;
dfs(n, m, {x, y}, cnt + 1);
}
st[p.x][p.y] = false;
}
int main()
{
int k, n, m;
PII start;
cin >> k;
while(k--)
{
res = 0;
cin >> n >> m >> start.x >> start.y;
dfs(n, m, start, 1);
cout << res << '\n';
}
}
|