hdu 1072 Nightmare(bfs)

Nightmare

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8683    Accepted Submission(s): 4172

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.

 

Sample Input

3 3 3 2 1 1 1 1 0 1 1 3 4 8 2 1 1 0 1 1 1 0 1 0 4 1 1 0 4 1 1 0 0 0 0 0 0 1 1 1 1 4 1 1 1 3 5 8 1 2 1 1 1 1 1 4 1 0 0 0 1 0 0 1 1 4 1 0 1 1 0 1 1 0 0 0 0 3 0 1 1 1 4 1 1 1 1 1

 

Sample Output

4 -1 13

 

bfs

存三维

前两维空间维度，第三维是剩余时间...

将同一位置不同的剩余时间看做不同的平面...之前做过一个类似的．

还有就是．reset bomb的机器最多也只有n*m个

那么最多访问 n*m次的（n*m） (实际肯定小于那么大）

加一个步数控制...

不然可能到TLE掉．

/*************************************************************************
    > File Name: code/hdu/1072.cpp
    > Author: 111qqz
    > Email: rkz2013@126.com 
    > Created Time: 2015年10月03日 星期六 23时23分40秒
 ************************************************************************/

#include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<map>
#include<set>
#include<queue>
#include<vector>
#include<stack>
#include<cctype>
                 
#define yn hez111qqz
#define j1 cute111qqz
#define ms(a,x) memset(a,x,sizeof(a))
using namespace std;
const int dx4[4]={1,0,0,-1};
const int dy4[4]={0,-1,1,0};
typedef long long LL;
typedef double DB;
const int inf = 0x3f3f3f3f;
const int N=10;
int a[N][N];
bool vis[N][N][N];
int n,m;
struct node{
    int x,y;
    int t;
    int d;
    bool ok()
    {
    if (x>=0&&y>=0&&x<n&&y<m&&!vis[x][y][t]&&a[x][y]>0&&t>0) return true;
    return false;
    }

    bool escape()
    {
    if (a[x][y]==3)
    return true;
    return false;
    }
    bool rbomb()
    {
    if (a[x][y]==4) return true;
    return false;
    }
    void mark()
    {
    vis[x][y][t] = true;
    }
}s;

bool bfs()
{
    queue<node>q;
    q.push(s);
    int step = 0;
    while (!q.empty()&&step<n*m*n*m)
    {
    step++;
    node pre = q.front();q.pop();
//    cout<<"x:"<<pre.x<<" y:"<<" a[x][y]:"<<a[pre.x][pre.y]<<" t:"<<pre.t<<" d:"<<pre.d<<endl;
    if (pre.escape())
    {
        printf("%d
",pre.d);
        return true;
    }
    
    for ( int  i = 0 ; i < 4 ; i++)
    {
        node next;
        next.x = pre.x + dx4[i];
        next.y = pre.y + dy4[i];
        next.d = pre.d + 1;
        next.t = pre.t - 1;
        if (!next.ok()) continue;
        if (next.rbomb())
        {
        next.t = 6;
        }
        next.mark();
        q.push(next);


    }
    }
    return false;

}
int main()
{
  #ifndef  ONLINE_JUDGE 
   freopen("in.txt","r",stdin);
  #endif

   int T;
   scanf("%d",&T);
   while (T--)
    {
    ms(vis,false);
    scanf("%d %d",&n,&m);
    for ( int i = 0  ; i < n;  i++)
        for ( int j = 0 ; j < m ; j++)
        {
        scanf("%d",&a[i][j]);
        if (a[i][j]==2)
        {
            s.x = i;
            s.y = j;
            s.d = 0;
            s.t = 6;
            vis[s.x][s.y][s.t] = true;
        }
        }
    if(!bfs())
    {
        puts("-1");
    }
        
    }
  
   
 #ifndef ONLINE_JUDGE  
  fclose(stdin);
  #endif
    return 0;
}