From 9f6aeccc6bdda0da82ce412ceeea1f551f1e0e59 Mon Sep 17 00:00:00 2001
From: JHLEE325 <82587652+JHLEE325@users.noreply.github.com>
Date: Wed, 18 Feb 2026 21:42:02 +0900
Subject: [PATCH] =?UTF-8?q?[20260218]=20BOJ=20/=20G3=20/=20=EC=82=AC?=
 =?UTF-8?q?=EB=8B=A4=EB=A6=AC=20=EC=A1=B0=EC=9E=91=20/=20=EC=9D=B4?=
 =?UTF-8?q?=EC=A4=80=ED=9D=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...4\353\246\254 \354\241\260\354\236\221.md" | 71 +++++++++++++++++++
 1 file changed, 71 insertions(+)
 create mode 100644 "JHLEE325/202602/18 BOJ G3 \354\202\254\353\213\244\353\246\254 \354\241\260\354\236\221.md"

diff --git "a/JHLEE325/202602/18 BOJ G3 \354\202\254\353\213\244\353\246\254 \354\241\260\354\236\221.md" "b/JHLEE325/202602/18 BOJ G3 \354\202\254\353\213\244\353\246\254 \354\241\260\354\236\221.md"
new file mode 100644
index 00000000..eb5bd948
--- /dev/null
+++ "b/JHLEE325/202602/18 BOJ G3 \354\202\254\353\213\244\353\246\254 \354\241\260\354\236\221.md"	
@@ -0,0 +1,71 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    static int N, M, H, answer;
+    static int[][] map;
+    static boolean finish = false;
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        N = Integer.parseInt(st.nextToken());
+        M = Integer.parseInt(st.nextToken());
+        H = Integer.parseInt(st.nextToken());
+
+        map = new int[H + 1][N + 1];
+
+        for (int i = 0; i < M; i++) {
+            st = new StringTokenizer(br.readLine());
+            int a = Integer.parseInt(st.nextToken());
+            int b = Integer.parseInt(st.nextToken());
+            map[a][b] = 1;
+        }
+
+        for (int i = 0; i <= 3; i++) {
+            answer = i;
+            dfs(1, 0);
+            if (finish) break;
+        }
+
+        System.out.println(finish ? answer : -1);
+    }
+
+    static void dfs(int startR, int count) {
+        if (finish) return;
+        if (answer == count) {
+            if (check()) finish = true;
+            return;
+        }
+
+        for (int i = startR; i <= H; i++) {
+            for (int j = 1; j < N; j++) {
+                if (map[i][j] == 1) continue;
+                if (map[i][j - 1] == 1) continue;
+                if (j + 1 <= N && map[i][j + 1] == 1) continue;
+
+                map[i][j] = 1;
+                dfs(i, count + 1);
+                map[i][j] = 0;
+            }
+        }
+    }
+
+    static boolean check() {
+        for (int i = 1; i <= N; i++) {
+            int currentPos = i;
+            for (int j = 1; j <= H; j++) {
+                if (map[j][currentPos] == 1) {
+                    currentPos++;
+                } else if (map[j][currentPos - 1] == 1) {
+                    currentPos--;
+                }
+            }
+            if (currentPos != i) return false;
+        }
+        return true;
+    }
+}
+```