AcWing 844. 走迷宫
原题链接
简单
作者:
EXCUTER
,
2021-05-21 18:30:49
,
所有人可见
,
阅读 202
#include <iostream>
#include <queue>
#include <cstring>
using namespace std;
typedef pair<int, int> PII;
const int N = 110;
int n, m;
int g[N][N];
int d[N][N];
queue<PII> q;
int dx[4] = {-1, 0, 0, 1}, dy[4] = {0, -1, 1, 0};
int bfs()
{
q.push({0, 0});
memset(d, -1, sizeof d);
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 && 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();
return 0;
}