洛谷p1065迷宫-dfs

https://www.luogu.com.cn/problem/P1605
求一个点到另一个点的所有路线

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <iomanip>
using namespace std;

int map[7][7];
int vis[7][7];
int n, m, t;
int sx, sy, fx, fy, times;
int xx[] = { -1,1,0,0 };
int yy[] = { 0,0,-1,1 };

void dfs(int x, int y) {
	if (x == fx && y == fy) {
		times++;
		return;
	}
	for (int i = 0; i < 4; i++) {
		int dx = x + xx[i];
		int dy = y + yy[i];
		if (dx > 0 && dx <= n && dy > 0 && dy <= m && !vis[dx][dy] && !map[dx][dy]) {
			vis[dx][dy] = 1;
			dfs(dx, dy);
			vis[dx][dy] = 0;
		}
	}
}

int main() {
#ifdef ONLINE_JUDGE
#else
	freopen("1.txt", "r", stdin);
#endif // ONLINE_JUDGE
	cin >> n >> m >> t;
	cin >> sx >> sy >> fx >> fy;
	int x, y;
	for (int i = 0; i < t; i++) {
		cin >> x >> y;
		map[x][y] = 1;
	}
	vis[sx][sy] = 1;
	dfs(sx, sy);
	cout << times << endl;
	return 0;
}