HDU 1242

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#include <iostream>
#include <stdio.h>
#include <string.h>

using namespace std;

#define MMAX 999999

int n, m;
int dp[210][210];
int map[210][210];
int point[4][2] = {1, 0, -1, 0, 0, 1, 0, -1};

void dfs(int x, int y, int num) {
	if(dp[x][y] < num) return;
	dp[x][y] = num;
	for(int i = 0; i < 4; i++) {
		int xx = x + point[i][0];
		int yy = y + point[i][1];
		if(map[xx][yy] == '#' || xx < 0 || xx >= m || yy < 0 || yy >= n) continue;
		if(map[xx][yy] == '.' || map[xx][yy] == 'r') {
			dfs(xx, yy, num+1);
		}
		if(map[xx][yy] == 'x') {
			dfs(xx, yy, num+2);
		}
	}
}

int main() {
	int sx, sy, ex, ey;
	while(scanf("%d%d", &m, &n) != EOF) {
		getchar();
		for(int i = 0; i < m; i++) {
			for(int j = 0; j < n; j++) {
				scanf("%c", &map[i][j]);
				dp[i][j] = MMAX;
			}
			getchar();
		}
		for(int i = 0; i < m; i++) {
			for(int j = 0; j < n; j++) {
				if('a' == map[i][j]) {
					sx = i;
					sy = j;
				}
				else if('r' == map[i][j]) {
					ex = i;
					ey = j;
				}
			}
		}
		dp[sx][sy] = 0;
		dfs(sx, sy, 0);
		if(dp[ex][ey] == MMAX) printf("Poor ANGEL has to stay in the prison all his life.n");
		else printf("%dn", dp[ex][ey]);
	}
	return 0;
}