假定测试版上的字模为如下具有对称性的字符“<",">","^","v","o","x","|","-","/","\",则经过旋转或翻转后,字模保持不变或变成另一个对称字模。
测试数据有多组,每组测试数据的第一行为一个整数N(1=<N=<100),随后的N行为测试板的初始状态,每行中包括N个对称字符,每个字符对应于测试板上的字模。测试板上的所有槽位都是非空的。
接下来的一行为命令行,包含由若干命令字符构成的指令串,命令字符如下:
1)<:向左旋转90度;
2)-:沿水平方向翻转;
3)|:沿垂直方向翻转;
4)>:向右旋转90度;
5)\:沿对角线翻转;
6)/:沿反对角线翻转
连续两个命令字符之间以单个空格分隔,机器人必须严格按照命令串中的命令顺序进行操作。命令串的长度大于0且不超过10^6.
输出
对每组测试样例,输出N行字符,为测试板的最终状态,输出格式和输入一样,但不需要输出测试板的大小(见样例)。
样例
3
o^-
/v|
vx^
< | 9
5
x>-o\
voooo
|ooo/
ooo/v
\o/vv
| \ | 9
样例输出
>-|
x<>
</o
<</o\
</ooo
/ooo|
oooo^
\o-<x
#include<map>
#include<iostream>
#include<cstring>
using namespace std;
//<
map <char, char> t1;
//>
map <char, char> t2;
//^
map <char, char> t3;
//v
map <char, char> t4;
//o
map <char, char> t5;
//x
map <char, char> t6;
//|
map <char, char> t7;
//-
map <char, char> t8;
// /
map <char, char> t9;
// '\'
map <char, char> t10;
void init(map<char, char> & t, char ch1, char ch2, char ch3, char ch4, char ch5, char ch6)
{
t['<'] = ch1;
t['-'] = ch2;
t['|'] = ch3;
t['>'] = ch4;
t['\\'] = ch5;
t['/'] = ch6;
//return t;
}
//change
char change(char src, char trans)
{
char dst;
switch (src)
{
case '<':
dst = t1[trans];
break;
case'>':
dst = t2[trans];
break;
case'^':
dst = t3[trans];
break;
case'v':
dst = t4[trans];
break;
case 'o':
dst = t5[trans];
break;
case 'x':
dst = t6[trans];
break;
case '|':
dst = t7[trans];
break;
case '-':
dst = t8[trans];
break;
case '/':
dst = t9[trans];
break;
case '\\':
dst = t10[trans];
default:
break;
}
return dst;
}
//'<"向左水平旋转90度
void turn_right(char ** src, char ** dst,int n)
{
int t = 0;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
t = n - 1 - j;
dst[i][j] = src[t][i];
}
}
}
//"-"沿水平方向旋转
void turn_h(char **src, char **dst, int n)
{
int t = 0;
for (int i = 0; i < n; i++)
{
t = n - 1 - i;
for (int j = 0; j < n; j++)
{
dst[i][j] = src[t][j];
}
}
}
//"|"沿垂直方向旋转
void turn_v(char **src, char **dst, int n)
{
int t = 0;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
t = n - 1 - j;
dst[i][j] = src[i][t];
}
}
}
//">"沿右旋转90度
void turn_left(char **src, char **dst, int n)
{
int t = 0;
for (int i = 0; i < n; i++)
{
t = n - 1 - i;
for (int j = 0; j < n; j++)
{
dst[i][j] = src[j][t];
}
}
}
// 沿对角线翻转
void turn_d(char **src, char **dst, int n)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
dst[i][j] = src[j][i];
}
}
}
//"/"沿反对角线反转
void turn_vd(char **src, char **dst, int n)
{
int t1 = 0, t2 = 0;
for (int i = 0; i < n; i++)
{
t1 = n - 1 - i;
for (int j = 0; j < n; j++)
{
t2 = n - 1 - j;
dst[i][j] = src[t1][t2];
}
}
}
void printm(char ** t,int n)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
cout << t[i][j];
}
cout << endl;
}
cout << endl;
}
int main()
{
//<
//t1.insert(pair<char, char>('<', 'v'));
init(t1, 'v', '<', '>', '^', '^', 'v');
//>
init(t2, '^', '>', '<', 'v', 'v', '^');
//t1.insert(pair<char, char>('\', 'v'));
//^
init(t3, '<', 'v', '^', '>', '<', '>');
//v
init(t4, '>', '^', 'v', '<', '>', '<');
//o
init(t5, 'o', 'o', 'o', 'o', 'o', 'o');
//x
init(t6, 'x', 'x', 'x', 'x', 'x', 'x');
//|
init(t7, '-', '|', '|', '-', '-', '-');
//-
init(t8, '|', '-', '-', '|', '|', '|');
// /
init(t9, '\\', '\\', '\\', '\\', '/', '/');
//'\\'
init(t10, '/', '/', '/', '/', '\\', '\\');
int n;
char ch;
int flag = 0;
cin >> n;
char ** m = (char**)malloc(sizeof(char*)*n);
char ** m1 = (char**)malloc(sizeof(char*)*n);
//char** m = new (char*)[n];
//char ** m1 = new (char*)[n];
for (int i = 0; i < n; i++)
{
m[i] = (char*)malloc(sizeof(char)*n);
m1[i] = (char*)malloc(sizeof(char)*n);
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
cin >> ch;
m[i][j] = ch;
}
}
cin >> ch;
while (ch != '9')
{
switch (ch)
{
case '<':
turn_left(m, m1, n);
printm(m1,n);
break;
case '-':
turn_h(m, m1, n);
printm(m1,n);
break;
case '|':
turn_v(m, m1, n);
printm(m1,n);
break;
case '>':
turn_right(m, m1, n);
printm(m1,n);
break;
case '\\':
turn_d(m, m1, n);
printm(m1,n);
break;
case '/':
turn_vd(m, m1, n);
printm(m1,n);
break;
default:
break;
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
m[i][j] = change(m1[i][j], ch);
}
}
printm(m,n);
cin >> ch;
//cin >> ch;
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
cout << m[i][j];
}
cout << endl;
}
return 0;
}
PS.转义字符‘\'的使用不要闹笑话。