From b9af99c74b4c84e9675d08bff1cba5af4f1a8d5b Mon Sep 17 00:00:00 2001 From: lkhyun <102892446+lkhyun@users.noreply.github.com> Date: Sun, 7 Dec 2025 21:15:15 +0900 Subject: [PATCH] =?UTF-8?q?[20251207]=20BOJ=20/=20G5=20/=20=EC=A7=84?= =?UTF-8?q?=EC=9A=B0=EC=9D=98=20=EB=8B=AC=20=EC=97=AC=ED=96=89=20(Large)?= =?UTF-8?q?=20/=20=EC=9D=B4=EA=B0=95=ED=98=84?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...3\254 \354\227\254\355\226\211 (Large).md" | 65 +++++++++++++++++++ 1 file changed, 65 insertions(+) create mode 100644 "lkhyun/202512/07 BOJ G5 \354\247\204\354\232\260\354\235\230 \353\213\254 \354\227\254\355\226\211 (Large).md" diff --git "a/lkhyun/202512/07 BOJ G5 \354\247\204\354\232\260\354\235\230 \353\213\254 \354\227\254\355\226\211 (Large).md" "b/lkhyun/202512/07 BOJ G5 \354\247\204\354\232\260\354\235\230 \353\213\254 \354\227\254\355\226\211 (Large).md" new file mode 100644 index 00000000..0d708de8 --- /dev/null +++ "b/lkhyun/202512/07 BOJ G5 \354\247\204\354\232\260\354\235\230 \353\213\254 \354\227\254\355\226\211 (Large).md" @@ -0,0 +1,65 @@ +```java +import java.util.*; +import java.io.*; +public class Main{ + static BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); + static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); + static StringTokenizer st; + + static int N,M; + static int[][] table; + static int[][][] dp; + public static void main(String[] args) throws Exception{ + st = new StringTokenizer(br.readLine()); + N = Integer.parseInt(st.nextToken()); + M = Integer.parseInt(st.nextToken()); + table = new int[N][M]; + + for (int i = 0; i < N; i++) { + st = new StringTokenizer(br.readLine()); + for (int j = 0; j < M; j++) { + table[i][j] = Integer.parseInt(st.nextToken()); + } + } + + dp = new int[N][M][3]; + + for (int i = 0; i < N; i++) { + for (int j = 0; j < M; j++) { + Arrays.fill(dp[i][j],Integer.MAX_VALUE); + } + } + + dp[0][0][1] = table[0][0]; + dp[0][0][2] = table[0][0]; + for (int i = 1; i < M-1; i++) { + for (int j = 0; j < 3; j++) { + dp[0][i][j] = table[0][i]; + } + } + dp[0][M-1][0] = table[0][M-1]; + dp[0][M-1][1] = table[0][M-1]; + + for (int i = 1; i < N; i++) { + dp[i][0][1] = dp[i-1][0][2] + table[i][0]; + dp[i][0][2] = Math.min(dp[i-1][1][0],dp[i-1][1][1]) + table[i][0]; + for (int j = 1; j < M-1; j++) { + dp[i][j][0] = Math.min(dp[i-1][j-1][1],dp[i-1][j-1][2]) + table[i][j]; + dp[i][j][1] = Math.min(dp[i-1][j][0],dp[i-1][j][2]) + table[i][j]; + dp[i][j][2] = Math.min(dp[i-1][j+1][0],dp[i-1][j+1][1]) + table[i][j]; + } + dp[i][M-1][0] = Math.min(dp[i-1][M-2][1],dp[i-1][M-2][2]) + table[i][M-1]; + dp[i][M-1][1] = dp[i-1][M-1][0] + table[i][M-1]; + } + + int ans = Integer.MAX_VALUE; + for (int i = 0; i < M; i++) { + for (int j = 0; j < 3; j++) { + ans = Math.min(ans,dp[N-1][i][j]); + } + } + bw.write(ans+""); + bw.close(); + } +} +```