[JAVA/SWEA] 9092: 마라톤

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
46
47
48
import java.util.*;
/**
 *
 * @author HEESOO
 *
 */
class Main {
	static int n, k;
	static int[][] dot, dp;
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int T;
		T=sc.nextInt();
		
		for(int test_case = 1; test_case <= T; test_case++)
		{	
			n=sc.nextInt();
			k=sc.nextInt();
			dot=new int[n][2];
			for(int i=0;i<n;i++) {
				dot[i][0]=sc.nextInt();
				dot[i][1]=sc.nextInt();
			}
			
			dp=new int[n][k+1];
			for(int[] i:dp) Arrays.fill(i, Integer.MAX_VALUE);
			int answer=solve(0,k);
			
			System.out.println("#"+test_case+" "+answer);
		}
	}
	
	public static int solve(int cur, int k) {
		if(cur==n-1) return 0; // 도착
		if(dp[cur][k]!=Integer.MAX_VALUE) return dp[cur][k]; // 중복 계산 방지
		
		for(int i=0;i<=k;i++) {
			int next=cur+i+1; // i칸 뛰기
			if(next>=n) continue; //next 범위 체크
			if(k-i<0) continue; 
			
			int dist=Math.abs(dot[cur][0]-dot[next][0])+Math.abs(dot[cur][1]-dot[next][1]);
			dp[cur][k]=Math.min(dp[cur][k], solve(next, k-i)+dist); 
		}
		
		return dp[cur][k];
	}
}