|
| 1 | +public class JM_389480 { |
| 2 | + |
| 3 | + public static int solution(int[][] info, int n, int m) { |
| 4 | + int L = info.length + 1; |
| 5 | + boolean[][][] dp = new boolean[L + 1][n][m]; |
| 6 | + |
| 7 | + dp[0][0][0] = true; |
| 8 | + for (int k = 1; k < L; k++) { |
| 9 | + for (int i = 0; i < n; i++) { |
| 10 | + for (int j = 0; j < m; j++) { |
| 11 | + if(!dp[k - 1][i][j]) continue; |
| 12 | + if(i + info[k - 1][0] < n) { |
| 13 | + dp[k][i + info[k - 1][0]][j] = true; |
| 14 | + } |
| 15 | + if(j + info[k - 1][1] < m) { |
| 16 | + dp[k][i][j + info[k - 1][1]] = true; |
| 17 | + } |
| 18 | + } |
| 19 | + } |
| 20 | + } |
| 21 | + |
| 22 | + int answer = Integer.MAX_VALUE; |
| 23 | + for (int i = 0; i < n; i++) { |
| 24 | + for (int j = 0; j < m; j++) { |
| 25 | + if(dp[L - 1][i][j]) { |
| 26 | + answer = Math.min(answer, i); |
| 27 | + } |
| 28 | + } |
| 29 | + } |
| 30 | + return answer == Integer.MAX_VALUE ? -1 : answer; |
| 31 | + } |
| 32 | + |
| 33 | +} |
0 commit comments