0.8poj2252(bfs三维)

http://poj.org/problem?id=2251

Dungeon Master
Time Limit: 1000MSMemory Limit: 65536K
Total Submissions: 11887Accepted: 4605

Description

You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one unit north, south, east, west, up or down. You cannot move diagonally and the maze is surrounded by solid rock on all sides.

Is an escape possible? If yes, how long will it take?

Input

The input consists of a number of dungeons. Each dungeon description starts with a line containing three integers L, R and C (all limited to 30 in size).
L is the number of levels making up the dungeon.
R and C are the number of rows and columns making up the plan of each level.
Then there will follow L blocks of R lines each containing C characters. Each character describes one cell of the dungeon. A cell full of rock is indicated by a '#' and empty cells are represented by a '.'. Your starting position is indicated by 'S' and the exit by the letter 'E'. There's a single blank line after each level. Input is terminated by three zeroes for L, R and C.

Output

Each maze generates one line of output. If it is possible to reach the exit, print a line of the form
Escaped in x minute(s).

where x is replaced by the shortest time it takes to escape.
If it is not possible to escape, print the line
Trapped!

Sample Input

3 4 5
S....
.###.
.##..
###.#

#####
#####
##.##
##...

#####
#####
#.###
####E

1 3 3
S##
#E#
###

0 0 0

Sample Output

Escaped in 11 minute(s).
Trapped!

Source

 
这题可是看来很多代码啊。表示结构体还是不是很熟。
题意: http://blog.csdn.net/lyy289065406/article/details/6647938奇怪这次神姐的代码居然这么的麻烦
参考资料 http://poj.org/showmessage?message_id=169052这题和白书108走迷宫其实是一样的。感谢这位神人的代码让我见识了三维的怎么表示。谢谢了。
表示bfs还是不熟这是第一题bfs,在入队出对 这边费了很大的尽。有个代码很好不知道是不是传说中的双向搜索 http://www.cppblog.com/proyao/archive/2009/07/23/90910.aspx?opt=admin我本来想把它的代码中两个while改为一个,不过没成功。。也不知道为什么它是这么做的,我猜是双向搜索。代码太精了。
 
http://poj.org/showmessage?message_id=169052它的输入方式改变了
#include <string.h>
#include <stdio.h>
int maze[100][100][100];
int vis[100][100][100];
int dis[100][100][100];
int q[60000];
int l,r,c;
int flag;
int dx[]={1,-1,0,0,0,0};
int dy[]={0,0,0,0,-1,1};
int dz[]={0,0,-1,1,0,0};
int bfs(int x,int y,int z)
{
  int front=0,rear=0,d,u;
  vis[x][y][z]=1;//标记访问过
  dis[x][y][z]=0;//记录距离
  u=x*r*c+y*c+z;//参考白书109
  q[rear++]=u;
  while(front<rear)//队列不空
  {
    u=q[front++];
    x=u/(r*c);//经典
    y=(u%(r*c))/c;
    z=(u%(r*c))%c;
    for(d=0;d<6;d++)//向六个方向搜索
    {
      int nx=x+dx[d];//下一步的坐标
      int ny=y+dy[d];
      int nz=z+dz[d];
      if(nx>=0&&nx<l&&ny>=0&&ny<r&&nz>=0&&nz<c&&maze[nx][ny][nz]&&vis[nx][ny][nz]==0)//边界&&是否访问过&&能走的路
      {
        int v=nx*r*c+ny*c+nz;
        q[rear++]=v;
        vis[nx][ny][nz]=1;
        dis[nx][ny][nz]=dis[x][y][z]+1;//步数加一
        if(maze[nx][ny][nz]==2)//出口
        {
          return dis[nx][ny][nz];
        }
      }
    }
  }
  return 0;
}
int main()
{
  int i,j,k;
  char s[100][100][100];
  int a1,b1,c1;
  int time;
 
  while(scanf("%d %d %d",&l,&r,&c)==3&&l!=0&&r!=0&&c!=0)
  {
    getchar();
    flag=1;
    memset(maze,0,sizeof(maze));
    memset(vis,0,sizeof(vis));
    for(i=0;i<l;i++)
                      for(j=0;j<r;j++)
                              scanf("%s",s[i][j]);
              for(i=0;i<l;i++)
                      for(j=0;j<r;j++)
                              for(k=0;k<c;k++)
                              {
                                      if(s[i][j][k]=='S') {a1=i;b1=j;c1=k;}//sx=i;sy=j;sz=k;}//记录起点
                                      else if(s[i][j][k]=='E') {maze[i][j][k]=2;}//ex=i;ey=j;ez=k;}//记录终点
          else if(s[i][j][k]=='.'){maze[i][j][k]=1;}
                              }
    time=bfs(a1,b1,c1);//从起点开始bfs
    if(time)
    {
      printf("Escaped in %d minute(s).\n",time);
    }
    else
    {
      printf("Trapped!\n");
    }
  }
  return 0;
}
 
 
 
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值