0922

djs02027 · djs02027 · commit b59a0d021a3f · 2022-09-23T00:52:38.000+09:00
diff --git a/BOJ/gold/BOJ17070/src/Main.java b/BOJ/gold/BOJ17070/src/Main.java
@@ -7,11 +7,13 @@
 public class Main {
     static int N;
     static int count;
+    static int[][] state;
+
     public static void main(String[] args) throws IOException {
 
         BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
         N = Integer.parseInt(br.readLine());
-        int[][] state = new int[N][N];
+        state = new int[N][N];
         int[][] visited = new int[N][N];
 
         for (int i = 0; i < N; i++) {
@@ -20,28 +22,46 @@ public static void main(String[] args) throws IOException {
                 state[i][j] = Integer.parseInt(s[j]);
             }
         }
-        DFS(0,1,0);
-
+        DFS(0, 1, 0);
+        System.out.println(count);
 
 
     }
 
     private static void DFS(int col, int row, int direction) {
-        if (col==N-1 && col==N-1){
+        if (col == N - 1 && row == N - 1) {
             count++;
             return;
         }
-        if (direction==0){
-            if (row==N-1){
-                return;
+        if (direction == 0) {
+
+            if (row + 1 < N && state[col][row + 1] == 0) {
+                DFS(col, row + 1, 0);
+            }
+            if (row + 1 < N && col + 1 < N && state[col + 1][row + 1] == 0 && state[col][row + 1] == 0 && state[col + 1][row] == 0) {
+                DFS(col + 1, row + 1, 2);
             }
 
 
-        }
-        else if (direction==1){
+        } else if (direction == 1) {
 
-        }
-        else if (direction==2){
+            if (col + 1 < N && state[col + 1][row] == 0) {
+                DFS(col + 1, row, 1);
+            }
+            if (row + 1 < N && col + 1 < N && state[col + 1][row + 1] == 0 && state[col][row + 1] == 0 && state[col + 1][row] == 0) {
+                DFS(col + 1, row + 1, 2);
+            }
+
+        } else if (direction == 2) {
+            if (row + 1 < N && state[col][row + 1] == 0) {
+                DFS(col, row + 1, 0);
+            }
+            if (col + 1 < N && state[col + 1][row] == 0) {
+                DFS(col + 1, row, 1);
+            }
+            if (row + 1 < N && col + 1 < N && state[col + 1][row + 1] == 0 && state[col][row + 1] == 0 && state[col + 1][row] == 0) {
+                DFS(col + 1, row + 1, 2);
+            }
 
         }
     }
