Imagine you are standing inside a two-dimensional maze composed of square cells which may or may not be filled with rock. You can move north, south, east or west one cell at a step. These moves are called walks.
One of the empty cells contains a box which can be moved to an
adjacent free cell by standing next to the box and then moving in the
direction of the box. Such a move is called a push. The box cannot be
moved in any other way than by pushing, which means that if you push it
into a corner you can never get it out of the corner again.

One of the empty cells is marked as the target cell. Your job is to
bring the box to the target cell by a sequence of walks and pushes. As
the box is very heavy, you would like to minimize the number of pushes.
Can you write a program that will work out the best such sequence?

The
input contains the descriptions of several mazes. Each maze description
starts with a line containing two integers r and c (both <= 20)
representing the number of rows and columns of the maze.

Following this are r lines each containing c characters. Each
character describes one cell of the maze. A cell full of rock is
indicated by a `#' and an empty cell is represented by a `.'. Your
starting position is symbolized by `S', the starting position of the box
by `B' and the target cell by `T'.

Input is terminated by two zeroes for r and c.

For
each maze in the input, first print the number of the maze, as shown in
the sample output. Then, if it is impossible to bring the box to the
target cell, print ``Impossible.''.

Otherwise, output a sequence that minimizes the number of pushes. If
there is more than one such sequence, choose the one that minimizes the
number of total moves (walks and pushes). If there is still more than
one such sequence, any one is acceptable.

Print the sequence as a string of the characters N, S, E, W, n, s, e
and w where uppercase letters stand for pushes, lowercase letters stand
for walks and the different letters stand for the directions north,
south, east and west.

Output a single blank line after each test case.

1 7

SB....T

1 7

SB..#.T

7 11

###########

#T##......#

#.#.#..####

#....B....#

#.######..#

#.....S...#

###########

8 4

....

.##.

.#..

.#..

.#.B

.##S

....

###T

0 0

Maze #1

EEEEE

Maze #2

Impossible.

Maze #3

eennwwWWWWeeeeeesswwwwwwwnNN

Maze #4

swwwnnnnnneeesssSSS

题目大意：推箱子。不过要求的是推的步数最少的路径，如果相同，则找到总步数最少的路径。
题目分析：因为涉及到路径的优先权问题，毫无疑问就要用到优先队列。接下来就是解这道题的核心步骤了，定义状态和状态转移。显然（其实，这个“显然”是花了老长时间想明白的），状态参量就是“你”和箱子的坐标、走过的路径和已经“推”过的步数和总步数。对于这道题，状态转移反而要比定义状态容易做到。

因为箱子的位置也是变化的，所以状态参量中要有箱子坐标。一开始没注意到这一点或者说就没想明白，导致瞎耽误了很多工夫！！！

代码如下：

 # include<iostream>

 # include<cstdio>

 # include<queue>

 # include<cstring>

 # include<algorithm>

 using namespace std;

 struct node

 {

     int mx,my,bx,by,pt,t,h;

     string s;

     node(int _mx,int _my,int _bx,int _by,int _pt,int _t,string _s):mx(_mx),my(_my),bx(_bx),by(_by),pt(_pt),t(_t),s(_s){}

     bool operator < (const node &a) const {

         if(pt==a.pt)

             return t>a.t;

         return pt>a.pt;

     }

 };

 int r,c,vis[][][][];

 char mp[][];

 string f[]={"nesw","NESW"};

 int d[][]={{-,},{,},{,},{,-}};

 bool ok(int x,int y)

 {

     if(x>=&&x<r&&y>=&&y<c)

         return true;

     return false;

 }

 void bfs(int mx,int my,int bx,int by)

 {

     priority_queue<node>q;

     memset(vis,,sizeof(vis));

     vis[mx][my][bx][by]=;

     q.push(node(mx,my,bx,by,,,""));

     while(!q.empty())

     {

         node u=q.top();

         q.pop();

         if(mp[u.bx][u.by]=='T'){

             cout<<u.s<<endl;

             return ;

         }

         for(int i=;i<;++i){

             int nx=u.mx+d[i][],ny=u.my+d[i][];

             if(ok(nx,ny)&&mp[nx][ny]!='#'){

                 if(nx==u.bx&&ny==u.by){

                     int nbx=u.bx+d[i][],nby=u.by+d[i][];

                     if(ok(nbx,nby)&&mp[nbx][nby]!='#'&&!vis[nx][ny][nbx][nby]){

                         vis[nx][ny][nbx][nby]=;

                         string s=u.s;

                         s+=f[][i];

                         q.push(node(nx,ny,nbx,nby,u.pt+,u.t+,s));

                     }

                 }else{

                     if(!vis[nx][ny][u.bx][u.by]){

                         vis[nx][ny][u.bx][u.by]=;

                         string s=u.s;

                         s+=f[][i];

                         q.push(node(nx,ny,u.bx,u.by,u.pt,u.t+,s));

                     }

                 }

             }

         }

     }

     printf("Impossible.\n");

 }

 int main()

 {

     int cas=,mx,my,bx,by;

     while(scanf("%d%d",&r,&c),r+c)

     {

         for(int i=;i<r;++i){

             scanf("%s",mp[i]);

             for(int j=;j<c;++j){

                 if(mp[i][j]=='S')

                     mx=i,my=j;

                 if(mp[i][j]=='B')

                     bx=i,by=j;

             }

         }

         printf("Maze #%d\n",++cas);

         bfs(mx,my,bx,by);

         printf("\n");

     }

     return ;

 }