[Java] 1873. 상호의 배틀필드

swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5LyE7KD2ADFAXc

SW Expert Academy

문자동작을 하나하나 확인하면서 케이스 바이 케이스로 구현하였다.

 

난이도는 높지 않았지만, 구현하는 데 생각보다 많은 시간이 소모되었다.

---

import java.util.Scanner;

class SWEX_1873 {
	public static void main(String args[]) throws Exception {
		Scanner sc = new Scanner(System.in);

		int T;
		T = sc.nextInt();
		for (int test_case = 1; test_case <= T; test_case++) {
			int H = sc.nextInt();
			int W = sc.nextInt();
			char arr[][] = new char[H][W];

			for (int i = 0; i < H; i++) {
				arr[i] = sc.next().toCharArray();
			}
			int skill_num = sc.nextInt();
			char skill[] = sc.next().toCharArray();

			int tank_x = 0;
			int tank_y = 0;
			char current_tank = '^';
			for (int i = 0; i < H; i++) {
				for (int j = 0; j < W; j++) {
					if (arr[i][j] == '^' || arr[i][j] == '>' || arr[i][j] == '<' || arr[i][j] == 'v') {
						tank_x = i;
						tank_y = j;
						current_tank = arr[i][j];
					}
				}
			}

			for (int i = 0; i < skill.length; i++) {
				if (skill[i] == 'S') {
					int nx = tank_x;
					int ny = tank_y;
					if (current_tank == '^') {
						nx--;
						while (nx >= 0) {
							if (arr[nx][ny] == '#')
								break;
							else if (arr[nx][ny] == '*') {
								arr[nx][ny] = '.';
								break;
							} else
								nx--;
						}
					} else if (current_tank == '>') {
						ny++;
						while (ny < W) {
							if (arr[nx][ny] == '#')
								break;
							else if (arr[nx][ny] == '*') {
								arr[nx][ny] = '.';
								break;
							} else
								ny++;
						}
					} else if (current_tank == '<') {
						ny--;
						while (ny >= 0) {
							if (arr[nx][ny] == '#')
								break;
							else if (arr[nx][ny] == '*') {
								arr[nx][ny] = '.';
								break;
							} else
								ny--;
						}
					} else if (current_tank == 'v') {
						nx++;
						while (nx < H) {
							if (arr[nx][ny] == '#')
								break;
							else if (arr[nx][ny] == '*') {
								arr[nx][ny] = '.';
								break;
							} else
								nx++;
						}
					}

				} else if (skill[i] == 'U') {
					current_tank = '^';
					if (tank_x - 1 >= 0 && arr[tank_x - 1][tank_y] == '.') {
						arr[tank_x - 1][tank_y] = '^';
						arr[tank_x][tank_y] = '.';
						tank_x -= 1;
					} else {
						arr[tank_x][tank_y] = '^';
					}
				} else if (skill[i] == 'D') {
					current_tank = 'v';
					if (tank_x + 1 < H && arr[tank_x + 1][tank_y] == '.') {
						arr[tank_x + 1][tank_y] = 'v';
						arr[tank_x][tank_y] = '.';
						tank_x += 1;
					} else {
						arr[tank_x][tank_y] = 'v';
					}

				} else if (skill[i] == 'L') {
					current_tank = '<';
					if (tank_y - 1 >= 0 && arr[tank_x][tank_y - 1] == '.') {
						arr[tank_x][tank_y - 1] = '<';
						arr[tank_x][tank_y] = '.';
						tank_y -= 1;
					} else {
						arr[tank_x][tank_y] = '<';
					}

				} else if (skill[i] == 'R') {
					current_tank = '>';
					if (tank_y + 1 < W && arr[tank_x][tank_y + 1] == '.') {
						arr[tank_x][tank_y + 1] = '>';
						arr[tank_x][tank_y] = '.';
						tank_y += 1;
					} else {
						arr[tank_x][tank_y] = '>';
					}

				}

			}

			System.out.print("#" + test_case + " ");
			for (int k = 0; k < H; k++) {
				for (int j = 0; j < W; j++) {
					System.out.print(arr[k][j]);
				}
				System.out.println();
			}
		}
		sc.close();
	}
}