zoukankan      html  css  js  c++  java
  • poj 2251 Dungeon Master

    Dungeon Master
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 19222   Accepted: 7466

    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!

    #include<stdio.h>
    #include<string.h>
    #include<queue>
    #define MAX 288
    using namespace std;
    int l,r,c;
    char map[MAX][MAX][MAX];
    struct node
    {
    	int x,y,z;
    	int step;
    };
    void bfs(int x1,int y1,int z1,int x2,int y2,int z2)
    {
    	int j,i,ok=0;
    	int move[6][3]={0,0,1,0,0,-1,1,0,0,-1,0,0,0,1,0,0,-1,0};
    	queue<node>q;
    	node beg,end;
    	beg.x=x1;
    	beg.y=y1;
    	beg.z=z1;
    	beg.step=0;
    	q.push(beg);
    	while(!q.empty())
    	{
    		end=q.front();
    		q.pop();
    		if(end.x==x2&&end.y==y2&&end.z==z2)
    		{
    			ok=1;
    			break;
    		}
    		for(i=0;i<6;i++)
    		{
    			beg.x=end.x+move[i][0];
    			beg.y=end.y+move[i][1];
    			beg.z=end.z+move[i][2];
    			if(0<=beg.x&&beg.x<l&&0<=beg.y&&beg.y<r&&0<=beg.z&&beg.z<c&&map[beg.x][beg.y][beg.z]!='#')
    			{
    				map[beg.x][beg.y][beg.z]='#';
    				beg.step=end.step+1;
    				q.push(beg);
    			}
    		}
    	}
    	if(ok)
    	printf("Escaped in %d minute(s).
    ",end.step);
    	else
    	printf("Trapped!
    ");
    }
    int main()
    {
    	int i,j,k,x1,y1,z1,x2,y2,z2;
    	while(scanf("%d%d%d",&l,&r,&c)&&l!=0&&r!=0&&c!=0)
    	{
    		for(i=0;i<l;i++)
    		{
    			for(j=0;j<r;j++)
    			{
    				scanf("%s",map[i][j]);
    			}
    		}
    		for(i=0;i<l;i++)
    		for(j=0;j<r;j++)			
    		for(k=0;k<c;k++)
    		{
    			if(map[i][j][k]=='S')
    			{
    				x1=i;y1=j;z1=k;
    			}
    			else if(map[i][j][k]=='E')
    			{
    				x2=i,y2=j;z2=k;
    			}	
    		}
    		bfs(x1,y1,z1,x2,y2,z2);
    	}
    	return 0;
    }
    

      

  • 相关阅读:
    JS实现动画的四条优化方法
    如果全球的沙子都对你发起DDoS攻击,如何破?
    阿里云实时计算的前世“功”今生“能”
    IPv6时代已来:双十一中的IPv6大规模应用实践
    支撑双十一的网络引擎:飞天洛神
    【阿里云总监课第四期】时髦的云原生应用怎么写?
    阿里云重磅发布RDS for SQL Server AlwaysOn集群版
    4K超清,2500万人在线,猫晚直播技术全解读
    猫晚流量再创记录,阿里云直播方案护航优酷2500万用户体验
    TableStore最佳实践:轻松实现轨迹管理与地理围栏
  • 原文地址:https://www.cnblogs.com/tonghao/p/4593618.html
Copyright © 2011-2022 走看看