Battle City

最新推荐文章于 2021-02-13 06:43:09 发布

神的孩子已被注册

最新推荐文章于 2021-02-13 06:43:09 发布

阅读量502

点赞数

分类专栏：队列与堆栈

本文链接：https://blog.csdn.net/u013739363/article/details/24997901

版权

队列与堆栈专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Battle City

Time Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)

Total Submission(s) : 1 Accepted Submission(s) : 1

Problem Description

Many of us had played the game "Battle city" in our childhood, and some people (like me) even often play it on computer now.

What we are discussing is a simple edition of this game. Given a map that consists of empty spaces, rivers, steel walls and brick walls only. Your task is to get a bonus as soon as possible suppose that no enemies will disturb you (See the following picture).

Your tank can't move through rivers or walls, but it can destroy brick walls by shooting. A brick wall will be turned into empty spaces when you hit it, however, if your shot hit a steel wall, there will be no damage to the wall. In each of your turns, you can choose to move to a neighboring (4 directions, not 8) empty space, or shoot in one of the four directions without a move. The shot will go ahead in that direction, until it go out of the map or hit a wall. If the shot hits a brick wall, the wall will disappear (i.e., in this turn). Well, given the description of a map, the positions of your tank and the target, how many turns will you take at least to arrive there?

Input

The input consists of several test cases. The first line of each test case contains two integers M and N (2 <= M, N <= 300). Each of the following M lines contains N uppercase letters, each of which is one of 'Y' (you), 'T' (target), 'S' (steel wall), 'B' (brick wall), 'R' (river) and 'E' (empty space). Both 'Y' and 'T' appear only once. A test case of M = N = 0 indicates the end of input, and should not be processed.

Output

For each test case, please output the turns you take at least in a separate line. If you can't arrive at the target, output "-1" instead.

Sample Input

  
  
   
   3 4
YBEB
EERE
SSTE
0 0

Sample Output

  
  
   
   8
  
  
  
  
   
   

  
  
  
  
   
   题意：寻找最短路径
  
  
  
  
   
   

  
  
  
  
   
   此题可以用优先队列+广搜解决；首先得知道优先队列的定义和使用；
  
  
  
  
   
   

  
  
  
  
   
   
   
   priority queue<>que    http://blog.csdn.net/juhanzhang/article/details/6436592
  
  
  
  

  
  
  
  

  
  
  
  
   
   #include <iostream>
#include <queue>
#include <cstdio>
#include <string>
#include <cstring>
using namespace std;
int dir[4][2]= {{0, 1}, {0, -1}, {1, 0}, {-1, 0}},a,b,visit[305][305];
char map[305][305];
typedef struct tank
{
    int x,y,cost;
};
bool operator < (const tank &p,const tank &q)
{
    return p.cost > q.cost;
}
int judge(int i,int j)
{
    if(i < 0 || j < 0 || i >= a || j >= b||map[i][j] == 'R' || map[i][j] == 'S' || visit[i][j]==1)
        return 1;
    return 0;
}

int bfs(int p,int q)
{
    int m,n,i;
    priority_queue <tank> que;
    tank in,out;
    in.x=p;
    in.y=q;
    in.cost=0;
    que.push(in);
    while(!que.empty())
    {
        out=que.top();
        que.pop();
        if(map[out.x][out.y]=='T')
        {
            printf("%d\n",out.cost);
            return 1;
        }
        for(i=0; i<4; i++)
        {
            m=out.x+dir[i][0];
            n=out.y+dir[i][1];
            if(!judge(m,n))
            {
                visit[m][n]=1;
                in.x=m;
                in.y=n;
                in.cost=out.cost+1;
                if(map[m][n]=='B')
                    in.cost++;
                que.push(in);
            }
        }
    }
    return 0;
}
int main()
{
    int i,j;
    while(scanf("%d %d",&a,&b)&&(a+b))
    {
        getchar();
        memset(visit,0,sizeof(visit));
        for(i=0; i<a; i++)
        {
            for(j=0; j<b; j++)
                scanf("%c",&map[i][j]);
            getchar();
        }
        for(i=0; i<a; i++)
        {
            for(j=0; j<b; j++)
            {
                if(map[i][j]=='Y')
                {
                    visit[i][j]=1;
                    if(!bfs(i,j))
                        printf("-1\n");
                    break;
                }
            }
        }
    }
    return 0;
}