HDU1033——Edge（实实在在的水题）

Edge

水题

Edge

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3188    Accepted Submission(s): 2013

Problem Description

For products that are wrapped in small packings it is necessary that the sheet of paper containing the directions for use is folded until its size becomes small enough. We assume that a sheet of paper is rectangular and only folded along lines parallel to its initially shorter edge. The act of folding along such a line, however, can be performed in two directions: either the surface on the top of the sheet is brought together, or the surface on its bottom. In both cases the two parts of the rectangle that are separated by the folding line are laid together neatly and we ignore any differences in thickness of the resulting folded sheet.
After several such folding steps have been performed we may unfold the sheet again and take a look at its longer edge holding the sheet so that it appears as a one-dimensional curve, actually a concatenation of line segments. If we move along this curve in a fixed direction we can classify every place where the sheet was folded as either type A meaning a clockwise turn or type V meaning a counter-clockwise turn. Given such a sequence of classifications, produce a drawing of the longer edge of the sheet assuming 90 degree turns at equidistant places.

 

Input

The input contains several test cases, each on a separate line. Each line contains a nonempty string of characters A and V describing the longer edge of the sheet. You may assume that the length of the string is less than 200. The input file terminates immediately after the last test case.

 

Output

For each test case generate a PostScript drawing of the edge with commands placed on separate lines. Start every drawing at the coordinates (300, 420) with the command "300 420 moveto". The first turn occurs at (310, 420) using the command "310 420 lineto". Continue with clockwise or counter-clockwise turns according to the input string, using a sequence of "x y lineto" commands with the appropriate coordinates. The turning points are separated at a distance of 10 units. Do not forget the end point of the edge and finish each test case by the commands stroke and showpage.

You may display such drawings with the gv PostScript interpreter, optionally after a conversion using the ps2ps utility.

 

Sample Input

 
 

  
  V
AVV
 
 

 

Sample Output

 
 

  
  300 420 moveto
310 420 lineto
310 430 lineto
stroke
showpage
300 420 moveto
310 420 lineto
310 410 lineto
320 410 lineto
320 420 lineto
stroke
showpage
 
 
 
 

  
  

 
 
 
 

  
  

 
 
 
 

  
  题意：
 
 
 
 

  
     事实证明，你该学英语了！
 
 
 
 

  
     你一开始在（300，420）这个点，向四个方向走，每次走10步，第一次你向下走了10步，然后看输入，若是A就是向右拐，V就是左拐。
 
 
 
 

  
  

 
 
 
 

  
  解题思路：
 
 
 
 

  
     注意每时每刻你面对哪边。
 
 
 
 

  
  

 
 
 
 

  
  代码实现：
 
 
 
 

  
  
  
  
#include <iostream>
#include <cstdio>
#include <cmath>
#include <queue>
#include <cstring>
#include <algorithm>

using namespace std;
typedef long long LL;
const int maxn = 1000000;

int main()
{
    char s[205];
    while( ~scanf("%s",s))
    {
        int i=300,j=420;
        int dir = 1;
        printf("%d %d moveto\n",i,j);
        i = 310;
        printf("%d %d lineto\n",i,j);
        for( int z=0; z<strlen(s); z++ )
        {
            if(s[z] == 'A')
                dir = (dir - 1)%4;
            else
                dir = (dir + 1)%4;
            if( dir == 0 )
                dir = 4;
            if( dir == 1 )                           // 南;
                i += 10;
            else if( dir == 2 )                      // 东;
                j += 10;
            else if( dir == 3 )                      // 北;
                i -= 10;
            else if( dir == 4 )                      // 西;
                j -=10;
            printf("%d %d lineto\n",i,j);
        }
        printf("stroke\nshowpage\n");
    }
    return 0;
}