救援
题解:
BFS/DFS板题(虽然我倾向于DFS,但还是写了BFS)
代码:
#include<bits/stdc++.h>
#define SIZE 1000
using namespace std;
queue<int> q_x, q_y, q_pos;
int step[4][2] = {
{1,0},{0,1},{-1,0},{0,-1}
};
int m,n,board[SIZE][SIZE],sx,sy,fx,fy;
bool vis[SIZE][SIZE];
void bfs(){
bool flag = false;
while (!q_x.empty() && !q_y.empty()){
for (int k = 0; k < 4;++k) {
int tx = q_x.front() + step[k][0];
int ty = q_y.front() + step[k][1];
if (tx < 1 || ty < 1 || tx > n || ty > m) continue;
if (!board[tx][ty] && !vis[tx][ty]) {
vis[tx][ty] = true;
q_x.push(tx);
q_y.push(ty);
q_pos.push(q_pos.front() + 1);
}
if (tx == fx&&ty == fy) {
flag = true;
break;
}
}
if (flag) break;
q_x.pop();
q_y.pop();
q_pos.pop();
}
return;
}
int main()
{
scanf("%d%d",&m,&n);
for (int i = 1; i <= m; ++i) {
for (int j = 1; j <= n; ++j) {
scanf("%d",&board[i][j])
}
}
scanf("%d%d%d%d",sx,sy,fx,fy);
q_x.push(sx);
q_y.push(sy);
q_pos.push(0);
vis[sx][sy] = true;
bfs();
printf("%d",q_pos.back);
return 0;
}