zoukankan      html  css  js  c++  java
  • NYOJ353 3D dungeon 【BFS】

    3D dungeon

    时间限制:1000 ms  |  内存限制:65535 KB
    难度:2
    描写叙述
    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?

     

    输入
    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.
    输出
    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!
    例子输入
    3 4 5
    S....
    .###.
    .##..
    ###.#
    
    #####
    #####
    ##.##
    ##...
    
    #####
    #####
    #.###
    ####E
    
    1 3 3
    S##
    #E#
    ###
    
    0 0 0
    例子输出
    Escaped in 11 minute(s).
    Trapped!

    #include <stdio.h>
    #include <string.h>
    #include <queue>
    using std::queue;
    char map[32][32][32], vis[32][32][32];
    int a, b, c, X, Y, Z;
    const int mov[][3] = {0, 0, 1, 0, 0, -1, 0, 1,
    		0, 0, -1, 0, 1, 0, 0, -1, 0, 0};
    struct Node{
    	int x, y, z, steps;
    };
    queue<Node> Q;
    
    bool check(Node t){
    	if(t.x < 0 || t.y < 0 || t.z < 0) return 0;
    	if(t.x >= a || t.y >= b || t.z >= c) return 0;
    	if(vis[t.x][t.y][t.z] || map[t.x][t.y][t.z] == '#') return 0;
    	return 1;
    }
    
    void BFS(){
    	while(!Q.empty()) Q.pop();
    	
    	Node t, n = {0};
    	n.x = X; n.y = Y; n.z = Z;
    	vis[X][Y][Z] = 1;
    	Q.push(n);
    	
    	while(!Q.empty()){
    		n = Q.front(); Q.pop();
    		
    		for(int i = 0; i < 6; ++i){
    			t = n; ++t.steps;
    			t.x += mov[i][0];
    			t.y += mov[i][1];
    			t.z += mov[i][2];
    			
    			if(check(t)){
    				if(map[t.x][t.y][t.z] == 'E'){
    					printf("Escaped in %d minute(s).
    ", t.steps);
    					return;
    				}
    				vis[t.x][t.y][t.z] = 1;
    				Q.push(t);
    			}
    		}
    	}
    	printf("Trapped!
    ");
    }
    
    int main(){
    	while(scanf("%d%d%d", &a, &b, &c), a || b || c){
    	
    		memset(vis, 0, sizeof(vis));
    		
    		for(int i = 0; i < a; ++i){
    			for(int j = 0; j < b; ++j){
    				scanf("%s", map[i][j]);
    				for(int k = 0; k < c; ++k)
    					if(map[i][j][k] == 'S'){
    						X = i; Y = j; Z = k;
    					}
    			}
    		}
    		BFS();
    	}
    	return 0;
    }


    版权声明:本文博客原创文章,博客,未经同意,不得转载。

  • 相关阅读:
    【有感】向香港雷锋学什么
    After NeuSoft’s Interview
    【SHELL学习】if语句
    《我是一只IT小小鸟》【1】
    MSDN微软社区 大连线下聚会 即将举行
    【毕业设计】修改用户信息
    SQL Connection
    EasyPR中文开源车牌识别系统 开发详解(1)
    EasyPR开发详解(2)车牌定位
    EasyPR开发详解(4)形态学操作、尺寸验证、旋转等操作
  • 原文地址:https://www.cnblogs.com/bhlsheji/p/4732439.html
Copyright © 2011-2022 走看看