ACM_搜索:杭电oj1072:Nightmare

题目传送门:http://acm.hdu.edu.cn/showproblem.php?pid=1072

题目大意:你身上有个定时器炸弹.开始的时候定时为6分钟.你必须在定时器时间>=1时.达到出口.4代表调整定时器时间的设备.可以把时间调到6分钟满.但是当你到达位置4时.定时器的时间必须>=1.

简单的bfs广度遍历.

AC代码:

#include <iostream>
#include <algorithm>
#include <queue>
#include <memory.h>
#include <stdio.h>
using namespace std;
#define Size 8
/*
    这题目可以重复道路.只需要把控制炸弹的地方使用后,变成墙壁即可.
*/
struct Node
{
    int x;
    int y;
    int time;//time代表已用的时间.
    int rest;//rest代表剩余的时间.
    //按照时间从高到低排列.
    bool operator < (Node a) const
    {
        return this->time > a.time;
    }
};

int world[Size][Size];
int n, m;
int temp;
int dir[4][2] = { { 1, 0 }, { 0, 1 }, { -1, 0 }, { 0, -1 } };
int sx, sy;
int rx, ry;
/*
    0代表墙壁.1代表正常路.2代表起点.3代表终点.4代表炸弹控制器.
*/
int bfs()
{
    priority_queue<Node> temp;
    Node now, next, s;
    s.x = sx;
    s.y = sy;
    s.time = 0;
    s.rest = 6;
    temp.push(s);

    while (!temp.empty())
    {
        now = temp.top();
        temp.pop();

        if (now.x == rx && now.y == ry && now.rest > 0)
        {
            return now.time;
        }
        //减枝.当剩余时间为1时.还没找到出口,说明到不了了.
        if (now.rest == 1)
            continue;

        for (int i = 0; i < 4; ++i)
        {
            next.x = now.x + dir[i][0];
            next.y = now.y + dir[i][1];
            next.time = now.time + 1;
            next.rest = now.rest - 1;
            //判断位置是否合理.
            if (next.x >= 0 && next.y >= 0 && next.x < n &&  next.y < m &&  world[next.x][next.y] != 0 && next.rest >= 1)
            {
                //如果他到了炸弹这里.
                if (world[next.x][next.y] == 4)
                {
                    next.rest = 6;
                    //改为墙壁即可.
                    world[next.x][next.y] = 0;
                }
                temp.push(next);
            }
        }
    }
    return -1;
}

int main()
{
    int t;
    scanf("%d", &t);
    for (int i = 0; i < t; ++i)
    {
        scanf("%d%d", &n,&m);
        memset(world, 0, sizeof(world));
        for (int j = 0; j < n; ++j)
        {
            for (int k = 0; k < m; ++k)
            {
                scanf("%d", &temp);
                //初始位置.
                if (temp == 2)
                {
                    sx = j;
                    sy = k;
                }
                //目标位置.
                else if (temp == 3)
                {
                    rx = j;
                    ry = k;
                }
                world[j][k] = temp;
            }
        }
        printf("%d\n", bfs());
    }

    return 0;
}