HNUNUOJ11241 Sokoban[模拟推箱子]

Sokoban

Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB

Total submit users: 17, Accepted users: 14

Problem 11241 : No special judgement

Problem description

  

Soko-ban is a Japanese word for a warehouse worker, and the name of a classic computer game created in the 1980s. It is a one-player game with the following premise. A single worker is in an enclosed warehouse with one or more boxes. The goal is to move those boxes to a set of target locations, with the number of target locations equalling the number of boxes. The player indicates a direction of motion for the worker using the arrow keys (up, down, left, right), according to the following rules.

• If the indicated direction of motion for the worker leads to an empty location (i.e., one that does not have a box or wall), the worker advances by one step in that direction.
• If the indicated direction of motion would cause the worker to move into a box, and the location on the other side of the box is empty, then both the worker and the box move one spot in that direction (i.e., the worker pushes the box).
• If the indicated direction of motion for a move would cause the worker to move into a wall, or to move into a box that has another box or a wall on its opposite side, then no motion takes place for that keystroke.

The goal is to simultaneously have all boxes on the target locations. In that case, the player is successful (and as a formality, all further keystrokes will be ignored).

The game has been studied by computer scientists (in fact, one graduate student wrote his entire Ph.D. dissertation about the analysis of sokoban). Unfortunately, it turns out that finding a solution is very difficult in general, as it is both NP-hard and PSPACE-complete. Therefore, your goal will be a simpler task: simulating the progress of a game based upon a player's sequence of keystrokes. For the sake of input and output, we describe the state of a game using the following symbols:

Symbol	Meaning
.	empty space
#	wall
+	empty target location
b	box
B	box on a target location
w	worker
W	worker on a target location

For example, the initial configuration diagrammed at the beginning of this problem appears as the first input case belo

Input

   Each game begins with a line containing integers R and C, where 4 ≤ R ≤ 15 represents the number of rows, and 4 ≤ C ≤ 15 represents the number of columns. Next will be R lines representing the R rows from top to bottom, with each line having precisely C characters, from left-to-right. Finally, there is a line containing at most 50 characters describing the player's sequence of keystrokes, using the symbols U, D, L, and R respectively for up, down, left, and right. You must read that entire sequence from the input, even though a particular game might end successfully prior to the end of the sequence. The data set ends with the line 0 0.

We will guarantee that each game has precisely one worker, an equal number of boxes and locations, at least one initially misplaced box, and an outermost boundary consisting entirely of walls.

Output

  For each game, you should first output a line identifying the game number, beginning at 1, and either the word complete or incomplete, designating whether or not the player successfully completed that game. Following that should be a representation of the final board configuration.

Sample Input

8 9
#########
#...#...#
#..bb.b.#
#...#w#.#
#...#b#.#
#...++++#
#...#..##
#########
ULRURDDDUULLDDD
6 7
#######
#..####
#.+.+.#
#.bb#w#
##....#
#######
DLLUDLULUURDRDDLUDRR
0 0

Sample Output

Game 1: incomplete
#########
#...#...#
#..bb...#
#...#.#.#
#...#.#.#
#...+W+B#
#...#b.##
#########
Game 2: complete
#######
#..####
#.B.B.#
#.w.#.#
##....#
#######

Problem Source

  mcpc2011 

Submit   Discuss   Judge Status  Problems  Ranklist 

模拟推箱子，按照一定的步骤去走

code:

#include<iostream>
using namespace std;

int r,c;
bool flag;
int sx,sy;
char map[20][20];
char mov[60];
int cnt;
int dir[4][2]={
    -1,0,
    1,0,
    0,-1,
    0,1
};

void solve()
{
    int i,dr;
    int len=strlen(mov);
    for(i=0;i<len;i++)
    {
        if(mov[i]=='U')        dr=0;
        else if(mov[i]=='D')    dr=1;
        else if(mov[i]=='L')    dr=2;
        else    dr=3;
        int tx=sx+dir[dr][0];
        int ty=sy+dir[dr][1];
        if(map[tx][ty]!='#')
        {
            int nextx=tx+dir[dr][0];
            int nexty=ty+dir[dr][1];
            if(map[tx][ty]=='.')
            {
                map[tx][ty]='w';
                if(map[sx][sy]=='W')
                    map[sx][sy]='+';
                else
                    map[sx][sy]='.';
                sx+=dir[dr][0];
                sy+=dir[dr][1];
            }
            else if(map[tx][ty]=='+')
            {
                map[tx][ty]='W';
                if(map[sx][sy]=='W')
                    map[sx][sy]='+';
                else
                    map[sx][sy]='.';
                sx+=dir[dr][0];
                sy+=dir[dr][1];
            }
            else if(map[tx][ty]=='b')
            {
                if(map[nextx][nexty]=='.')
                {
                    map[nextx][nexty]='b';
                    map[tx][ty]='w';
                    if(map[sx][sy]=='W')
                         map[sx][sy]='+';
                    else
                        map[sx][sy]='.';
                        sx+=dir[dr][0];
                    sy+=dir[dr][1];
                }
                else if(map[nextx][nexty]=='+')
                {
                    map[nextx][nexty]='B';
                    map[tx][ty]='w';
                    if(map[sx][sy]=='W')
                         map[sx][sy]='+';
                    else
                        map[sx][sy]='.';
                        sx+=dir[dr][0];
                    sy+=dir[dr][1];
                    cnt--;
                }
            }
            else if(map[tx][ty]=='B')
            {
                if(map[nextx][nexty]=='.')
                {
                    map[nextx][nexty]='b';
                    map[tx][ty]='W';
                    if(map[sx][sy]=='W')
                         map[sx][sy]='+';
                    else
                        map[sx][sy]='.';
                        sx+=dir[dr][0];
                    sy+=dir[dr][1];
                    cnt++;
                }
                else if(map[nextx][nexty]=='+')
                {
                    map[nextx][nexty]='B';
                    map[tx][ty]='W';
                    if(map[sx][sy]=='W')
                         map[sx][sy]='+';
                    else
                        map[sx][sy]='.';
                        sx+=dir[dr][0];
                    sy+=dir[dr][1];
                }
            }
        }
        if(cnt==0)
        {
            flag=true;
            return;
        }
    }
}

int main()
{
    int i,j;
    int cases=1;
    while(~scanf("%d%d",&r,&c),r||c)
    {
        cnt=0;
        flag=false;
        getchar();
        for(i=0;i<r;i++)
        {
            for(j=0;j<c;j++)
            {
                scanf("%c",&map[i][j]);
                if(map[i][j]=='w'||map[i][j]=='W')
                {
                    sx=i;
                    sy=j;
                }
                if(map[i][j]=='b')
                    cnt++;
            }
            getchar();
        }
        gets(mov);
        solve();
        if(flag)
            printf("Game %d: complete\n",cases++);
        else
            printf("Game %d: incomplete\n",cases++);
        for(i=0;i<r;i++)
        {
            for(j=0;j<c;j++)
            {
                printf("%c",map[i][j]);
            }
            printf("\n");
        }
    }
    return 0;
}
/*
6 8
########
#......#
#..b...#
#..WB..#
#......#
########
LUURD
*/