zoukankan      html  css  js  c++  java
  • nyoj 483 Nightmare

    Nightmare

    时间限制:1000 ms  |  内存限制:65535 KB

    难度:4

    描述

    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.

    输入

    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.

    输出

    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.

    样例输入

    2

    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

    样例输出

    4

    -1

    #include<iostream>
    #include<queue>
    #include<cstring>
    #include<cstdio>
    using namespace std;
    struct node{
    	int x,y,step,time;
    };
    int dir[4][2]={1,0,0,1,-1,0,0,-1},map[12][12];
    bool ever[12][12];
    int BFS(int x,int y)
    {
    	node cur,next;
    	cur.x = x;cur.y = y;cur.step = 0,cur.time = 6;
    	queue<node>q;
    	q.push(cur);
    	while(!q.empty())
    	{
    		cur = q.front();
    		q.pop();
    		if(map[cur.x][cur.y]==3)
    		{
    			return cur.step;
    		}
    		if(cur.time == 1) continue;
    		for(int i=0;i<4;++i)
    		{
    			next.x = cur.x + dir[i][0];
    			next.y = cur.y + dir[i][1];
    			next.step = cur.step + 1;
    			next.time = cur.time - 1;
    			if(map[next.x][next.y]&&!ever[next.x][next.y])
    			{
    				if(map[next.x][next.y] == 4)
    				{
    					next.time = 6;
    					map[next.x][next.y] = 1;
    				}
    				q.push(next);
    				//ever[next.x][next.y] = 1;
    			}
    		}
    	}
    	return -1;
    }
    int main()
    {
    	int n,m,T,startx=1,starty=1;
    	scanf("%d",&T);
    	while(T--)
    	{
    		//memset(ever,0,sizeof(ever));
    		memset(map,0,sizeof(map));
    		scanf("%d%d",&n,&m);
    		for(int i=1;i<=n;++i)
    		{
    			for(int j=1;j<=m;++j)
    			{
    				scanf("%d",&map[i][j]);
    				if(map[i][j]==2) startx = i,starty = j;
    			}
    		}
    		 printf("%d
    ",BFS(startx,starty));
    		
    	}
    	return 0;
    }           
    

      

  • 相关阅读:
    linux内核分析第八周理解进程调度时机跟踪分析进程调度与进程切换的过程
    linux内核分析第六周分析Linux内核创建一个新进程的过程
    Linux内核学习总结
    Linux内核分析第一周通过分析汇编代码理解计算机是如何工作的
    linux内核分析第五周分析system_call中断处理过程
    linux内核分析第三周跟踪分析Linux内核的启动过程
    转载:Understanding WPF Application Lifecycle
    Quick Sort 快速排序
    C#中的Immutable(不变的)
    一个lock和一个deadlock的例子
  • 原文地址:https://www.cnblogs.com/zhangliu/p/7053061.html
Copyright © 2011-2022 走看看