101

SUBMITTED BY: Guest

DATE: Dec. 25, 2013, 3 p.m.

FORMAT: Text only

SIZE: 3.4 kB

Raw Download

HITS: 2053

Report
  1. #include <cstdio>
  3. int blocks[25][26];
  4. int n;
  6. void find( const int & val, int & y, int & x )
  7. {
  8. bool loop = true;
  10. for ( int i = 0; i < n && loop; ++i )
  11. for ( int j = 0; blocks[i][j] != -1; ++j )
  12. if ( blocks[i][j] == val )
  13. {
  14. y = i;
  15. x = j;
  16. loop = false;
  17. break;
  18. }
  19. }
  21. void move_onto( const int & a, const int & b )
  22. {
  23. int y1, x1, y2, x2;
  25. find( a, y1, x1 );
  26. find( b, y2, x2 );
  28. if ( y1 == y2 )
  29. return ;
  31. // make sure nothing is on a
  32. for ( int x = x1+1; blocks[y1][x] != -1; ++x )
  33. {
  34. blocks[ blocks[y1][x] ][0] = blocks[y1][x];
  35. blocks[y1][x] = -1;
  36. }
  38. // make sure nothing is on b
  39. for ( int x = x2+1; blocks[y2][x] != -1; ++x )
  40. {
  41. blocks[ blocks[y2][x] ][0] = blocks[y2][x];
  42. blocks[y2][x] = -1;
  43. }
  45. // put a on b
  46. blocks[y2][x2+1] = blocks[y1][x1];
  47. blocks[y2][x2+2] = -1;
  48. blocks[y1][x1] = -1;
  49. }
  51. void move_over( const int & a, const int & b )
  52. {
  53. int y1, x1, y2, x2;
  55. find( a, y1, x1 );
  56. find( b, y2, x2 );
  58. if ( y1 == y2 )
  59. return ;
  61. // make sure nothing is on a
  62. for ( int x = x1+1; blocks[y1][x] != -1; ++x )
  63. {
  64. blocks[ blocks[y1][x] ][0] = blocks[y1][x];
  65. blocks[y1][x] = -1;
  66. }
  68. // find top of stack which contains b
  69. for ( ; blocks[y2][x2] != -1; ++x2 );
  71. blocks[y2][x2] = blocks[y1][x1];
  72. blocks[y2][x2+1] = -1;
  73. blocks[y1][x1] = -1;
  74. }
  76. void pile_onto( const int & a, const int & b )
  77. {
  78. int y1, x1, y2, x2;
  80. find( a, y1, x1 );
  81. find( b, y2, x2 );
  83. if ( y1 == y2 )
  84. return ;
  86. // make sure nothing is on b
  87. for ( int x = x2+1; blocks[y2][x] != -1; ++x )
  88. {
  89. blocks[ blocks[y2][x] ][0] = blocks[y2][x];
  90. blocks[y2][x] = -1;
  91. }
  93. // move a and above
  94. ++x2;
  95. for ( ; blocks[y1][x1] != -1; ++x1, ++x2 )
  96. {
  97. blocks[y2][x2] = blocks[y1][x1];
  98. blocks[y1][x1] = -1;
  99. }
  100. blocks[y2][x2] = -1;
  101. }
  103. void pile_over( const int & a, const int & b )
  104. {
  105. int y1, x1, y2, x2;
  107. find( a, y1, x1 );
  108. find( b, y2, x2 );
  110. if ( y1 == y2 )
  111. return ;
  113. // find top of stack which contains b
  114. for ( ; blocks[y2][x2] != -1; ++x2 );
  116. // move a and above
  117. for ( ; blocks[y1][x1] != -1; ++x1, ++x2 )
  118. {
  119. blocks[y2][x2] = blocks[y1][x1];
  120. blocks[y1][x1] = -1;
  121. }
  122. blocks[y2][x2] = -1;
  123. }
  125. void print( )
  126. {
  127. for ( int i = 0; i < n; ++i )
  128. {
  129. printf("%d:", i);
  130. for ( int j = 0; blocks[i][j] != -1; ++j )
  131. printf(" %d", blocks[i][j]);
  132. printf("\n");
  133. }
  134. }
  136. int main()
  137. {
  138. int a, b;
  139. char mopi[5], onov[5];
  141. scanf("%d\n", &n);
  143. for ( int i = 0; i < n; ++i )
  144. {
  145. blocks[i][0] = i;
  146. blocks[i][1] = -1;
  147. }
  149. while ( scanf("%s", mopi) == 1 && mopi[0] != 'q' )
  150. {
  151. scanf("%d %s %d", &a, onov, &b);
  153. if ( mopi[0] == 'm' && onov[3] == 'o' )
  154. move_onto( a, b );
  155. else if ( mopi[0] == 'm' && onov[3] == 'r' )
  156. move_over( a, b );
  157. else if ( mopi[0] == 'p' && onov[3] == 'o' )
  158. pile_onto( a, b );
  159. else if ( mopi[0] == 'p' && onov[3] == 'r' )
  160. pile_over( a, b );
  161. }
  162. print( );
  163. return 0;
  164. }
comments powered by Disqus