hdu 1242 dfs/bfs

Problem Description

Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M <= 200) matrix. There are WALLs, ROADs, and GUARDs in the prison.

Angel's friends want to save Angel. Their task is: approach Angel. We assume that "approach Angel" is to get to the position where Angel stays. When there's a guard in the grid, we must kill him (or her?) to move into the grid. We assume that we moving up, down, right, left takes us 1 unit time, and killing a guard takes 1 unit time, too. And we are strong enough to kill all the guards.

You have to calculate the minimal time to approach Angel. (We can move only UP, DOWN, LEFT and RIGHT, to the neighbor grid within bound, of course.)

 

Input

First line contains two integers stand for N and M.

Then N lines follows, every line has M characters. "." stands for road, "a" stands for Angel, and "r" stands for each of Angel's friend.

Process to the end of the file.

 

Output

For each test case, your program should output a single integer, standing for the minimal time needed. If such a number does no exist, you should output a line containing "Poor ANGEL has to stay in the prison all his life." 

 

Sample Input

7 8

#.#####.

#.a#..r.

#..#x...

..#..#.#

#...##..

.#......

.......

.

 

Sample Output

13

 

题意：天使被困在监狱，他的朋友们想见他，监狱的地形复杂，包括路(用点标示),墙(用#标示)，天使的位置（用a标示），他的朋友(用r标示),监狱里还有守卫(用x标示),他的朋友只能向左右上下四个方向走，走以不花一单位时间，若碰上守卫，消灭守卫需要额外花费一单位时间。问最少多长时间天使能见到他的朋友。

本题需要注意的是，天使的朋友可能不只一个，所以，应该从天使的位置开始搜去找其朋友就ok了。

 dfs做法

#include <stdio.h>
#include <iostream>
#include <string.h>
#include <string>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <map>
#include <set>
using namespace std;

#define Maxn 500

int hang,lie;
int end_x,end_y;
int begin_x,begin_y;
int maxn;
int q = 0;
bool flag = false;
char MAP[Maxn][Maxn];
int dir[4][2] = {
    {1,0},
    {-1,0},
    {0,1},
    {0,-1}
};

void print()
{
    for(int i = 0; i < hang; i++)
    {
        for(int j = 0; j < lie; j++)
        {
            printf("%c",MAP[i][j]);
        }
        printf("\n");
    }
}

void dfs(int x,int y,int Time)
{
    if (MAP[x][y] == 'r')
    {
        flag = true;
        if (Time < maxn)
        {
            maxn = Time;
        }
    }
    MAP[x][y] = '#';
    for(int i = 0; i < 4; i++)
    {
        int xx = x + dir[i][0];
        int yy = y + dir[i][1];
        if (xx >= 0 && xx < hang && yy >= 0 && yy < lie && MAP[xx][yy] != '#')
        {
            if (MAP[xx][yy] != '#')
            {
                if (MAP[xx][yy] == 'x')
                {
                    dfs(xx,yy,Time+2);
                    MAP[xx][yy] = 'x';
                }
                else if(MAP[xx][yy] == 'r')
                {
                    dfs(xx,yy,Time+1);
                    MAP[xx][yy] = 'r';
                }
                else
                {
                    dfs(xx,yy,Time+1);
                    MAP[xx][yy] = '.';
                }
            }
        }
    }
}

int main()
{
    while(cin >> hang >> lie)
    {
        maxn = 214748364;
        flag=false;
        for (int i = 0; i < hang; i++)
        {
            scanf("%s",MAP[i]);
        }
        for(int i = 0; i < hang; i++)
        {
            for(int j = 0; j < lie; j++)
            {
                // printf("%c",MAP[i][j]);
                if (MAP[i][j] == 'a')
                {
                    begin_x = i;
                    begin_y = j;
                    MAP[i][j] = '#';
                }
            }
        }
        dfs(begin_x,begin_y,0);
        if (flag)
        {
            printf("%d\n",maxn);
        }
        else
        {
            printf("Poor ANGEL has to stay in the prison all his life.\n");
        }
    }
}

接下来是bfs做法，记得要标记，要不然就死循环了

#include <stdio.h>
#include <iostream>
#include <queue>
#include <string>
#include <string.h>
using namespace std;

#define Maxn 1000

struct Node
{
	int x;
	int y;
	int step;
};

char MAP[Maxn][Maxn];
int begin_x,begin_y;
int hang,lie;
bool flag;
int maxn;
bool visit[Maxn][Maxn];
int dir[4][2] = {
	{0,1},
	{0,-1},
	{1,0},
	{-1,0}
};

void bfs(int x,int y)
{
	memset(visit,false,sizeof(visit));
	queue <Node> q;
	Node a,b,c;
	a.x = x;
	a.y = y;
	visit[x][y] = true;
	a.step = 0;
	q.push(a);
	while(!q.empty())
	{
		b = q.front();
		q.pop();
		if (MAP[b.x][b.y] == 'r')
		{
			if (maxn > b.step)
			{
				maxn = b.step;
			}
			flag = true;
		}
		for(int i = 0; i < 4; i++)
		{
			c.x = b.x + dir[i][0];
			c.y = b.y + dir[i][1];
			if (c.x >= 0 && c.x < hang && c.y >= 0 && c.y < lie && MAP[c.x][c.y] != '#' && !visit[c.x][c.y])
			{
				visit[b.x][b.y] = true;
				if (MAP[c.x][c.y] == 'x')
				{
					c.step = b.step + 2;
				}
				else
				{
					c.step = b.step + 1;
				}
				q.push(c);
			}
		}
	}
}

int main()
{
    while(scanf("%d%d",&hang,&lie)!=EOF&&(hang+lie))
    {
		flag = false;
		maxn = 2147483646;
		for(int i = 0; i < hang; i++)
		{
			scanf("%s",MAP[i]);
		}
		for(int i = 0; i < hang; i++)
		{
			for(int j = 0; j < lie; j++)
			{
				if (MAP[i][j] == 'a')
				{
					begin_x = i;
					begin_y = j;
				}
			}
		}
		bfs(begin_x,begin_y);
		if (flag)
		{
			printf("%d\n",maxn);
		}
		else
		{
			printf("Poor ANGEL has to stay in the prison all his life.\n");
		}
    }
}