题解 | #走迷宫#
走迷宫
https://www.nowcoder.com/practice/e88b41dc6e764b2893bc4221777ffe64
```
#include <bits/stdc++.h>
using namespace std;
const int N=1010;
int n,m;
int x,y,x2,y2;
char pat[N][N];
int dt[N][N];
queue<pair<int,int>>dl;
int bfs()
{
dl.push({x,y});
while(!dl.empty())
{
auto t=dl.front();
dl.pop();
int a[]={0,1,0,-1},b[]={1,0,-1,0};
for(int i=0;i<4;i++)
{
int dx=t.first+a[i],dy=t.second+b[i];
if(dx>0&&dx<=n&&dy>0&&dy<=m&&pat[dx][dy]!='*')
{
dl.push({dx,dy});
pat[dx][dy]='*';
dt[dx][dy]=dt[t.first][t.second]+1;
}
}
}
return dt[x2][y2];
}
int main() {
cin>>n>>m;
cin>>x>>y>>x2>>y2;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
cin>>pat[i][j];
bfs()!=0?cout<<bfs():cout<<-1;
}