acwing844走迷宫,sdut走迷宫

两题问法不同，思路也不同，acwing844为款搜，sdut的为深搜

sdut 走迷宫

#include<bits/stdc++.h>
using namespace std;
const int N = 1e2 + 10;
const int inf = 0x3f3f3f3f;
int n, m;
int vis[N][N];
int mp[N][N];
int cnt;
void dfs(int x,int y)
{
	if (x<1 || y<1 || x>n || y>m || mp[x][y] || vis[x][y])
		return;
	if (x == n && y == m)
	{
		cnt++;
		return;
	}
	vis[x][y] = 1;//标记为正在遍历的状态
    //深搜上下左右四个方向
	dfs(x - 1, y);
	dfs(x + 1, y);
	dfs(x, y - 1);
	dfs(x, y + 1);
	vis[x][y] = 0;//深搜完毕恢复未遍历状态
}

int main()
{
	int T;
	cin >> T;
	while (T--)
	{
	    cnt = 0;
		cin >> n >> m;
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= m; j++)
				cin >> mp[i][j];
		dfs(1, 1);
		cout << cnt << endl;
	}
	return 0;
}

bfs两种代码

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 1e2 + 10;
typedef pair<int, int>PII;
int n, m;
PII p[N * N];//开两倍空间
int g[N][N], d[N][N];

int bfs()
{
    int in = 0, out = 0;
    int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };//标记四个方向的坐标
    memset(d, -1, sizeof(d));
    d[0][0] = 0;
    p[in++] = { 0,0 };
    while (in>out)
    {
        auto t = p[out++];
        for (int i = 0; i < 4; i++)//for循环遍历四个方向
        {
            int x = t.first + dx[i], y = t.second + dy[i];
            if (x >= 0 && x < n && y >= 0 && y < m && d[x][y] == -1 && g[x][y] == 0)
            {
                d[x][y] = d[t.first][t.second] + 1;
                p[in++] = { x,y };
            }
        }
    }
    return d[n - 1][m - 1];
}

int main()
{
    cin >> n >> m;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            cin >> g[i][j];
        }
    }
    cout << bfs() << endl;
    return 0;
}

#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
const int N = 1e2 + 10;
typedef pair<int, int>PII;
int n, m;
queue<PII>q;
int g[N][N], d[N][N];

int bfs()
{
    int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
    memset(d, -1, sizeof(d));
    d[0][0] = 0;
    q.push({ 0,0 });
    while (q.size())
    {
        auto t =q.front();
        q.pop();
        for (int i = 0; i < 4; i++)
        {
            int x = t.first + dx[i], y = t.second + dy[i];
            if (x >= 0 && x < n && y >= 0 && y < m && d[x][y] == -1 && g[x][y] == 0)
            //判断位置是否越界，并且必须是未遍历且可达的点
            {
                d[x][y] = d[t.first][t.second] + 1;
                q.push({ x,y });//拓展队列
            }
        }
    }
    return d[n - 1][m - 1];
}

int main()
{
    cin >> n >> m;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            cin >> g[i][j];//建图
        }
    }
    cout << bfs() << endl;
    return 0;
}