[BOJ/JAVA] 백준 10653번 : 마라톤 2

10653번: 마라톤 2

 

 

 

 

 

---

 

 

 

• 코드

 

 

import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Main {
	static int N, K, answer;
	static int[][] vertex, dp, distance;	
	
	public static void main(String[] args) throws Exception {
		SetData();
		System.out.println(answer);
	}

	// 데이터
	private static void SetData() throws Exception {
		InputReader in = new InputReader(System.in);
		
		N = in.nextInt();
		K = in.nextInt();
		vertex = new int[N + 1][2];
		dp = new int[N + 1][K + 1];
		distance = new int[N + 1][N + 1];
		
		for (int i = 1; i <= N; i++) {
			vertex[i][0] = in.nextInt();
			vertex[i][1] = in.nextInt();
			Arrays.fill(dp[i], -1);
		}

		for (int i = 1; i < N; i++) {
			for (int j = i + 1; j <= N; j++) {
				distance[i][j] = Calculate(vertex[i][0], vertex[i][1], vertex[j][0], vertex[j][1]);
			}
		}
		
		answer = DP(N, K);
	}	

	private static int DP(int n, int k) {
		if (dp[n][k] != -1)
			return dp[n][k];
		
		if (n == 1)
			return 0;
		
		int ans = Integer.MAX_VALUE;
		for (int i = 0; i <= k; i++) {
			if (1 <= n - 1 - i)
				ans = Math.min(ans, DP(n - i - 1, k - i) + distance[n - i - 1][n]);
		}
		
		return dp[n][k] = ans;
	}
	
	static int Calculate(int x1, int y1, int x2, int y2) {
		return Math.abs(x1 - x2) + Math.abs(y1 - y2);
	}
}

class InputReader {
	private final InputStream stream;
	private final byte[] buf = new byte[8192];
	private int curChar, snumChars;

	public InputReader(InputStream st) {
		this.stream = st;
	}

	public int read() {
		if (snumChars == -1)
			throw new InputMismatchException();
		if (curChar >= snumChars) {
			curChar = 0;
			try {
				snumChars = stream.read(buf);
			} catch (IOException e) {
				throw new InputMismatchException();
			}
			if (snumChars <= 0)
				return -1;
		}
		return buf[curChar++];
	}

	public int nextInt() {
		int c = read();
		while (isSpaceChar(c)) {
			c = read();
		}
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		int res = 0;
		do {
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	public long nextLong() {
		int c = read();
		while (isSpaceChar(c)) {
			c = read();
		}
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		long res = 0;
		do {
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	public int[] nextIntArray(int n) {
		int a[] = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = nextInt();
		}
		return a;
	}

	public String nextLine() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		StringBuilder res = new StringBuilder();
		do {
			res.appendCodePoint(c);
			c = read();
		} while (!isEndOfLine(c));
		return res.toString();
	}

	public boolean isSpaceChar(int c) {
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}

	private boolean isEndOfLine(int c) {
		return c == '\n' || c == '\r' || c == -1;
	}
}