#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
const int N = 110;
typedef pair<int, int> PII;
int d[N][N];
int n, m;
int g[N][N];
int bfs(){
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
queue<PII> q;
q.push({0, 0});
d[0][0] = 0;
while (!q.empty())
{
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
&& g[x][y] == 0 && d[x][y] == -1){
d[x][y] = d[t.first][t.second] + 1;
q.push({x, y});
}
}
}
return d[n - 1][m - 1];
}
int main()
{
memset(d, -1, sizeof d);
cin >> n >> m;
for (int i = 0; i < n; i ++ )
{
for (int j = 0; j < m; j ++ )
cin >> g[i][j];
}
int res = bfs();
cout << res;
return 0;
}
算法基础课:走迷宫
最新推荐文章于 2024-10-11 16:56:17 发布