[level 2] Title: 완전범죄, Time: 2.77 ms, Memory: 82.3 MB -BaekjoonHub

Author: chech2

프로그래머스/2/389480. 완전범죄/README.md

@@ -4,7 +4,7 @@
 
 ### 성능 요약
 
-메모리: 81 MB, 시간: 2.82 ms
+메모리: 82.3 MB, 시간: 2.77 ms
 
 ### 구분
 
@@ -16,7 +16,7 @@
 
 ### 제출 일자
 
-2025년 04월 01일 16:07:34
+2026년 03월 04일 22:43:20
 
 ### 문제 설명
 

프로그래머스/2/389480. 완전범죄/완전범죄.java

@@ -1,36 +1,37 @@
 import java.util.*;
 
 class Solution {
-    int n, m, size;
-    int[][] info;
     int[][][] dp;
-    
+    int[][] info;
+    int n, m, CNT;
     public int solution(int[][] info, int n, int m) {
-        preSetting(info, n, m);
+        CNT = info.length;
+        this.info = info;
+        this.n = n;
+        this.m = m;
+        dp = new int[CNT][n][m];
+        
+        for(int i = 0; i < CNT; i++){
+            for(int j = 0; j < n; j++) {
+                Arrays.fill(dp[i][j], -1);
+            }
+        }
+
+        
         int answer = recur(0, 0, 0);
+        if(answer == 1000) answer = -1;
 
-        if(500 <= answer) answer = -1;
         return answer;
     }
 
-    int recur(int cnt, int a, int b){
-        if(n <= a || m <= b) return 500;
-        if(cnt == size) return 0;
+    private int recur(int cnt, int a, int b){
+        if(cnt == CNT) return 0;
         if(dp[cnt][a][b] != -1) return dp[cnt][a][b];
 
-        dp[cnt][a][b] = recur(cnt + 1, a + info[cnt][0], b) + info[cnt][0];
-        return dp[cnt][a][b] = Math.min(dp[cnt][a][b], recur(cnt + 1, a, b + info[cnt][1]));
-    }
+        dp[cnt][a][b] = 1000;
+        if(a + info[cnt][0] < n) dp[cnt][a][b] = Math.min(dp[cnt][a][b], recur(cnt + 1, a + info[cnt][0], b) + info[cnt][0]);
+        if(b + info[cnt][1] < m) dp[cnt][a][b] = Math.min(dp[cnt][a][b], recur(cnt + 1, a, b + info[cnt][1]));
 
-    void preSetting(int[][] info, int n, int m){
-        this.info = info;
-        this.n = n;
-        this.m = m;
-        this.size = info.length;
-        dp = new int[size][n][m];
-            
-        for(int i = 0; i < size; i++) {
-            for(int j = 0; j < n; j++) Arrays.fill(dp[i][j], -1);
-        }
+        return dp[cnt][a][b];
     }
 }