POJ 2251 3D wide search.

POJ 2251 3D wide search.
B-Dungeon MasterCrawling in process...Crawling failedTime Limit:1000 MSMemory Limit:65536KB64bit IO Format:% I64d & % I64uSubmitStatus

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 '. '. 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 5S.....###..##..###.#############.####...###########.#######E1 3 3S###E####0 0 0

Sample Output

Escaped in 11 minute(s).Trapped!

As a weak dish, this question has been stuck for a day.

3D wide search, with six directions: Up, down, left, right, and back.

The first case can be understood as three layers stacked together.

# Include
 
  
# Include
  
   
# Include
   
    
# Include
    
     
# Include using namespace std; # define M 45 # define inf 0x6ffffffchar map [M] [M] [M]; int vis [M] [M] [M]; int dir [6] [3] = {0, 0}, {0,-}, {, 0}, {-, 0}, {0, 0, 0, 1 },{,-1 }}; // int n, m, OK, k; struct node {int x, y, z; int time ;}; node f [666]; int ztime; int z2, x2, y2, z1, x1, y1; void bfs () {int I; queue
     
      
Q; node st, ed; st. x = x1; st. y = y1; st. z = z1; st. time = 0; q. push (st); while (! Q. empty () {st = q. front (); q. pop (); if (st. x = x2 & st. y = y2 & st. z = z2) {OK = 1; ztime = st. time; return ;}for (I = 0; I <6; I ++) {ed. x = st. x + dir [I] [0]; ed. y = st. y + dir [I] [1]; ed. z = st. z + dir [I] [2]; if (map [ed. x] [ed. y] [ed. z] = '#' | vis [ed. x] [ed. y] [ed. z] | ed. x <0 | ed. x> = k | ed. y <0 | ed. y> = n | ed. z <0 | ed. z> = m) // beyond the boundary, where searched, all the walls exclude continue; ed. time = st. time + 1; // time plus vis [ed. x] [ed. y] [ed. z] = 1; q. push (ed) ;}}return ;}int main () {int I, j, r; whil E (scanf ("% d", & k, & n, & m )! = EOF & k! = 0 & n! = 0 & m! = 0) {OK = 0; memset (vis, 0, sizeof (vis); for (I = 0; I