HDU 1072 Nightmare

<h1 style="color: rgb(26, 92, 200); text-align: center; font-family: "Times New Roman";">Nightmare</h1><span style="font-family: "Times New Roman";font-size:14px; text-align: -webkit-center;"><strong><span style="font-family: Arial; font-size: 12px; color: green;">Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9700    Accepted Submission(s): 4720</span></strong></span><br style="font-family: "Times New Roman";font-size:14px; text-align: -webkit-center;" /><br style="font-family: "Times New Roman";font-size:14px; text-align: -webkit-center;" /><div class="panel_title" align="left" style="height: 38px; padding: 0px 14px; color: rgb(124, 169, 237); font-size: 18px; font-family: Arial; font-weight: bold; background: url("panel-title.png") left bottom no-repeat transparent;">Problem Description</div><div class="panel_content" style="height: auto; margin: 0px; padding: 0px 20px; font-size: 14px; font-family: "Times New Roman"; background: url("panel-content.png") repeat-y;">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.</div><div class="panel_bottom" style="height: auto; margin: 0px; font-family: "Times New Roman";font-size:14px; text-align: -webkit-center; background: url("panel-bottom.png") left top no-repeat;"> </div><br style="font-family: "Times New Roman";font-size:14px; text-align: -webkit-center;" /><div class="panel_title" align="left" style="height: 38px; padding: 0px 14px; color: rgb(124, 169, 237); font-size: 18px; font-family: Arial; font-weight: bold; background: url("panel-title.png") left bottom no-repeat transparent;">Input</div><div class="panel_content" style="height: auto; margin: 0px; padding: 0px 20px; font-size: 14px; font-family: "Times New Roman"; background: url("panel-content.png") repeat-y;">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.</div><div class="panel_bottom" style="height: auto; margin: 0px; font-family: "Times New Roman";font-size:14px; text-align: -webkit-center; background: url("panel-bottom.png") left top no-repeat;"> </div><br style="font-family: "Times New Roman";font-size:14px; text-align: -webkit-center;" /><div class="panel_title" align="left" style="height: 38px; padding: 0px 14px; color: rgb(124, 169, 237); font-size: 18px; font-family: Arial; font-weight: bold; background: url("panel-title.png") left bottom no-repeat transparent;">Output</div><div class="panel_content" style="height: auto; margin: 0px; padding: 0px 20px; font-size: 14px; font-family: "Times New Roman"; background: url("panel-content.png") repeat-y;">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.</div><div class="panel_bottom" style="height: auto; margin: 0px; font-family: "Times New Roman";font-size:14px; text-align: -webkit-center; background: url("panel-bottom.png") left top no-repeat;"> </div><br style="font-family: "Times New Roman";font-size:14px; text-align: -webkit-center;" /><div class="panel_title" align="left" style="height: 38px; padding: 0px 14px; color: rgb(124, 169, 237); font-size: 18px; font-family: Arial; font-weight: bold; background: url("panel-title.png") left bottom no-repeat transparent;">Sample Input</div><div class="panel_content" style="height: auto; margin: 0px; padding: 0px 20px; font-size: 14px; font-family: "Times New Roman"; background: url("panel-content.png") repeat-y;"><pre style="word-wrap: break-word; white-space: pre-wrap; margin-top: 0px; margin-bottom: 0px;"><div style="font-family: "Courier New", Courier, monospace;">33 32 1 11 1 01 1 34 82 1 1 0 1 1 1 01 0 4 1 1 0 4 11 0 0 0 0 0 0 11 1 1 4 1 1 1 35 81 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 </div>

 

Sample Output

4-113

我的天，V[]数组开成BOOL   错的我一脸懵逼。

还有一些细节的错误，找了好久。

总的来说，就是bfs，细心一点，就能过。

# include<iostream># include<string># include<queue># include<cstdio># include<cstring>using namespace std;int map[10][10],reset[10][10];int n,m;struct node{   int x,y;   int step,time;//记录步数和剩余时间};int dir[4][2]={1,0,0,1,-1,0,0,-1};bool judge(int x,int y){   if(x<0||x>=n||y<0||y>=m)     return false;   return true;}void bfs(int xx,int yy){    int i,j,ans1=0,ans2=0;    int v[10][10];    bool flag=false;    memset(v,0,sizeof(v));    node t;    queue<node>q;    v[xx][yy]=6;    t.x=xx;t.y=yy;t.step=0;t.time=6;    q.push(t);    while(!q.empty()){        node s=q.front();        q.pop();        for(i=0;i<4;i++){            t.x=s.x+dir[i][0];            t.y=s.y+dir[i][1];            if(judge(t.x,t.y)&&map[t.x][t.y]!=0){                t.step=s.step+1;                t.time=s.time-1;                if(map[t.x][t.y]==4) t.time=6;                else if(map[t.x][t.y]==3){                    ans1=s.step+1;                    ans2=s.time-1;                    flag=true;                }                if(t.time>1&&v[t.x][t.y]<t.time){                     //   for(int z=0;z<n;z++){                     //       for(int p=0;p<m;p++)                     //          cout<<v[z][p]<<" ";                     //       cout<<endl;                     //   }cout<<endl;                    v[t.x][t.y]=t.time;                    q.push(t);                }            }if(flag) break;        }    }if(flag){                if(ans2>0)                    printf("%d",ans1);                else                    printf("-1");            }            else                printf("-1");            printf("\n");}int main(){    int T,i,j,sx,sy,ex,ey;    scanf("%d",&T);    while(T--){        scanf("%d%d",&n,&m);        for(i=0;i<n;i++)            for(j=0;j<m;j++){                scanf("%d",&map[i][j]);                if(map[i][j]==2) sx=i,sy=j;            }    bfs(sx,sy);    }}