UVA 532 - Dungeon Master

来源：互联网发布：淘宝个人尺码设置在哪编辑：程序博客网时间：2024/05/18 03:01

六个方向的广搜

#include <iostream>#include <memory.h>#include <queue>using namespace std;struct point{int i,j,z;point(int ii=0,int jj=0,int zz=0):i(ii),j(jj),z(zz){}};int L,R,C;int tl,tr,tc;char dung[31][31][31];char vis[31][31][31];int d[6][3]={{-1,0,0},{1,0,0},{0,-1,0},{0,1,0},{0,0,-1},{0,0,1}};int dis[31][31][31];void bfs(int i,int j,int z){queue<point> q;q.push(point(i,j,z));vis[z][i][j]=1;while (!q.empty()){point p=q.front();q.pop();for (int i=0;i<6;++i)//traverse six direction {int nz=p.z+d[i][2],ni=p.i+d[i][0],nj=p.j+d[i][1];if(nz>=0&&nz<L&&ni>=0&&ni<R&&nj>=0&&nj<C&&!vis[nz][ni][nj]&&dung[nz][ni][nj]!='#'){//border conditionq.push(point(ni,nj,nz));vis[nz][ni][nj]=1;dis[nz][ni][nj]=dis[p.z][p.i][p.j]+1;if(nz==tl&&ni==tr&&nj==tc)return;//found the exit}}}}int main(){while (1){cin>>L>>R>>C;if(L==0&&R==0&&C==0)break;memset(dung,0,sizeof(dung));memset(vis,0,sizeof(vis));memset(dis,0,sizeof(dis));int i,sz,si,sj;for (i=0;i<L;++i){for (int j=0;j<R;++j){for (int k=0;k<C;++k){cin>>dung[i][j][k];if(dung[i][j][k]=='S'){sz=i;si=j;sj=k;}else if(dung[i][j][k]=='E'){tl=i;tr=j;tc=k;}}}}bfs(si,sj,sz);if(dis[tl][tr][tc]){cout<<"Escaped in "<<dis[tl][tr][tc]<<" minute(s)."<<endl;}else{cout<<"Trapped!"<<endl;}}return 0;}