#include #include using namespace std; int n, m, ans; int map[105][105]; int vis[105][105]; struct PII { int x; int y; }; PII first, last,now; queue q; int dx[4] = { 0,1,-1,0 }; int dy[4] = { 1,0,0,-1 }; int pd(int x, int y) { if (x<1 || x>n || y<1 || y>m || map[x][y] != 1 || vis[x][y] > 0) return 0; else return 1; } int chcek(int x, int y) { if (x == last.x && y == last.y) { ans = vis[x][y] ; return 1; } else return 0; } void bfs() { while (!q.empty()) { now = q.front(); q.pop(); if (chcek(now.x, now.y))return; for (int i = 0; i < 4; i++) { int nowx = now.x + dx[i]; int nowy = now.y + dy[i]; if (pd(nowx, nowy)) { q.push({ nowx,nowy }); vis[nowx][nowy] = vis[now.x][now.y] + 1; } } } } int main() { cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) cin >> map[i][j]; cin >> first.x >> first.y >> last.x >> last.y; q.push(first); vis[first.x][first.y] = 1; bfs(); cout << ans - 1; } //#include #include using namespace std; int map[105][105];int vis[105][105];int n,m,ans; struct PII {int x;int y;}; PII tempair,last; int dx[4]={0,1,-1,0};int dy[4]={1,0,0,-1}; queue q; int chcek(int x,int y) { if(x==last.x&&y==last.y){ans=vis[x][y];return 1;} return 0; } int pd(int x,int y) { if(x<1||x>n||y<1||y>m||vis[x][y]!=0||map[x][y]==0)return 0; return 1; } void BFS() { while(!q.empty()) { tempair=q.front();q.pop();int x=tempair.x;int y=tempair.y; if(chcek(x,y))return; for(int i=0;i<4;i++) { int nextx=x+dx[i];int nexty=y+dy[i]; if(pd(nextx,nexty)){q.push({nextx,nexty});vis[nextx][nexty]=vis[x][y]+1;} } } } int main() { cin>>n>>m; for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) cin>>map[i][j]; cin>>tempair.x>>tempair.y>>last.x>>last.y; q.push(tempair);vis[tempair.x][tempair.y]=1; BFS(); cout<

“15 届蓝桥杯 14 天省赛冲刺营 1 期”实验报告