UVa 227 Puzzle
来源:互联网 发布:php api 框架 编辑:程序博客网 时间:2024/05/16 09:41
A children’s puzzle that was popular 30 years ago consisted of a 5×5 frame which contained 24 small
squares of equal size. A unique letter of the alphabet was printed on each small square. Since there
were only 24 squares within the frame, the frame also contained an empty position which was the same
size as a small square. A square could be moved into that empty position if it were immediately to the
right, to the left, above, or below the empty position. The object of the puzzle was to slide squares
into 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 after
the 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 and
the sequence of moves on the puzzle. The first 5 lines of each puzzle description are the starting
configuration. 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 other
lines follow in order. The empty position in a frame is indicated by a blank. Each display line contains
exactly 5 characters, beginning with the character on the leftmost square (or a blank if the leftmost
square 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 square
moves into the empty position. A denotes that the square above the empty position moves; B denotes
that the square below the empty position moves; L denotes that the square to the left of the empty
position moves; R denotes that the square to the right of the empty position moves. It is possible that
there is an illegal move, even when it is represented by one of the 4 move characters. If an illegal move
occurs, the puzzle is considered to have no final configuration. This sequence of moves may be spread
over 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.). If
the puzzle has no final configuration, then a message to that effect should follow. Otherwise that final
configuration should be displayed.
Format each line for a final configuration so that there is a single blank character between two
adjacent letters. Treat the empty square the same as a letter. For example, if the blank is an interior
position, 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.
水题,直接模拟。
AC代码:
//// Created by CQUWEL// Copyright (c) 2015年 CQUWEL. All rights reserved.//#include <iostream>#include <cstring>#include <cstdio>#include <cstdlib>#include <cctype>#include <cmath>#include <string>#include <vector>#include <list>#include <map>#include <queue>#include <stack>#include <set>#include <algorithm>#include <numeric>#include <functional>#define cir(i,a,b) for (int i=a;i<=b;i++)#define CIR(j,a,b) for (int j=a;j>=b;j--)#define CLR(x) memset(x,0,sizeof(x))#define root 1,n,1#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define filetest #define BUG() printf("In here\n")#define seevalue(x) printf("x=%d\n",x)#define INF 0x3f3f3f3fconst double eps=1e-9;typedef long long ll;using namespace std;string m[5];int check(int x,int y){ if (x<0 || y<0 || x>=5 || y>=5) return 1; else return 0;}int main(){#ifdef LOCAL freopen("C:\\Users\\john\\Desktop\\in.txt","r",stdin);#endif string s; int cnt=0;int kase=1; while (getline(cin,s)){ if (s[0]=='Z') break; else { if (kase!=1) printf("\n"); } m[0]=s; printf("Puzzle #%d:\n",kase++); for (int i=1;i<5;i++) getline(cin,m[i]); string op; char o; while (cin >> o){ op+=o; if (o=='0') break; } // cout << op << endl; getchar(); int x,y; for (int i=0;i<5;i++) for (int j=0;j<5;j++) if (m[i][j]==' '){ x=i;y=j; } int flag=0; for (int i=0;op[i];i++){ int tx,ty; if (op[i]=='A'){ tx=x-1;ty=y; if (check(tx,ty)){ flag=1; break; } char cc=' '; m[x][y]=m[tx][ty];m[tx][ty]=cc; } else if(op[i]=='B'){ tx=x+1;ty=y; if (check(tx,ty)){ flag=1; break; } char cc=' '; m[x][y]=m[tx][ty];m[tx][ty]=cc; } else if (op[i]=='L'){ tx=x;ty=y-1; if (check(tx,ty)){ flag=1; break; } char cc=' '; m[x][y]=m[tx][ty];m[tx][ty]=cc; } else if(op[i]=='R'){ tx=x,ty=y+1; if (check(tx,ty)){ flag=1; break; } char cc=' '; m[x][y]=m[tx][ty];m[tx][ty]=cc; } x=tx;y=ty; } if (flag) printf("This puzzle has no final configuration.\n"); else { for (int i=0;i<5;i++){ for (int j=0;j<5;j++){ cout << m[i][j]; if (j<4) cout << ' '; else cout << "\n"; } } } } return 0;}
- UVa 227 - Puzzle
- UVa 227 - Puzzle
- Uva-227-Puzzle
- UVa 227 Puzzle
- UVA - 227 Puzzle
- Uva-227 - Puzzle-AC
- UVa 227 - Puzzle
- UVa-227 - Puzzle
- 【Uva 227】 Puzzle
- UVa 227 - Puzzle
- UVa 227 Puzzle
- UVA - 227 Puzzle
- Uva - 227 - Puzzle
- UVA - 227 Puzzle
- UVa 227 Puzzle
- UVA 227 Puzzle
- UVa 227 - Puzzle
- UVa 227 Puzzle
- BZOJ2734: [HNOI2012]集合选数|状压DP
- UVa 455 Periodic Strings
- LeetCode102-Binary-Tree-Level-Order-Traversal
- selenuim-webdriver注解之@FindBy、@FindBys、@FindAll的区别
- 剑指Offer-二维数组中的查找
- UVa 227 Puzzle
- NoSQL
- Android 高仿微信6.0主界面 切换图标变色
- 7个去伪存真的JavaScript面试题
- ios开发进阶之多线程02 NSOperation
- PCM Mix
- TCP/IP详解-TCP的超时和重传
- 剑指Offer-从头到尾打印链表
- 1302 The Snail【模拟】