[Simulation] baekjoon-14499

Author: Seogeurim

README.md

@@ -36,6 +36,7 @@
 | 07  |     | [Baekjoon-2563 색종이](./src/Simulation/P2563)       |      |
 | 08  |     | [Baekjoon-16927 배열 돌리기 2](./src/Simulation/P16927) |      |
 | 09  |     | [Baekjoon-16935 배열 돌리기 3](./src/Simulation/P16935) |      |
+| 10  |     | [Baekjoon-14499 주사위 굴리기](./src/Simulation/P14499) | 삼성 SW 역량 테스트 기출 |
 
 ## String
 

src/Simulation/P14499/Main.java

@@ -0,0 +1,85 @@
+package Simulation.P14499;
+
+import java.io.*;
+import java.util.StringTokenizer;
+
+public class Main {
+
+    static int N, M, i, j, K;
+    static int[][] map;
+    static int[] dice = new int[7];
+
+    static int[] di = {0, 0, -1, 1};
+    static int[] dj = {1, -1, 0, 0};
+
+    public static void main(String[] args) throws Exception {
+        System.setIn(new FileInputStream("src/Simulation/P14499/input.txt"));
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        N = stoi(st.nextToken());
+        M = stoi(st.nextToken());
+        i = stoi(st.nextToken());
+        j = stoi(st.nextToken());
+        K = stoi(st.nextToken());
+
+        map = new int[N][M];
+        for (int i = 0; i < N; i++) {
+            st = new StringTokenizer(br.readLine());
+            for (int j = 0; j < M; j++) {
+                map[i][j] = stoi(st.nextToken());
+            }
+        }
+
+        st = new StringTokenizer(br.readLine());
+        while (K-- > 0) {
+            int cmd = stoi(st.nextToken());
+
+            int to_i = i + di[cmd-1], to_j = j + dj[cmd-1];
+            if (!isValidPath(to_i, to_j)) continue;
+            i = to_i; j = to_j;
+
+            switch (cmd) {
+                case 1:
+                    int tmp = dice[4];
+                    dice[4] = dice[6];
+                    dice[6] = dice[3];
+                    dice[3] = dice[1];
+                    dice[1] = tmp;
+                    break;
+                case 2:
+                    tmp = dice[3];
+                    dice[3] = dice[6];
+                    dice[6] = dice[4];
+                    dice[4] = dice[1];
+                    dice[1] = tmp;
+                    break;
+                case 3:
+                    tmp = dice[5];
+                    dice[5] = dice[6];
+                    dice[6] = dice[2];
+                    dice[2] = dice[1];
+                    dice[1] = tmp;
+                    break;
+                case 4:
+                    tmp = dice[2];
+                    dice[2] = dice[6];
+                    dice[6] = dice[5];
+                    dice[5] = dice[1];
+                    dice[1] = tmp;
+                    break;
+            }
+
+            if (map[i][j] == 0) map[i][j] = dice[6];
+            else { dice[6] = map[i][j]; map[i][j] = 0; }
+
+            System.out.println(dice[1]);
+        }
+    }
+
+    static boolean isValidPath(int i, int j) {
+        return 0 <= i && i < N && 0 <= j && j < M;
+    }
+
+    static int stoi(String s) { return Integer.parseInt(s); }
+}

src/Simulation/P14499/README.md

@@ -0,0 +1,11 @@
+## [baekjoon-14499] 주사위 굴리기
+
+![image](https://user-images.githubusercontent.com/22045163/107928146-5032b500-6fbb-11eb-90bf-d7dbcc5ff331.png)
+
+### 풀이 과정
+
+처음에 너무 어렵게 생각했었는데, 그냥 숫자대로 주사위를 돌리면 된다.
+
+![image](https://user-images.githubusercontent.com/22045163/107930949-02b84700-6fbf-11eb-9b52-18ca66657206.png)
+
+![image](https://user-images.githubusercontent.com/22045163/107928186-5cb70d80-6fbb-11eb-85d7-3109d27f0906.png)

src/Simulation/P14499/input.txt

@@ -0,0 +1,5 @@
+3 3 0 0 16
+0 1 2
+3 4 5
+6 7 8
+4 4 1 1 3 3 2 2 4 4 1 1 3 3 2 2