试题D: 迷宫 5
第十届蓝桥杯大赛软件类省赛 C/C++ 大学 A 组 10100000101000100110101010111110011000010000111010 00111000001010100001100010000001000101001100001001 11000110100001110010001001010101010101010001101000 00010000100100000101001010101110100010101010000101 11100100101001001000010000010101010100100100010100 00000010000000101011001111010001100000101010100011 10101010011100001000011000010110011110110100001000 10101010100001101010100101000010100000111011101001 10000000101100010000101100101101001011100000000100 10101001000000010100100001000100000100011110101001 00101001010101101001010100011010101101110000110101 11001010000100001100000010100101000001000111000010 00001000110000110101101000000100101001001000011101 10100101000101000000001110110010110101101010100001 00101000010000110101010000100010001001000100010101 10100001000110010001000010101001010101011111010010 00000100101000000110010100101001000001000000000010 11010000001001110111001001000011101001011011101000 00000110100010001000100000001000011101000000110011 10101000101000100010001111100010101001010000001000 10000010100101001010110000000100101010001011101000 00111100001000010000000110111000000001000000001011 10000001100111010111010001000110111010101101111000
【答案提交】
这是一道结果填空的题,你只需要算出结果后提交即可。本题的结果为一 个字符串,包含四种字母 D、U、L、R,在提交答案时只填写这个字符串,填 写多余的内容将无法得分。
思路:
本题与普通的BFS相比有不同点:
1.你要输出走到终点的路径。
首先我们要用dist[] [ ]数组来存储当前点到终点需要走多少步。然后我们需要从起点开始寻找到终点的最短路径,当前节点x,y走到下一个节点dx,dy的时候我们要判断 dist x y =dist dx dy +1 只有满足此条件的时候才能向下遍历
注意一定要把拼图用char数组或者string存储起来,用int数组存储不知道为什么不行- -
#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<queue>
using namespace std;
typedef pair<int,int>PII;
int n,m;
char ct[55][55];
int dist[55][55];
int dx[4]={1,0,0,-1};
int dy[4]={0,-1,1,0};
void bfs(PII start){
queue<PII>q;
memset(dist,-1,sizeof(dist));
dist[start.first][start.second]=0;
q.push(start);
while(q.size()){
auto t=q.front();
q.pop();
for(int i=0;i<4;i++){
int x=t.first+dx[i];
int y=t.second+dy[i];
if(x>=0 && x<n && y>=0 && y<m && dist[x][y]==-1 && ct[x][y]=='0'){
dist[x][y]=dist[t.first][t.second]+1;
q.push({x,y});
}
}
}
}
int main(){
cin>>n>>m;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>ct[i][j];
}
}
PII start,end;
start={n-1,m-1};
bfs(start);
cout<<dist[0][0];
string res;
int x=0;
int y=0;
char dir[4]={'D','L','R','U'};
while(x!=n-1 || y!=m-1){
for(int i=0;i<4;i++){
int nx=x+dx[i];
int ny=y+dy[i];
if(nx>=0 && nx<n && ny>=0 && ny<m && ct[nx][ny]=='0'){
if(dist[x][y]==1+dist[nx][ny]){
x=nx;
y=ny;
res+=dir[i];
break;
}
}
}
}
cout<<res;
}