UVA227 Puzzle【模拟】

  A children’s puzzle that was popular 30 years ago consisted of a 5×5 frame which contained 24 smallsquares of equal size. A unique letter of the alphabet was printed on each small square. Since therewere only 24 squares within the frame, the frame also contained an empty position which was the samesize as a small square. A square could be moved into that empty position if it were immediately to theright, to the left, above, or below the empty position. The object of the puzzle was to slide squaresinto the empty position so that the frame displayed the letters in alphabetical order.

  The illustration below represents a puzzle in its original configuration and in its configuration afterthe following sequence of 6 moves:

1) The square above the empty position moves.

2) The square to the right of the empty position moves.

3) The square to the right of the empty position moves.

4) The square below the empty position moves.

5) The square below the empty position moves.

6) The square to the left of the empty position moves.

Write a program to display resulting frames given their initial configurations and sequences of moves.

Input

  Input for your program consists of several puzzles. Each is described by its initial configuration andthe sequence of moves on the puzzle. The first 5 lines of each puzzle description are the startingconfiguration. Subsequent lines give the sequence of moves.

  The first line of the frame display corresponds to the top line of squares in the puzzle. The otherlines follow in order. The empty position in a frame is indicated by a blank. Each display line containsexactly 5 characters, beginning with the character on the leftmost square (or a blank if the leftmostsquare is actually the empty frame position). The display lines will correspond to a legitimate puzzle.

  The sequence of moves is represented by a sequence of As, Bs, Rs, and Ls to denote which squaremoves into the empty position. A denotes that the square above the empty position moves; B denotesthat the square below the empty position moves; L denotes that the square to the left of the emptyposition moves; R denotes that the square to the right of the empty position moves. It is possible thatthere is an illegal move, even when it is represented by one of the 4 move characters. If an illegal moveoccurs, the puzzle is considered to have no final configuration. This sequence of moves may be spreadover several lines, but it always ends in the digit 0. The end of data is denoted by the character Z.

Output

  Output for each puzzle begins with an appropriately labeled number (Puzzle #1, Puzzle #2, etc.). Ifthe puzzle has no final configuration, then a message to that effect should follow. Otherwise that finalconfiguration should be displayed.

  Format each line for a final configuration so that there is a single blank character between twoadjacent letters. Treat the empty square the same as a letter. For example, if the blank is an interiorposition, then it will appear as a sequence of 3 blanks — one to separate it from the square to the left,one for the empty position itself, and one to separate it from the square to the right.

  Separate output from different puzzle records by one blank line.Note: The first record of the sample input corresponds to the puzzle illustrated above.

Sample Input

TRGSJ

XDOKI

M VLN

WPABE

UQHCF

ARRBBL0

ABCDE

FGHIJ

KLMNO

PQRS

TUVWX

AAA

LLLL0

ABCDE

FGHIJ

KLMNO

PQRS

TUVWX

AAAAABBRRRLL0

Z

Sample Output

Puzzle #1:

T R G S J

X O K L I

M D V B N

W P  A E

U Q H C F

Puzzle #2:

 A B C D

F G H I E

K L M N J

P Q R S O

T U V W X

Puzzle #3:

This puzzle has no final configuration.

 

问题链接：UVA227 Puzzle

问题简述：

  一个5×5的网格，一个格子是空的，其他格子各有一个字母，一共有四种指令：A,B,L,R,分别表示把空格上、下、左、右的相邻字母移到空格中。输入初始网格和指令序列，指令序列以数字0结束，输出指令执行完毕后的网格。如果有非法指令，应输出"This puzzle has no final configuration."。

问题分析：

　　这个题的问题可能会出在输入处理上。根据实例，输入的指令序列可能是多行的，需要小心处理。

　　另外一点，当模拟出错时，需要正确处理。模拟出错的情况有两种，一是输入指令错误；二是输入指令虽然正确，而把空格移动到网格外面的情况。

程序说明：

　　程序中，封装了函数move()用于接受指令，模拟根据指令空格的移动过程。主程序则用于处理输入、输出和整体控制。

 

AC的C语言程序如下：

 

/* UVA227 Puzzle */

#include <stdio.h>

#define MAXN 5

char grid[MAXN][MAXN];
int blankrow, blankcol, nextrow, nextcol;

// 移动：如果指令正确则移动，并且返回0;否则返回1。
int move(char move)
{
    if(move == 'A') {
        nextrow = blankrow - 1;
        nextcol = blankcol;
    } else if(move == 'B') {
        nextrow = blankrow + 1;
        nextcol = blankcol;
    } else if(move == 'L') {
        nextrow = blankrow;
        nextcol = blankcol - 1;
    } else if(move == 'R') {
        nextrow = blankrow;
        nextcol = blankcol + 1;
    } else
        return 1;

    if(nextrow >= 0 && nextrow < MAXN && nextcol >= 0 && nextcol < MAXN) {
        grid[blankrow][blankcol] = grid[nextrow][nextcol];
        grid[nextrow][nextcol] = ' ';

        blankrow = nextrow;
        blankcol = nextcol;
        return 0;
    } else
        return 1;
}

int main(void)
{
    int caseno=0, okflag, i, j;
    char c;

    while((c=getchar()) != 'Z') {
        // 读入数据
        for(i=0; i<MAXN; i++)
            for(j=0; j<MAXN; j++) {
                grid[i][j] = c;
                if(c == ' ' || c == '\n') {
                    blankrow = i;
                    blankcol = j;
                    grid[i][j] = ' ';
                }
                c = getchar();
                if(j == MAXN-1 && c == '\n')
                    c = getchar();
            }

        // 模拟过程：一边读入命令行，一边移动
        okflag = 1;
        while(c != '0') {
            if(c != '\n') {
                if(move(c)){
                    okflag = 0;
                    break;
                }
            }
            c = getchar();
            if(c == '\n')
                c = getchar();
        }
        while(c != '0')     // 跳过‘0’及以前的字符
            c = getchar();
        while(c != '\n')    // 跳过‘\n’及以前的字符
            c = getchar();

        // 输出结果
        if(++caseno > 1)
            printf("\n");
        printf("Puzzle #%d:\n", caseno);
        if(okflag) {
            for(i=0; i<MAXN; i++)
                    printf("%c %c %c %c %c\n", grid[i][0], grid[i][1], grid[i][2], grid[i][3], grid[i][4]);
        } else
            printf("This puzzle has no final configuration.\n");
    }

    return 0;
}