시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
2 초 | 64 MB | 29 | 8 | 8 | 27.586% |
Let us define a set of operations on a rectangular matrix of printable characters.
A matrix $A$ with $m$ rows (1-st index) and $n$ columns (2-nd index) is given. The resulting matrix $B$ is defined as follows.
1
'): $B_{j,i}=A_{i,j}$2
'): $B_{n-j+1,m-i+1}=A_{i,j}$H
'): $B_{m-i+1,j}=A_{i,j}$V
'): $B_{i,n-j+1}=A_{i,j}$A
'), 180 ('B
'), or 270 ('C
') degrees clockwise; 90 degrees case: $B_{j,m-i+1}=A_{i,j}$X
'), 180 ('Y
'), or 270 ('Z
') degrees counterclockwise; 90 degrees case: $B_{n-j+1,i}=A_{i,j}$You are given a sequence of no more than $100\,000$ operations from the set. Apply the operations to the given matrix and output the resulting matrix.
At the first line of the input file there are two integer numbers --- $m$ and $n$ ($0 < m,n \le 300$). Then there are $m$ lines with $n$ printable characters per line (we define a printable character as a symbol with ASCII code from 33 to 126 inclusive). There will be no additional symbols at these lines.
The next line contains the sequence operations to be performed, specified by their one-character identifiers. The operations should be performed from left to right.
Two integer numbers, the number of rows and columns in the output matrix. Then the output matrix must follow, in the same format as the input one.
3 4 0000 a0b0 cdef A1
3 4 cdef a0b0 0000