@[duminghao123](/user/1120480)
看看我的（易懂）
```#include<bits/stdc++.h>
using namespace std;
int ans=0,n,x2,y2,x3,y3,aa[1010][1010];
bool bb[1010][1010];
int px[5]={0,-1,0,1,0};
int py[5]={0,0,1,0,-1};
struct ai{
int x,y;
};
queue <ai> q;
void bfs(int x,int y){
int u,v;
bb[x][y]=1;
ai a;
a.x=x,a.y=y;
q.push(a);
int x2,y2;
while(!q.empty()){
x2=q.front().x,y2=q.front().y;
q.pop();
for(int i=1;i<=4;i++){
int u=x2+px[i],v=y2+py[i];
if(u>=1 && u<=n && v>=1 && v<=n && bb[u][v]==0){
aa[u][v]=aa[x2][y2]+1;
bb[u][v]=1;
ai b;
b.x=u,b.y=v;
q.push(b);
}
}
}
}
int main(){
cin>>n;
char c;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
cin>>c;
if(c=='1'){
aa[i][j]=-1;
bb[i][j]=1;
}
}
}
cin>>x2>>y2>>x3>>y3;
bfs(x2,y2);
cout<<aa[x3][y3];
return 0;
}```
by haimingbei @ 2024-08-10 17:02:33
已解决，非常感谢！
by duminghao123 @ 2024-08-10 17:05:47