1
2023-07-27 15:40:52
发布于:河北
#include <iostream>
#include <set>
#include <algorithm>
#include <queue>
using namespace std;
char a[30][30];
int vis[30][30];
int n, m, sx, sy, fx, fy;
int dir[4][2] = {-1, 0, 1, 0, 0, -1, 0, 1};
struct node{
int x, y, d;
};
void bfs(int x, int y){
queue<node> q;
q.push({x, y, 0});
vis[x][y] = 1;
while(!q.empty()){
node t = q.front();
q.pop();
for(int i = 0; i < 4; i++){
int nx = t.x + dir[i][0];
int ny = t.y + dir[i][1];
int nc = t.d + 1;
if(nx >= 1 && nx <= n && ny >= 1 && ny <= m && a[nx][ny] != '#'){
if(isdigit(a[nx][ny])) nc += a[nx][ny] - '0';
if(!vis[nx][ny] || nc < vis[nx][ny]) {
q.push({nx, ny, nc});
vis[nx][ny] = nc;
}
}
}
}
}
int main(int argc, char* argv[]) {
cin >> n >> m;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
cin >> a[i][j];
if(a[i][j] == 'Z') sx = i, sy = j;
if(a[i][j] == 'W') fx = i, fy = j;
}
}
if(sx == fx && sy == fy) {
cout << 0;
return 0;
}
bfs(sx, sy);
if(vis[fx][fy]){
cout << vis[fx][fy];
} else{
cout << "IMPOSSIBLE";
}
return 0;
}
这里空空如也
有帮助,赞一个