3
2024-02-22 11:12:53
发布于:浙江
#include<bits/stdc++.h>
using namespace std;
int n,a[105][105];
bool vis[105][105];
int dir[8][2]={{0,1},{0,-1},{1,-1},{1,1},{1,0},{-1,0},{-1,1},{-1,-1}};
struct node{
int x;
int y;
int step;
};
void bfs(){
queue <node> q;
q.push({1,1,1});
vis[1][1]=1;
while(!q.empty()){
int x=q.front().x;
int y=q.front().y;
int num=q.front().step;
q.pop();
if(x==n&&y==n){
cout<<num;
return;
}
for(int i=0;i<8;i++){
int ax=x+dir[i][0];
int ay=y+dir[i][1];
if(ax>=1&&ax<=n&&ay>=1&&ay<=n&&!vis[ax][ay]&a[ax][ay]==0){
vis[ax][ay]=1;
q.push({ax,ay,num+1});
}
}
}
cout<<"-1";
}
int main(){
freopen("min.in","r",stdin);
freopen("min.out","w",stdout);
cin>>n;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
cin>>a[i][j];
}}
if(a[1][1]==1||a[n][n]==1){
cout<<-1;
return 0;
}
bfs();
fclose(stdin);
fclose(stdout);
return 0;
}
这里空空如也
有帮助,赞一个