Battle City 优先队列+bfs

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

这道题一开始就想到了优先队列，可就是不对，原来是优先队列建立的位置不对，建立在函数外，如果队列不空，会影响下组的结果，所以让他随着函数共存亡把

代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <string>
#include <cmath>
using namespace std;
int n,m,sx,sy,tx,ty;
char map[][];
char vis[][];
int dir[][]={,,,,,-,-,};
struct que
{
    int x,y,d;
    friend bool operator <(que a,que b)
    {
        return a.d>b.d;
    }
}temp,cn;
//priority_queue<que> q;///优先队列要建立在函数里 否则队列不空影响结果
int bfs(int x,int y)
{
    priority_queue<que> q;
    temp.x=x,temp.y=y,temp.d=,vis[sx][sy]=;
    q.push(temp);
    while(!q.empty())
    {
        cn=q.top();
        q.pop();
        for(int i=;i<;i++)
        {
            tx=cn.x+dir[i][];
            ty=cn.y+dir[i][];
            if(tx<||ty<||tx>=n||ty>=m||vis[tx][ty])continue;
            vis[tx][ty]=;
            int d=cn.d+(map[tx][ty]=='B'?:);
                temp.x=tx,temp.y=ty,temp.d=d;
                q.push(temp);
            if(map[tx][ty]=='T')return d;
        }
    }
    return -;
}
int main()
{
   while(scanf("%d%d",&n,&m))
   {
       if(!n&&!m)break;
       memset(vis,,sizeof(vis));
       sx=sy=;
       for(int i=;i<n;i++)
       {
           for(int j=;j<m;j++)
           {
               cin>>map[i][j];
               if(map[i][j]=='Y')sx=i,sy=j;
               else if(map[i][j]=='S'||map[i][j]=='R')vis[i][j]=;
           }
       }
       cout<<bfs(sx,sy)<<endl;
   }
}