【作业】Mental Rotation （模拟）

题目链接：https://vjudge.net/contest/345791#problem/L

【问题描述】

　　Mental rotation is a difficult thing to master. Mental rotation is the ability to imagine in your mind how an object would look like from a viewer's side if you were to rotate it in a particular direction. It is something very important for engineers to learn and master, especially if you are required to do engineering drawing. There are many stages to these mental rotation tasks. We will approach a simple rotation task in this problem.

If you are given the following square -

After rotating it to the right once, it will look like the following -

After rotating it to the left once, it will look like the following -

For this problem you will be given an initial square of size n and a list of rotations to perform.

Your task is to output the final representation of the square after performing all the rotation.

输入：

　　The first line of input contains an integer NN (1 ≤ N ≤ 1000). and a string containing a combination of ′L′ and ′R′′. Where ′L′ means left rotation and ′R′ means right rotation. Length of the string will not exceed 100. Starting from the second line, the following N line each will contain NN of the following characters (>, <, ∨, ∧ or .). Empty space is indicated by a '.' (dot).

输出：

　　The output should be N lines, each containing N characters representing the final representation of the square after all the rotation. For ∨ and ∧ use v (small v) and Shift+6 respectively.

样例输入：

3 R

>v>

...

<^<

3 L

>v>

...

<^<

3 LL

>v>

...

<^<

样例输出:

^.v

>.<

^.v

^.v

>.<

^.v

>v>

...

<^<

试题分析：
这是一道简单的模拟题，我们可以写出向左向右翻转的函数，然后直接遍历字符串即可。但这样会超时，可以进行优化，翻转周期为4，并且可以将左转转化为右转。
代码如下：

 #include<stdio.h>

 #include<map>

 #include<string.h>

 const int MAXN = ;

 using namespace std;

 int n;

 char s[MAXN], ans[MAXN][MAXN], str[MAXN][MAXN];

 map<char, char> mp;

 void move()

 {

     for(int col = ; col <= n; col ++)

         for(int row = n; row >= ; row --)

             ans[col][n - row + ] = mp[str[row][col]];

     for(int i = ; i <= n; i ++)

         for(int j = ; j <= n; j ++)

             str[i][j] = ans[i][j];

 }

 int main()

 {

     mp['>'] = 'v', mp['^'] = '>', mp['v'] = '<', mp['<'] = '^', mp['.'] = '.';

     scanf("%d%s", &n, s);

     getchar();

     for(int i = ; i <= n; i ++)

         scanf("%s", str[i] + );

     for(int i = ; i <= n; i ++)

         for(int j = ; j <= n; j ++)

             ans[i][j] = str[i][j];

     int len = strlen(s);

     int rnum = , lnum = ;

     for(int i = ; i < len; i ++)

     {

         if(s[i] == 'R')

             rnum ++;

         else

             lnum ++;

     }

     if(rnum >= lnum)

     {

         rnum -= lnum;

         rnum %= ;

     }

     else

     {

         lnum -= rnum;

         lnum %= ;

         rnum =  - lnum;

         rnum %= ;

     }

     for(int i = ; i <= rnum; i ++)

         move();

     for(int i = ; i <= n; i ++)

         printf("%s\n", ans[i] + );

     return ;

 }

巴特西

【作业】Mental Rotation （模拟）

最新文章

热门文章