首页 > 考试 > 其他 > 正文
POJ 1475:Pushing Boxes
2017-08-05 14:53:23       个评论    来源:Mitsuha_的博客  
收藏    我要投稿

POJ 1475:Pushing Boxes。

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?
\
Input
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.
Output
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.
Sample Input
1 7
SB....T
1 7
SB..#.T
7 11
###########
#T##......#
#.#.#..####
#....B....#
#.######..#
#.....S...#
###########
8 4
....
.##.
.#..
.#..
.#.B
.##S
....
###T
0 0
Sample Output
Maze #1
EEEEE

Maze #2
Impossible.

Maze #3
eennwwWWWWeeeeeesswwwwwwwnNN

Maze #4
swwwnnnnnneeesssSSS

 

 

思路:BFS。用v[x][y][sx][sy]来标记箱子在(x,y),人在(sx,sy)时的状态。用way[x][y][sx][sy]来保存路径。

 

 

#include
#include
#include
#include
using namespace std;
struct six
{
	int push,walk;
	int v;
}v[20][20][20][20];
struct data
{
	char dir;
	int fbx,fby,fsx,fsy;
}way[20][20][20][20];
struct lenka
{
	int bx,by,sx,sy;
};
int n,m;
char s[21][21];
int d[4][2]={-1,0,0,-1,1,0,0,1};
void bfs(int bx,int by,int sx,int sy)
{
	memset(v,0,sizeof v);
	v[bx][by][sx][sy].v=1;
	v[bx][by][sx][sy].push=0;
	v[bx][by][sx][sy].walk=0;
	way[bx][by][sx][sy].dir=0;
	queuep;
	p.push((lenka){bx,by,sx,sy});
	while(!p.empty())
	{
		lenka now=p.front();p.pop();
		for(int i=0;i<4;i++)
		{
			int nx=now.sx+d[i][0];
			int ny=now.sy+d[i][1];
			if(nx>=0&&nx=0&&ny=0&&bx=0&&byv[now.bx][now.by][now.sx][now.sy].push+1)||((v[bx][by][nx][ny].push==v[now.bx][now.by][now.sx][now.sy].push+1)&&(v[bx][by][nx][ny].walk>v[now.bx][now.by][now.sx][now.sy].walk)))
						{
							v[bx][by][nx][ny].push=v[now.bx][now.by][now.sx][now.sy].push+1;
							v[bx][by][nx][ny].walk=v[now.bx][now.by][now.sx][now.sy].walk;
							v[bx][by][nx][ny].v=1;
							if(i==0)way[bx][by][nx][ny].dir='N';
							if(i==1)way[bx][by][nx][ny].dir='W';
							if(i==2)way[bx][by][nx][ny].dir='S';
							if(i==3)way[bx][by][nx][ny].dir='E';
							way[bx][by][nx][ny].fbx=now.bx;
							way[bx][by][nx][ny].fby=now.by;
							way[bx][by][nx][ny].fsx=now.sx;
							way[bx][by][nx][ny].fsy=now.sy;
							p.push((lenka){bx,by,nx,ny});
						}
					}
				}
				else  //人所在的位置推不了箱子
				{
					if(v[now.bx][now.by][nx][ny].v==0||(v[now.bx][now.by][nx][ny].push>v[now.bx][now.by][now.sx][now.sy].push)||((v[now.bx][now.by][nx][ny].push==v[now.bx][now.by][now.sx][now.sy].push&&v[now.bx][now.by][nx][ny].walk>v[now.bx][now.by][now.sx][now.sy].walk+1)))
					{
						v[now.bx][now.by][nx][ny].push=v[now.bx][now.by][now.sx][now.sy].push;
						v[now.bx][now.by][nx][ny].walk=v[now.bx][now.by][now.sx][now.sy].walk+1;
						v[now.bx][now.by][nx][ny].v=1;
						if(i==0)way[now.bx][now.by][nx][ny].dir='n';
						if(i==1)way[now.bx][now.by][nx][ny].dir='w';
						if(i==2)way[now.bx][now.by][nx][ny].dir='s';
						if(i==3)way[now.bx][now.by][nx][ny].dir='e';
						way[now.bx][now.by][nx][ny].fbx=now.bx;
						way[now.bx][now.by][nx][ny].fby=now.by;
						way[now.bx][now.by][nx][ny].fsx=now.sx;
						way[now.bx][now.by][nx][ny].fsy=now.sy;
						p.push((lenka){now.bx,now.by,nx,ny});
					}
				}
			}
		}
	}
}
void dfs(int bx,int by,int nx,int ny)
{
	if(way[bx][by][nx][ny].dir==0)return;
	dfs(way[bx][by][nx][ny].fbx,way[bx][by][nx][ny].fby,way[bx][by][nx][ny].fsx,way[bx][by][nx][ny].fsy);
	printf("%c",way[bx][by][nx][ny].dir);
}
int main()
{
	int cas=1;
	while(scanf("%d%d",&n,&m)!=EOF&&(n||m))
	{
		int sx,sy,bx,by,tx,ty;
		memset(way,0,sizeof way);
		for(int i=0;i=0&&x=0&&y

 

点击复制链接 与好友分享!回本站首页
上一篇:WUST OJ 1498:
下一篇:hdu 1231 最大连续子序列
相关文章
图文推荐
文章
推荐
点击排行

关于我们 | 联系我们 | 广告服务 | 投资合作 | 版权申明 | 在线帮助 | 网站地图 | 作品发布 | Vip技术培训
版权所有: 红黑联盟--致力于做实用的IT技术学习网站