Merge pull request #26 from AlgorithmWithGod/Seol-JY

[20250204] BOJ / 골드4 / 파이프 옮기기 2 / 설진영

Author: ShinHeeEul

Seol-JY/202502/04 BOJ G4 파이프 옮기기 2.md

@@ -0,0 +1,49 @@
+```java
+import java.util.*;
+import java.io.*;
+
+public class Main {
+    private static final int H = 0;
+    private static final int V = 1;
+    private static final int D = 2;
+
+    private static int SIZE;
+    static int[][] map;
+    static long[][][] dp;
+    
+    public static void main(String[] args) throws Exception {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        SIZE = Integer.parseInt(br.readLine());
+
+        map = new int[SIZE + 1][SIZE + 1];
+        dp = new long[3][SIZE + 1][SIZE + 1];
+
+        StringTokenizer st;
+        for (int i = 1; i <= SIZE; i++) {
+            st = new StringTokenizer(br.readLine());
+            for (int j = 1; j <= SIZE; j++) {
+                if (1 == Integer.parseInt(st.nextToken())) {
+                    map[i][j] = 1;
+                }
+            }
+        }
+        
+        dp[H][1][2] = 1;
+        
+        for (int i = 1; i <= SIZE; i++) {
+        	for (int j = 1; j <= SIZE; j++) {
+        		if (i == 1 && j <= 2) continue;
+        		
+        		if (map[i][j] == 1) continue;
+        		dp[H][i][j] = dp[H][i][j-1] + dp[D][i][j-1];
+        		dp[V][i][j] = dp[V][i-1][j] + dp[D][i-1][j];
+        		
+        		if(map[i][j-1] == 1 || map[i-1][j] == 1) continue;
+        		dp[D][i][j] = dp[H][i-1][j-1] + dp[V][i-1][j-1] + dp[D][i-1][j-1];
+        	}
+        }
+        
+        System.out.println(dp[H][SIZE][SIZE] + dp[V][SIZE][SIZE] + dp[D][SIZE][SIZE]);
+    }
+}
+```