50分DFS求助！

#include <bits/stdc++.h>

int n, m, t, sx, sy, fx, fy, gx, gy, zx, zy, zb[10][10] = {0}, fa = 0;
bool v[10][10] = {0};
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void d(int x, int y) {
	if (x == fx && y == fy) {
		fa++;
		return;
	}
	for (int i = 0; i < 4; i++) {
		gx = dx[i] + x;
		gy = dy[i] + y;
		if (gx > 0 && gx <= n && gy > 0 && gy <= m && zb[gx][gy] == 0 && v[gx][gy] == 0) {
			v[gx][gy] = 1;
			d(gx, gy);
			v[gx][gy] = 0;
		}
	}
}
int main() {
	scanf("%d %d %d", &n, &m, &t);
	scanf("%d %d %d %d ", &sx, &sy, &fx, &fy);
	v[sx][sy] = 1;
	for (int i = 0; i < t; i++) {
		scanf("%d %d", &zx, &zy);
		zb[zx][zy] = 1;
	}
	d(sx, sy);
	printf("%d", fa);
	return 0;
}