zoukankan      html  css  js  c++  java
  • Dungeon Master

    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

    #include<cstdio>
    #include<cstring>
    #include<queue>
    using namespace std;
    char map[40][40][40];
    int vis[40][40][40];
    struct  node 
    {
    	int ceng,hang,lie;
    	int step;
    };
    int main()
    {
    	int l,n,m;
    	while(scanf("%d%d%d",&l,&n,&m)!=EOF)
    	{
    		if(l==0&&n==0&&m==0)
    			break;
    		memset(vis,0,sizeof(vis));
    		struct node start;
    		for(int i=0;i<l;i++)
    		{
    			for(int j=0;j<n;j++)
    			{
    				scanf("%s",&map[i][j]);
    				for(int k=0;k<m;k++)
    				{
    					if(map[i][j][k]=='S')
    					{
    					start.ceng =i;
    					start.hang =j;
    					start.lie =k;
    					start.step =0;
    					vis[i][j][k]=1;
    					}
    				}
    			}
    		}
    	    queue<node>bfs;
    		bfs.push (start);
    		int flog=0;
    		while(!bfs.empty ())
    		{
    		    struct	node tmp=bfs.front ();
    			bfs.pop ();
    			if(map[tmp.ceng ][tmp.hang ][tmp.lie ]=='E')
    			{
    				flog=1;
    					printf("Escaped in %d minute(s).
    ",tmp.step);
    					break;
    			}
    			tmp.step ++;
    		  struct node tmp2;
    		   if(tmp.ceng +1<l)
    		   {
    		   	tmp2=tmp;
    		   	tmp2.ceng ++;
    		   		if(map[tmp2.ceng][tmp2.hang][tmp2.lie]!='#'&&vis[tmp2.ceng][tmp2.hang][tmp2.lie]==0)
    				{
    					vis[tmp2.ceng][tmp2.hang][tmp2.lie]=1;
    					bfs.push (tmp2);
    				}
    		   	
    		   }
    		    if(tmp.ceng -1>=0)
    		   {
    		   	tmp2=tmp;
    		   	tmp2.ceng--;
    		   		if(map[tmp2.ceng][tmp2.hang][tmp2.lie]!='#'&&vis[tmp2.ceng][tmp2.hang][tmp2.lie]==0)
    				{
    					vis[tmp2.ceng][tmp2.hang][tmp2.lie]=1;
    					bfs.push (tmp2);
    				}
    		   	
    		   }
    		    if(tmp.hang +1<n)
    		   {
    		   	tmp2=tmp;
    		   	tmp2.hang ++;
    		   		if(map[tmp2.ceng][tmp2.hang][tmp2.lie]!='#'&&vis[tmp2.ceng][tmp2.hang][tmp2.lie]==0)
    				{
    					vis[tmp2.ceng][tmp2.hang][tmp2.lie]=1;
    					bfs.push (tmp2);
    				}
    		   	
    		   }
    		    if(tmp.hang -1>=0)
    		   {
    		   	tmp2=tmp;
    		   	tmp2.hang --;
    		   		if(map[tmp2.ceng][tmp2.hang][tmp2.lie]!='#'&&vis[tmp2.ceng][tmp2.hang][tmp2.lie]==0)
    				{
    					vis[tmp2.ceng][tmp2.hang][tmp2.lie]=1;
    					bfs.push (tmp2);
    				}
    		   }
    		    if(tmp.lie  +1<m)
    		   {
    		   	tmp2=tmp;
    		   	tmp2.lie ++;
    		   		if(map[tmp2.ceng][tmp2.hang][tmp2.lie]!='#'&&vis[tmp2.ceng][tmp2.hang][tmp2.lie]==0)
    				{
    					vis[tmp2.ceng][tmp2.hang][tmp2.lie]=1;
    					bfs.push(tmp2);
    				}
    		   	
    		   }
    		    if(tmp.lie -1>=0)
    		   {
    		   	tmp2=tmp;
    		   	tmp2.lie --;
    		   		if(map[tmp2.ceng][tmp2.hang][tmp2.lie]!='#'&&vis[tmp2.ceng][tmp2.hang][tmp2.lie]==0)
    				{
    					vis[tmp2.ceng][tmp2.hang][tmp2.lie]=1;
    					bfs.push (tmp2);
    				}
    		   	
    		   }
    		}
    			if(flog==0)
    		printf("Trapped!
    ");
    	}
    	return 0;
    }
    


    编程五分钟,调试两小时...
  • 相关阅读:
    Python 中特殊变量/方法命名规则说明(特别是私有变量)及使用实例
    博客(文本)编辑工具Markdown使用初体验
    Vue2.0关于生命周期和钩子函数
    Vue2.0中的路由配置
    Vue项目中引入外部文件(css、js、less)
    利用vue-cli创建Vue项目
    vue+webpack构建项目
    VueJs2.0建议学习路线
    Python基础 :正则表达式
    Python框架 :WEB框架
  • 原文地址:https://www.cnblogs.com/kingjordan/p/12027118.html
Copyright © 2011-2022 走看看