Skip to content
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
43 changes: 43 additions & 0 deletions Seol-JY/202512/07 BOJ G5 벽장문의 이동.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,43 @@
```java
import java.io.*;
import java.util.*;

public class Main {
static int n, m;
static int[] order;
static int[][][] dp;

public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
n = Integer.parseInt(br.readLine().trim());
StringTokenizer st = new StringTokenizer(br.readLine());
int open1 = Integer.parseInt(st.nextToken());
int open2 = Integer.parseInt(st.nextToken());
m = Integer.parseInt(br.readLine().trim());
order = new int[m];
for (int i = 0; i < m; i++) {
order[i] = Integer.parseInt(br.readLine().trim());
}

dp = new int[m + 1][n + 1][n + 1];
for (int[][] arr2d : dp) {
for (int[] arr1d : arr2d) {
Arrays.fill(arr1d, -1);
}
}

System.out.println(solve(0, open1, open2));
}

static int solve(int idx, int a, int b) {
if (idx == m) return 0;
if (dp[idx][a][b] != -1) return dp[idx][a][b];

int target = order[idx];
int moveA = Math.abs(target - a) + solve(idx + 1, target, b);
int moveB = Math.abs(target - b) + solve(idx + 1, a, target);

return dp[idx][a][b] = Math.min(moveA, moveB);
}
}
```