-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy pathJY_389480.java
More file actions
45 lines (36 loc) ยท 1.32 KB
/
JY_389480.java
File metadata and controls
45 lines (36 loc) ยท 1.32 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
import java.util.*;
class JY_389480 {
static final int INF = 1000;
static int[][] dp;
static int SIZE, M;
public int solution(int[][] info, int n, int m) {
int answer = 0;
SIZE = info.length;
M = m;
dp = new int[SIZE][M];
// dp[i][j] : i๋ฒ์งธ ๋ฌผ๊ฑด๊น์ง ํ์ํ๊ณ B์ ํ์ ์ด j์ผ๋, A์ ์ต์ ํ์
// -1๋ก ์ด๊ธฐํ : ๋ฐฉ๋ฌธ ์ฒดํฌ ์ฌ๋ถ
for(int i=0; i<SIZE; i++) {
Arrays.fill(dp[i], -1);
}
answer = dfs(info, 0, 0);
// ์ต์๊ฐ์ด n๋ณด๋ค ํฌ๋ค๋ฉด ๋ถ๊ฐ๋ฅ
if(answer >= n) return -1;
return answer;
}
public static int dfs(int[][] info, int i, int j) {
// B๊ฐ ํ์น ๊ฒ์ด M์ด์์ด๋ฉด ๋ถ๊ฐ๋ฅ stop
if(j >= M) return INF;
// ๋ชจ๋ ๋ฌผ๊ฑด ํ์ -> ๋์ด์ ํ์ํ ๋ฌผ๊ฑด ์์
if(i == info.length) return 0;
// ์ด๋ฏธ i๋ฒ์จฐ ๋ฌผ๊ฑด์ B๊ฐ ํ์ณค์(== ์ด๋ฏธ ์ต์๊ฐ ๊ฐฑ์ ๋จ)
if(dp[i][j] != -1) return dp[i][j];
int a = info[i][0];
int b = info[i][1];
// A๊ฐ ํ์น๋ ๊ฒฝ์ฐ
int ca = dfs(info, i+1, j) + a;
// B๊ฐ ํ์น๋ ๊ฒฝ์ฐ
int cb = dfs(info, i+1, j+b);
return dp[i][j] = Math.min(ca, cb);
}
}