有段时间没更新了,最近又重新开始刷题,做到一个我觉得挺有意思的搜索题,刚开始做的时候,考虑不充分,还WA了好几发,后来重新审题思考了终于还是过了,记录下来作个教训了
题目
分析
思路
这道题对一般的走迷宫进行了一点改变。很明显我们需要搜索两次,一次是我们在不经过门的情况下能不能走到终点,还有一次是我们拿到钥匙以后经过门能不能到终点。这两次到终点的距离我们取最小值作为我们最终的答案。
代码
#include<iostream>
#include<algorithm>
#include<queue>
#include<string.h>
#define ll long long
#define mem(s,i) memset(s,i,sizeof(s))
#define INF 0x7fffffff
using namespace std;
const int N = 510;
int n, m;
int sx, sy, kx, ky, dx, dy, ex, ey;
struct node{
int x, y, step;
node(int x_, int y_, int step_){
x = x_;y = y_;step = step_;
};node(){};
};
int ds[2][4] = {{1,-1,0,0},{0,0,1,-1}};
char p[N][N];
int dist[N][N];
bool judge(int x, int y){
if(p[x][y] == 'W')return false;
return true;
}
void check_bfs(int x, int y, int stp){
node ans = {x, y, stp};
queue<node >q;
q.push(ans);
while(!q.empty()){
ans = q.front();
q.pop();
for(int i = 0;i < 4;i++){
int tx = ans.x + ds[0][i];
int ty = ans.y + ds[1][i];
if(judge(tx,ty)&&p[tx][ty]!='D'){
int len = ans.step + 1;
if(dist[tx][ty]&&len >= dist[tx][ty])continue;
dist[tx][ty] = len;
q.push({tx,ty,len});
}
}
}
}
void bfs(int x, int y, int stp){
node ans = {x, y, stp};
queue<node >q;
q.push(ans);
while(!q.empty()){
ans = q.front();
q.pop();
for(int i = 0;i < 4;i++){
int tx = ans.x + ds[0][i];
int ty = ans.y + ds[1][i];
if(judge(tx,ty)){
int len = ans.step + 1;
if(dist[tx][ty]&&len >= dist[tx][ty])continue;
dist[tx][ty] = len;
q.push({tx,ty,len});
}
}
}
}
void solve(){
cin>>n>>m;
for(int i = 1;i <= n;i++){
for(int j = 1;j <= m;j++){
cin>>p[i][j];
if(p[i][j] == 'S'){sx = i;sy = j;}
else if(p[i][j] == 'E'){ex = i;ey = j;}
else if(p[i][j] == 'K'){kx = i;ky = j;}
else if(p[i][j] == 'D'){dx = i;dy = j;}
}
}
mem(dist,0);
check_bfs(sx, sy, 0);
if(dist[kx][ky] == 0&&dist[ex][ey]==0){cout<<-1<<endl;return;}
int len = 0;
if(dist[ex][ey] != 0){
len = dist[ex][ey];
}
int len1 = dist[kx][ky];
mem(dist,0);
dist[kx][ky] = len1;
bfs(kx,ky,len1);
if(dist[ex][ey]==0)cout<<-1<<endl;
else {
cout<<min((len==0?INF:len),dist[ex][ey])<<endl;
}
}
int main(){
solve();
return 0;
}