Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- 2 3
- 4 -17 -8
- 6 23 -5
- LRB
- 1 1
- -3
- 1 1
- 3
- 0 0
- 0 0 [4]
- 0 1 [-23, 6, -5, 8, -4, -17]
- 0 2 [-8]
- 1 0 [6]
- 1 1 [5, -6, 23]
- 1 2 [-5]
- Case 1: 6 8
- 0 0 [-3]
- Case 2:
- 0 0 [3]
- Case 3: 3
- import java.io.IOException;
- import java.io.PrintStream;
- import java.util.ArrayList;
- import java.util.Arrays;
- import java.util.Collections;
- import java.util.HashMap;
- import java.util.LinkedList;
- import java.util.Scanner;
- public class B {
- public static void main(String[] args) throws IOException {
- new B().doIt();
- }
- public void doIt() throws IOException {
- Scanner in = new Scanner(System.in);
- PrintStream out = new PrintStream(System.out);
- int count = 0;
- while ( true ) {
- int n = in.nextInt();
- int m = in.nextInt();
- if (n == 0 && m == 0)
- break;
- LinkedList<Integer>[][] a = new LinkedList[n][m];
- for (int i = 0; i < n; i++)
- for (int j = 0; j < m; j++) {
- a[i][j] = new LinkedList<Integer>();
- a[i][j].add(in.nextInt());
- }
- in.nextLine();
- char[] s = in.nextLine().toCharArray();
- int l = 0, r = m-1;
- int t = 0, b = n-1;
- LinkedList<Integer> temp;
- for (char c : s) {
- if (c == 'L') {
- for (int i = t; i <= b; i++) {
- temp = (LinkedList<Integer>)a[i][l].clone();
- for (int j : temp)
- a[i][l+1].addFirst(-j);
- // a[i][l] = null;
- }
- l++;
- }
- if (c == 'T') {
- for (int j = l; j <= r; j++) {
- temp = (LinkedList<Integer>)a[t][j].clone();
- for (int i : temp)
- a[t+1][j].addFirst(-i);
- //a[t][j] = null;
- }
- t++;
- }
- if (c == 'R') {
- for (int i = t; i <= b; i++) {
- temp = (LinkedList<Integer>)a[i][r].clone();
- for (int j : temp)
- a[i][r-1].addFirst(-j);
- // a[i][r] = null;
- }
- r--;
- }
- if (c == 'B') {
- for (int j = l; j <= r; j++) {
- temp = (LinkedList<Integer>)a[b][j].clone();
- for (int i : temp)
- a[b-1][j].addFirst(-i);
- // a[b][j] = null;
- }
- b--;
- }
- }
- for (int i = 0; i < n; i++)
- for (int j = 0; j < m; j++)
- System.out.println(i + " " +j +" " +a[i][j]);
- count++;
- out.print("Case " + count + ":");
- for (int i: a[t][l])
- if (i > 0)
- out.print(" " + i);
- out.println();
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement