[Simulation] baekjoon-14503

Author: Seogeurim

README.md

@@ -37,6 +37,7 @@
 | 08  |     | [Baekjoon-16927 배열 돌리기 2](./src/Simulation/P16927) |      |
 | 09  |     | [Baekjoon-16935 배열 돌리기 3](./src/Simulation/P16935) |      |
 | 10  |     | [Baekjoon-14499 주사위 굴리기](./src/Simulation/P14499) | 삼성 SW 역량 테스트 기출 |
+| 11  |     | [Baekjoon-14503 로봇 청소기](./src/Simulation/P14503)   | 삼성 SW 역량 테스트 기출 |
 
 ## String
 

src/Simulation/P14503/Main.java

@@ -0,0 +1,68 @@
+package Simulation.P14503;
+
+import java.io.*;
+import java.util.StringTokenizer;
+
+public class Main {
+
+    static int N, M, i, j, d, sum;
+    static int[][] map;
+
+    static int[] di = {-1, 0, 1, 0};
+    static int[] dj = {0, 1, 0, -1};
+
+    public static void main(String[] args) throws Exception {
+        System.setIn(new FileInputStream("src/Simulation/P14503/input.txt"));
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        N = stoi(st.nextToken());
+        M = stoi(st.nextToken());
+
+        st = new StringTokenizer(br.readLine());
+        i = stoi(st.nextToken());
+        j = stoi(st.nextToken());
+        d = stoi(st.nextToken());
+
+        map = new int[N][M];
+        for (int r = 0; r < N; r++) {
+            st = new StringTokenizer(br.readLine());
+            for (int c = 0; c < M; c++) map[r][c] = stoi(st.nextToken());
+        }
+
+        int dcnt = 0;
+        map[i][j] = 2; sum ++;
+        while (true) {
+            int to_d = d-1 < 0 ? 3 : d-1;
+            int to_i = i + di[to_d], to_j = j + dj[to_d];
+
+            if (isValidPath(to_i, to_j)) {
+                if (map[to_i][to_j] == 0) {
+                    d = to_d; i = to_i; j = to_j; dcnt = 0;
+                    map[i][j] = 2; sum ++;
+                } else {
+                    d = to_d; dcnt ++;
+                }
+            }
+
+            if (dcnt == 4) {
+                to_i = i - di[to_d];
+                to_j = j - dj[to_d];
+
+                if (!isValidPath(to_i, to_j) || map[to_i][to_j] == 1) break;
+
+                i = to_i;
+                j = to_j;
+                dcnt = 0;
+            }
+        }
+
+        System.out.println(sum);
+    }
+
+    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/P14503/README.md

@@ -0,0 +1,5 @@
+## [baekjoon-14503] 로봇 청소기
+
+![image](https://user-images.githubusercontent.com/22045163/107954499-dcef6a00-6fdf-11eb-8845-4efc6ae799e0.png)
+
+![image](https://user-images.githubusercontent.com/22045163/107954534-e8db2c00-6fdf-11eb-9e13-77bef2db0510.png)

src/Simulation/P14503/input.txt

@@ -0,0 +1,13 @@
+11 10
+7 4 0
+1 1 1 1 1 1 1 1 1 1
+1 0 0 0 0 0 0 0 0 1
+1 0 0 0 1 1 1 1 0 1
+1 0 0 1 1 0 0 0 0 1
+1 0 1 1 0 0 0 0 0 1
+1 0 0 0 0 0 0 0 0 1
+1 0 0 0 0 0 0 1 0 1
+1 0 0 0 0 0 1 1 0 1
+1 0 0 0 0 0 1 1 0 1
+1 0 0 0 0 0 0 0 0 1
+1 1 1 1 1 1 1 1 1 1