[BFS] baekjoon-14226

Author: Seogeurim

README.md

@@ -42,6 +42,7 @@
 | 07  |     | [Baekjoon-1525 퍼즐](./src/BFS/P1525) |      |
 | 08  |     | [Baekjoon-7576 토마토](./src/BFS/P7576) |      |
 | 09  |     | [Baekjoon-1697 숨바꼭질](./src/BFS/P1697) |      |
+| 10  |     | [Baekjoon-14226 이모티콘](./src/BFS/P14226) |      |
 
 ## Simulation
 

src/BFS/P14226/Main.java

@@ -0,0 +1,66 @@
+package BFS.P14226;
+
+import java.util.*;
+
+public class Main {
+
+    static int S;
+    static Queue<State> q = new LinkedList<>();
+    static boolean[][] visited = new boolean[10001][10001];
+
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        S = sc.nextInt();
+
+        int ans = 0;
+        q.offer(new State(1, 0, 0));
+        while (!q.isEmpty()) {
+            State s = q.poll();
+            visited[s.screen][s.clip] = true;
+
+            if (s.screen == S) {
+                ans = s.time;
+                break;
+            } else if (!visited[s.screen][s.screen]) {
+                q.add(new State(s.screen, s.screen, s.time + 1));
+            }
+
+            if (s.screen + s.clip == S) {
+                ans = s.time + 1;
+                break;
+            } else if (s.clip != 0 && !visited[s.screen + s.clip][s.clip]) {
+                q.add(new State(s.screen + s.clip, s.clip, s.time + 1));
+            }
+
+            if (s.screen - 1 == S) {
+                ans = s.time + 1;
+                break;
+            } else if (s.screen >= 1 && !visited[s.screen - 1][s.clip]) {
+                q.add(new State(s.screen - 1, s.clip, s.time + 1));
+            }
+        }
+
+        System.out.println(ans);
+    }
+}
+
+class State {
+    int screen;
+    int clip;
+    int time;
+
+    public State(int screen, int clip, int time) {
+        this.screen = screen;
+        this.clip = clip;
+        this.time = time;
+    }
+
+    @Override
+    public String toString() {
+        return "State{" +
+                "screen=" + screen +
+                ", clip=" + clip +
+                ", time=" + time +
+                '}';
+    }
+}

src/BFS/P14226/README.md

@@ -0,0 +1,7 @@
+## [baekjoon-14226] 이모티콘
+
+![image](https://user-images.githubusercontent.com/22045163/101236473-dce80980-3714-11eb-9b64-dde07af86818.png)
+
+1. BFS로 풀 수 있는 문제임을 깨닫기
+2. 문제 조건을 잘 파악하고 정확히 조건 구현하기
+3. BFS에서 주의해야 하는 메모리 초과 문제 기억하기 !!