POJ 3344 & HDU 2414 Chessboard Dance（模拟）

题目链接：

PKU:http://poj.org/problem?

id=3344

HDU:http://acm.hdu.edu.cn/showproblem.php?pid=2414

Description

Another boring Friday afternoon, Betty the Beetle thinks how to amuse herself. She goes out of her hiding place to take a walk around the living room in Bennett‘s house. Mr. and Mrs. Bennett are out to the theatre and there is a chessboard on the table! "The best time to practice my chessboard dance," Betty thinks! She gets so excited that she does not note that there are some pieces left on the board and starts the practice session! She has a script showing her how to move on the chessboard. The script is a sequence like the following example:

At each instant of time Betty, stands on a square of the chessboard, facing one of the four directions (up, down, left, right) when the board is viewed from the above. Performing a "move n" instruction, she moves n squares forward in her current direction. If moving n squares goes outside the board, she stays at the last square on the board and does not go out. There are three types of turns: turn right, turn left, and turn back, which change the direction of Betty. Note that turning does not change the position of Betty.

If Betty faces a chess piece when moving, she pushes that piece, together with all other pieces behind (a tough beetle she is!). This may cause some pieces fall of the edge of the chessboard, but she doesn‘t care! For example, in the following figure, the left board shows the initial state and the right board shows the state after performing the script in the above example. Upper-case and lower-case letters indicate the white and black pieces respectively. The arrow shows the position of Betty along with her direction. Note that during the first move, the black king (r) falls off the right edge of the board!

You are to write a program that reads the initial state of the board as well as the practice dance script, and writes the final state of the board after the practice.

Input

Output

Sample Input

.....c..
.p..A..t
D..>T.Pr
....aP.P
p.d.C...
.....p.R
........
........
move 2
turn right
move 3
turn left
turn left
move 1
#
--

Sample Output

.....c..
.p..A..t
D.....TP
....a..P
p.d.C^..
.......R
.....P..
.....p..

Source

题意：

模拟推箱子的过程，依照所给的步骤推完后输出终于的棋盘状态！

PS:

注意在推的过程中，不能走出棋盘外，所推的棋子能够出棋盘。

代码例如以下：

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxn = 27;
char mm[maxn][maxn];
struct node
{
    int x;
    int y;
    int dir;
} p;
char dir[4] = {‘v‘,‘>‘,‘^‘,‘<‘};
//写为下、右、上、左是为了turn back操作
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};

int vis(int x, int y)
{
    if(x<1 || x>8)
        return 0;
    if(y<1 || y>8)
        return 0;
    return 1;
}
void DFS(int x, int y)
{
    if(mm[x][y]==‘.‘)
    {
        mm[x][y]=mm[x-dx[p.dir]][y-dy[p.dir]];
        mm[x-dx[p.dir]][y-dy[p.dir]]=‘.‘;
    }
    else
    {
        DFS(x+dx[p.dir],y+dy[p.dir]);
        mm[x][y]=mm[x-dx[p.dir]][y-dy[p.dir]];
        mm[x-dx[p.dir]][y-dy[p.dir]]=‘.‘;
    }
}
void Rush()
{
    for(int i = 0; i <= 8; i++)
    {
        //初始化棋盘外的一圈全为‘.‘
        mm[0][i]=mm[i][0]=mm[9][i]=mm[i][9]=‘.‘;
    }
    mm[p.x][p.y] = ‘.‘;
    if(!vis(p.x+dx[p.dir],p.y+dy[p.dir]))
        return ;
    DFS(p.x+dx[p.dir],p.y+dy[p.dir]);
    p.x += dx[p.dir];
    p.y += dy[p.dir];
}

int main()
{
    char a[maxn], b[maxn];
    int step;
    while(scanf("%s",mm[1]+1))
    {
        if(mm[1][1] == ‘-‘)
            break;
        for(int i = 2; i <= 8; i++)
        {
            scanf("%s",mm[i]+1);
        }
        for(int i = 1; i <= 8; i++)
        {
            for(int j = 1; j <= 8; j++)
            {
                if(mm[i][j] == ‘v‘)
                {
                    p.x = i,p.y = j,p.dir = 0;
                }
                else if(mm[i][j] == ‘>‘)
                {
                    p.x = i,p.y = j,p.dir = 1;
                }
                else if(mm[i][j] == ‘^‘)
                {
                    p.x = i,p.y = j,p.dir = 2;
                }
                else if(mm[i][j] == ‘<‘)
                {
                    p.x = i,p.y = j,p.dir = 3;
                }
            }
        }
        while(scanf("%s",a))
        {
            if(a[0] == ‘#‘)
                break;
            if(a[0] == ‘t‘)
            {
                scanf("%s",b);
                if(b[0] == ‘l‘)
                    p.dir=(p.dir+1)%4;
                else if(b[0]==‘r‘)
                    p.dir=(p.dir+3)%4;
                else
                    p.dir=(p.dir+2)%4;
            }
            else
            {
                scanf("%d",&step);
                for(int i = 0; i < step; i++)
                {
                    Rush();
                }
            }
        }
        mm[p.x][p.y] = dir[p.dir];
        for(int i = 1; i <= 8; i++)
        {
            for(int j = 1; j <= 8; j++)
            {
                printf("%c",mm[i][j]);
            }
            printf("\n");
        }
        printf("\n");
    }
    return 0;
}