Advertisement
Guest User

Untitled

a guest
Jun 24th, 2017
55
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.31 KB | None | 0 0
  1. 2 3
  2. 4 -17 -8
  3. 6 23 -5
  4. LRB
  5. 1 1
  6. -3
  7.  
  8. 1 1
  9. 3
  10.  
  11. 0 0
  12. 0 0 [4]
  13. 0 1 [-23, 6, -5, 8, -4, -17]
  14. 0 2 [-8]
  15. 1 0 [6]
  16. 1 1 [5, -6, 23]
  17. 1 2 [-5]
  18. Case 1: 6 8
  19. 0 0 [-3]
  20. Case 2:
  21. 0 0 [3]
  22. Case 3: 3
  23. import java.io.IOException;
  24. import java.io.PrintStream;
  25. import java.util.ArrayList;
  26. import java.util.Arrays;
  27. import java.util.Collections;
  28. import java.util.HashMap;
  29. import java.util.LinkedList;
  30. import java.util.Scanner;
  31.  
  32.  
  33. public class B {
  34.  
  35. public static void main(String[] args) throws IOException {
  36. new B().doIt();
  37. }
  38.  
  39. public void doIt() throws IOException {
  40. Scanner in = new Scanner(System.in);
  41. PrintStream out = new PrintStream(System.out);
  42.  
  43. int count = 0;
  44. while ( true ) {
  45.  
  46. int n = in.nextInt();
  47. int m = in.nextInt();
  48.  
  49. if (n == 0 && m == 0)
  50. break;
  51.  
  52. LinkedList<Integer>[][] a = new LinkedList[n][m];
  53. for (int i = 0; i < n; i++)
  54. for (int j = 0; j < m; j++) {
  55. a[i][j] = new LinkedList<Integer>();
  56. a[i][j].add(in.nextInt());
  57. }
  58.  
  59. in.nextLine();
  60. char[] s = in.nextLine().toCharArray();
  61.  
  62. int l = 0, r = m-1;
  63. int t = 0, b = n-1;
  64. LinkedList<Integer> temp;
  65. for (char c : s) {
  66. if (c == 'L') {
  67. for (int i = t; i <= b; i++) {
  68. temp = (LinkedList<Integer>)a[i][l].clone();
  69. for (int j : temp)
  70. a[i][l+1].addFirst(-j);
  71. // a[i][l] = null;
  72. }
  73.  
  74. l++;
  75. }
  76. if (c == 'T') {
  77. for (int j = l; j <= r; j++) {
  78. temp = (LinkedList<Integer>)a[t][j].clone();
  79. for (int i : temp)
  80. a[t+1][j].addFirst(-i);
  81. //a[t][j] = null;
  82. }
  83. t++;
  84. }
  85. if (c == 'R') {
  86. for (int i = t; i <= b; i++) {
  87. temp = (LinkedList<Integer>)a[i][r].clone();
  88. for (int j : temp)
  89. a[i][r-1].addFirst(-j);
  90. // a[i][r] = null;
  91. }
  92. r--;
  93. }
  94. if (c == 'B') {
  95. for (int j = l; j <= r; j++) {
  96. temp = (LinkedList<Integer>)a[b][j].clone();
  97. for (int i : temp)
  98. a[b-1][j].addFirst(-i);
  99. // a[b][j] = null;
  100. }
  101. b--;
  102. }
  103. }
  104.  
  105. for (int i = 0; i < n; i++)
  106. for (int j = 0; j < m; j++)
  107. System.out.println(i + " " +j +" " +a[i][j]);
  108. count++;
  109. out.print("Case " + count + ":");
  110. for (int i: a[t][l])
  111. if (i > 0)
  112. out.print(" " + i);
  113. out.println();
  114. }
  115.  
  116.  
  117. }
  118.  
  119. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement