2013
12-10

# The Treasure

We have arrived at the age of the Internet. Many software applications have transformed from stand-alone to online applications. Computer games are following this trend as well. Online games are becoming more and more popular, not only because they are more intelligent, but also because they can bring great profits. "The computer game industry is developing rapidly in China. Online game revenues amounted to 1.3 billion Yuan last year and are expected to reach 6.7 billion Yuan by 2007." reported by China Daily in 2004.

However, good games originate from good programmers. We take for example that there is a RPG (Role Playing Game) and your boss asks you to implement some tasks. For simplicity’s sake, we assume there are two kinds of roles in this game: one is player and the other is monster. You should help the player to achieve the goal: reach the place where treasure is positioned as early as possible and get the treasure.

The map of the game is a matrix of N * M identical cells. Some cells are passable blocks, and others are non-passable rocks. At any time, there is at most one role occupying a block. At the beginning, the time is set to 0, and the player is at a certain block. He then moves towards the treasure. At each turn, we have some rules:

1) The player can stay in the same block during the next one-second time duration, or he can walk or run towards the east, south, west, north, northeast, northwest, southeast, and southwest.

2) With walking, the player can arrive at the corresponding passable blocks around him (See Fig.1). Each move takes 1 second.

3) With running, the player can arrive at the corresponding passable blocks 2 cells away from him (See Fig.2). Each run takes 1 second. As demonstrated in Fig.3, if a neighbor cell is not passable, the player cannot run in that direction. For example, if cell 2 is a rock, running from 1 to 3 is impossible.

4) The monsters are classified into aggressive and non-aggressive. If a monster occupies a cell, the player cannot move into that cell or run through that cell. In addition, the player cannot move into the cells surrounding an aggressive monster, because it will attack the player near it. For example, in Fig.4, if there is an aggressive monster in 5, then the cell 1, 2, 3, 4, 6, 7, 8 and 9 are in its attacking region, so the player cannot stay in or pass through these cells.

5) Monsters change their positions each turn. Each monster appears by its position sequence iteratively. That’s to say, given the position sequence of monster i: (x1, y1), (x2, y2), …, (xs, ys), its initial position is (x1, y1) at time 0, then it appears in (x2, y2) at time 1, and so on. When monster i arrives at (xs, ys) at time s-1, it will arrive in (x1, y1) at time s, and start to repeat.
At the start of each turn, all the monsters change their positions first (the way of changing is given above). If a monster appears in the player’s cell, or if an aggressive monster appears near the player to put him in its attacking region, the player will die, and the goal cannot be achieved. After all the monsters change their positions, the player makes a move or stays in the same cell. In his move, the moving path should not be occupied by any rocks or monsters or in the attacking region of any aggressive monsters. When counting the total time, we can neglect the time between monsters’ position change and the player’s move. Given the map of the game, the player’s starting position, the treasure position and all the monsters’ positions in every second, your task is to write a program to find the minimum time that the player gets the treasure.

The input consists of several test cases. The first line of each case contains two integers N and M (1 <= N, M <= 100), where N is the height of the map and M is the width of the map. This is followed by N lines each containing M characters representing the map. A ‘#’ represents a rock, a ‘.’ is a free block, ‘p’ is the starting position of the player, ‘t’ is the position of the treasure, ‘n’ is the initial position of a non-aggressive monster, and an ‘a’ stands for the initial position of an aggressive monster.

The cell (i, j) is the j-th cell on the i-th row counting from left to right. The rows are counted from 1 to N starting from the first line of the matrix. We can number all the monsters as 1, 2, 3… according to their initial position, sorting first by row, then by column. The (n+2)-th line contains an integer p (0 <= p <= 100), which is the total number of monsters (i.e. the total number of ‘n’s and ‘a’s in the matrix). It is followed by p lines each specifying a monster’s position sequence in the following format: the i-th (1 <= i <= p) line corresponds to monster i, which begins with an integer s (1 <= s <= 100), meaning the length of position sequence. Then s pairs of integers x1, y1, x2, y2, …, xs, ys are followed, separated by blanks. Each pair is a free block in the map, (i.e. a monster never goes to a rock cell).

It is assured that none of the aggressive monsters’ initial position is around the player. Two consecutive cases are separated by a blank line. The input is terminated by a line containing a pair of zeros.

For each test case, output the minimum total time required for the player to get the treasure, in seconds. If it’s not possible to get the treasure, or the minimum required time is greater than 100 seconds, please print a line just containing the string "impossible". Two consecutive cases should be separated by a blank line.

7 8
#.#####.
#.t#..p.
#..#....
..#a.#.#
#...##.n
.#......
........
2
2 4 4 5 4
3 5 8 6 8 5 7

3 3
p#.
##.
t..
0

2 2
#t
p#
0

0 0

8

impossible

1

Hint
In the first sample case, the player can follow (2,7), (4,7), stay in (4,7), (6,7), (7,6), (7,4), (5,2), (3,2) and (2,3)
to get the treasure with the minimum time (8 seconds).


#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <stack>
#include <queue>
using namespace std;

struct Point
{
int x;
int y;
int z;
};

Point s,e;

int map[35][35][35];
int vis[35][35][35];
int dist[35][35][35];

int disx[6] = {-1,0,1,0,0,0};
int disy[6] = {0,1,0,-1,0,0};
int disz[6] = {0,0,0,0,1,-1};
int l,r,c;

int bfs()
{
queue<Point> p;
Point temp,nex;
p.push(s);
vis[s.x][s.y][s.z] = 1;

while(!p.empty())
{
temp = p.front();
p.pop();
for(int i=0; i<6; i++)
{

int tempx = temp.x + disx[i];
int tempy = temp.y + disy[i];
int tempz = temp.z + disz[i];

//注意我这里把x作为第一维，y作为第二维，z作为第三维
if(tempx>=1 && tempx<=l && tempy>=1 && tempy<=r && tempz>=1 && tempz<=c)
{
if(vis[tempx][tempy][tempz] == 0 && map[tempx][tempy][tempz] == 1)
{
vis[tempx][tempy][tempz] = 1;
nex.x = tempx,nex.y = tempy,nex.z = tempz;
dist[nex.x][nex.y][nex.z] = dist[temp.x][temp.y][temp.z] + 1;
if(nex.x == e.x && nex.y == e.y && nex.z == e.z)
{
return dist[nex.x][nex.y][nex.z];
}
p.push(nex);
}
}
}
}
return 0;
}

int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
#endif

char str[35];
while(scanf(" %d %d %d",&l,&r,&c)!=EOF && l!=0 && r!=0 && c!=0)
{

memset(vis,0,sizeof(vis));
memset(dist,0,sizeof(dist));
memset(map,0,sizeof(map));

for(int i = 1; i<=l; i++)
{
for(int j=1; j<=r; j++)
{
scanf(" %s",str);
for(int k=0; k<strlen(str); k++)
{
if(str[k] == '#')
{
map[i][j][k+1] = 0;
}
else if(str[k] == '.')
{
map[i][j][k+1] = 1;
}
else if(str[k] == 'S')
{
map[i][j][k+1] = 1;
s.x = i,s.y = j,s.z = k+1;
}
else if(str[k] == 'E')
{
map[i][j][k+1] = 1;
e.x = i,e.y = j,e.z = k+1;
}
}
}
}

int ans = bfs();
if(ans == 0)
{
printf("Trapped!\n");
}
else
{
printf("Escaped in %d minute(s).\n",ans);
}
}
return 0;
}

1. Excellent Web-site! I required to ask if I might webpages and use a component of the net web website and use a number of factors for just about any faculty process. Please notify me through email regardless of whether that would be excellent. Many thanks

2. 可以参考算法导论中的时间戳。就是结束访问时间，最后结束的顶点肯定是入度为0的顶点，因为DFS要回溯

3. 这道题目虽然简单，但是小编做的很到位，应该会给很多人启发吧！对于面试当中不给开辟额外空间的问题不是绝对的，实际上至少是允许少数变量存在的。之前遇到相似的问题也是恍然大悟，今天看到小编这篇文章相见恨晚。