1月25号acm寒假训练第九题

Time limit1000 msMemory limit32768 kBOSWindows

problem description

Ignatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should get out of the labyrinth before the bomb explodes. The initial exploding time of the bomb is set to 6 minutes. To prevent the bomb from exploding by shake, Ignatius had to move slowly, that is to move from one area to the nearest area(that is, if Ignatius stands on (x,y) now, he could only on (x+1,y), (x-1,y), (x,y+1), or (x,y-1) in the next minute) takes him 1 minute. Some area in the labyrinth contains a Bomb-Reset-Equipment. They could reset the exploding time to 6 minutes.

Given the layout of the labyrinth and Ignatius’ start position, please tell Ignatius whether he could get out of the labyrinth, if he could, output the minimum time that he has to use to find the exit of the labyrinth, else output -1.

Here are some rules:

1. We can assume the labyrinth is a 2 array.
2. Each minute, Ignatius could only get to one of the nearest area, and he should not walk out of the border, of course he could not walk on a wall, too.
3. If Ignatius get to the exit when the exploding time turns to 0, he can’t get out of the labyrinth.
4. If Ignatius get to the area which contains Bomb-Rest-Equipment when the exploding time turns to 0, he can’t use the equipment to reset the bomb.
5. A Bomb-Reset-Equipment can be used as many times as you wish, if it is needed, Ignatius can get to any areas in the labyrinth as many times as you wish.
6. The time to reset the exploding time can be ignore, in other words, if Ignatius get to an area which contain Bomb-Rest-Equipment, and the exploding time is larger than 0, the exploding time would be reset to 6.

Input
The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case starts with two integers N and M(1<=N,Mm=8) which indicate the size of the labyrinth. Then N lines follow, each line contains M integers. The array indicates the layout of the labyrinth.
There are five integers which indicate the different type of area in the labyrinth:
0: The area is a wall, Ignatius should not walk on it.
1: The area contains nothing, Ignatius can walk on it.
2: Ignatius’ start position, Ignatius starts his escape from this position.
3: The exit of the labyrinth, Ignatius’ target position.
4: The area contains a Bomb-Reset-Equipment, Ignatius can delay the exploding time by walking to these areas.
Output
For each test case, if Ignatius can get out of the labyrinth, you should output the minimum time he needs, else you should just output -1.

问题链接：https://vjudge.net/contest/279639#problem/F

问题描述：炸弹的最初爆炸时间设定为6分钟。为了防止炸弹爆炸，Ignatius必须缓慢移动，即从一个区域移动到最近的区域（也就是说，如果Ignatius现在站在（x，y），他只能在（x + 1， y），（x-1，y），（x，y + 1）或（x，y-1）在下一分钟）他需要1分钟。迷宫中的某些区域包含一个Bomb-Reset-Equipment。他们可以将爆炸时间重置为6分钟。

鉴于迷宫和Ignatius的起始位置的布局，请告诉Ignatius他是否可以离开迷宫，如果可以的话，输出他必须用来找到迷宫出口的最短时间，否则输出-1。

问题分析：此题涉及DFS，BFS。

程序说明：

c++程序如下：

#include<iostream>
#include<string>
#include<queue>
#include<algorithm>
using namespace std;
int a[10][10];
int dx[4]={0,0,1,-1},dy[4]={1,-1,0,0};
int N,M,sx,sy,ex,ey;
struct NODE
{
    int x; 
    int y;
    int step; 
    int t; 
    friend bool operator < (NODE n1,NODE n2)
    {
        return n1.step > n2.step;
    }
};
bool judge(int x,int y) 
{
    if(x<1||y<1||x>N||y>M)
        return 1;
    if(a[x][y]==0)
        return 1;
    return 0;
}
int bfs() 
{
    priority_queue<NODE> q;
    NODE cur,next;
    cur.x=sx;
    cur.y=sy;
    cur.step=0;
    cur.t=6;
    q.push(cur);
    while(!q.empty())
    {
        cur=q.top();
        q.pop();
        if(cur.x==ex&&cur.y==ey&&cur.t>0)
            return cur.step;
        for(int i=0;i<4;i++)
        {
            int nx = cur.x + dx[i];
            int ny = cur.y + dy[i];
            int T=cur.t-1;
            if( judge(nx,ny) || T<=0)
                continue;
            next.x = nx;
            next.y = ny;
            if(a[nx][ny]==4)
            {
                next.step = cur.step + 1;
                next.t=6;
                a[nx][ny]=0;
            }
            else
            {
                next.step = cur.step + 1;
                next.t=T;
            }
            q.push(next);
        }
    }
    return -1;
}
int main()
{
    int n;
    cin>>n;
    while(n--)
    {
        cin>>N>>M;
        for(int i=1;i<=N;i++)
        {
            for(int j=1;j<=M;j++)
            {
                cin>>a[i][j];
                if(a[i][j]==3)
                {
                    ex=i;
                    ey=j;
                }
                else if(a[i][j]==2)
                {
                    sx=i;
                    sy=j;
                }
            }
        }
        int step=bfs();
        cout<<step<<endl;
    }
    return 0;
}