poj2313 Battle City BFS

原创于 2018-07-31 22:58:37 发布 · 195 阅读

0 ·

CC 4.0 BY-SA版权

bfs暴搜专栏收录该内容

5 篇文章

订阅专栏

Battle City

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

思路：

这道题挺有意思的哈，说的是个游戏，求从Y点到达T点的最短路径，遇到砖墙(B）可以站在原地把它锤了，其实就是需要两步，遇到空格（E）*就直接走，遇到河(R）过不去，那么就可以直接bfs直接搞了

代码：

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<map>
#include<set>
#include<vector>
#include<string>
#include<cstring>
#include<stack>
#include<queue>
#define ll long long
using namespace std;
int m,n;
const int maxn = 300 + 5;
char str[maxn][maxn];
bool vis[maxn][maxn];
int dx[4][2] = {1,0,-1,0,0,1,0,-1};
struct node
{
   int x,y,step;
   friend bool operator < (node a,node b)
   {
       return a.step > b.step;
   }
};
void bfs(int x1,int y1,int x2,int y2)
{
   memset(vis,0,sizeof(vis));
   int ans = -1;
   priority_queue <node> que;
   node p;
   p.x = x1,p.y = y1,p.step = 0;
   que.push(p);
   vis[x1][y1] = 1;
   while (!que.empty())
   {
       p = que.top();
       que.pop();
       node p2 = p;
       if (p.x == x2 && p.y == y2)
       {
           ans = p.step;
           break;
       }
       for (int i = 0;i < 4;i ++)
       {
           p2.x = p.x + dx[i][0],p2.y = p.y + dx[i][1];
           if (vis[p2.x][p2.y]) continue;
           if (p2.x < 0 || p2.x >= m || p2.y < 0 || p2.y >= n) continue;
           if (str[p2.x][p2.y] == 'S') continue;
           if (str[p2.x][p2.y] == 'R') continue;
           if (str[p2.x][p2.y] == 'E' || str[p2.x][p2.y] == 'T') p2.step = p.step + 1;
           else if (str[p2.x][p2.y] == 'B') p2.step = p.step + 2;
           vis[p2.x][p2.y] = 1;
           que.push(p2);
       }
   }
   printf("%d\n",ans);
}
int main()
{
   int bx,by,ex,ey;
   while (~scanf("%d %d",&m,&n) && (m || n))
   {
       for (int i = 0;i < m;i ++)
           scanf("%s",str[i]);
       for (int i = 0;i < m;i ++)
           for (int j = 0;j < n;j ++)
           {
               if (str[i][j] == 'Y')
                   bx = i,by = j;
               if (str[i][j] == 'T')
                   ex = i,ey = j;
           }
       bfs(bx,by,ex,ey);
   }
   return 0;
}