90分 #6这个点wa了， 求大佬看看0.0

#include <iostream>

using namespace std;

const int N = 15;

int n, m, t, x1, x2, y1, y2;
int g[N][N];
bool st[N][N];
int sum;

void dfs(int x, int y)
{
	if(x == x2 && y == y2)
	{
		sum++;
		return;
	}
	else
	{
		int dx[4] = {1, 0, -1, 0}, dy[4] = {0, -1, 0, 1};
		for(int i = 0; i < 4; i++)
		{
			if(x >= 1 && x <= n && y >= 1 && y <= m && g[x][y] == 0 && !st[x][y])
			{
				st[x][y] = true;
				dfs(x + dx[i], y + dy[i]);
				st[x][y] = false;
			}
		}
	}
}

int main()
{
	cin >> n >> m >> t;
	cin >> x1 >> y1 >> x2 >> y2;
	for(int i = 1; i <= n; i++)
		for(int j= 1; j <= m; j++)
			g[i][j] = 0;
	while(t--)
	{
		int a, b;
		cin >> a >> b;
		g[a][b] = 1;
	}
	dfs(x1, y1);
	cout << sum << endl;
	return 0;
}