hdu 1242 Rescue(bfs)

最新推荐文章于 2023-04-25 17:29:12 发布

算球？

最新推荐文章于 2023-04-25 17:29:12 发布

阅读量289

点赞数

CC 4.0 BY-SA版权

分类专栏：搜索

本文链接：https://blog.youkuaiyun.com/gyhguoge01234/article/details/51125866

搜索专栏收录该内容

37 篇文章

订阅专栏

本文提供了一种解决迷宫问题的方法，通过C语言实现了一个寻找从起点到终点路径的算法。该算法使用了广度优先搜索策略，并考虑了特殊条件如‘x’标记的格子会增加额外的时间成本。

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1242

#include <stdio.h>
#include <string.h>
char map[201][201];
int book[201][201];
int next[4][2] = {{0,1},{1,0},{0,-1},{-1,0}};
struct
{
    int x;
    int y;
    int step;//保存用时
} node[40404];

int main()
{
    int i,j,n,m,tx,ty,head,tail,k;
    int endx,endy,flag;
    while(scanf(" %d %d",&n,&m) != EOF)
    {
        flag = 0;
        for(i = 1; i <= n; ++i)
            for(j = 1; j <= m; ++j)
            {
                scanf(" %c",&map[i][j]);
                if(map[i][j] == 'r')
                {
                    tx = i;
                    ty = j;
                }
                if(map[i][j] == 'a')
                {
                    endx = i;
                    endy = j;
                }
            }
        memset(book,0,sizeof(book));
        head = tail = 1;
        node[0].step = node[1].step = 0;
        book[tx][ty] = 1;
        node[tail].x = tx;
        node[tail].y = ty;
        tail++;
        while(head < tail)
        {
            for(k = 0; k < 4; ++k)
            {
                tx = node[head].x + next[k][0];
                ty = node[head].y + next[k][1];
                if(tx < 1 || ty < 1 || tx > n || ty > m)
                    continue;
                if(map[tx][ty] != '#' && book[tx][ty] == 0)
                {
                    node[tail].step = 0;
                    book[tx][ty] = 1;
                    node[tail].x = tx;
                    node[tail].y = ty;
                    node[tail].step = node[head].step+1;//下一步的时间等于上一步的时间加1

                    if(map[tx][ty] == 'x')//杀死一个守卫，增加一个时间
                        node[tail].step += 1;

                    tail++;
                }
                if((tx == endx) && (ty == endy))
                {
                    flag = 1;
                    break;
                }
            }
            if(flag == 1)
                break;
            head++;
        }
        if(flag == 1)
            printf("%d\n",node[tail-1].step);
        else
            printf("Poor ANGEL has to stay in the prison all his life.\n");
    }
    return 0;
}