結果

問題 No.1037 exhausted
ユーザー tentententen
提出日時 2024-01-25 14:24:05
言語 Java
(openjdk 23)
結果
AC  
実行時間 242 ms / 2,000 ms
コード長 2,563 bytes
コンパイル時間 5,002 ms
コンパイル使用メモリ 84,844 KB
実行使用メモリ 75,348 KB
最終ジャッジ日時 2024-09-28 07:20:37
合計ジャッジ時間 6,752 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.*;
import java.util.*;
import java.util.stream.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner();
int n = sc.nextInt();
int limit = sc.nextInt();
int[] position = new int[n + 2];
position[n + 1] = sc.nextInt();
int[] volumes = new int[n + 2];
int[] prices = new int[n + 2];
for (int i = 1; i <= n; i++) {
position[i] = sc.nextInt();
volumes[i] = sc.nextInt();
prices[i] = sc.nextInt();
}
long[][] dp = new long[n + 2][limit + 1];
for (int i = 1; i <= n + 1; i++) {
Arrays.fill(dp[i], Long.MAX_VALUE / 2);
}
for (int i = 1; i <= n + 1; i++) {
int distance = position[i] - position[i - 1];
for (int j = 0; j + distance <= limit; j++) {
dp[i][j] = dp[i - 1][j + distance];
}
for (int j = limit; j >= 0; j--) {
dp[i][j] = Math.min(dp[i][j], dp[i][Math.max(0, j - volumes[i])] + prices[i]);
}
}
long ans = Arrays.stream(dp[n + 1]).min().getAsLong();
if (ans >= Long.MAX_VALUE / 2) {
System.out.println(-1);
} else {
System.out.println(ans);
}
}
}
class Utilities {
static String arrayToLineString(Object[] arr) {
return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
}
static String arrayToLineString(int[] arr) {
return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
}
}
class Scanner {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
StringBuilder sb = new StringBuilder();
public Scanner() throws Exception {
}
public int nextInt() throws Exception {
return Integer.parseInt(next());
}
public long nextLong() throws Exception {
return Long.parseLong(next());
}
public double nextDouble() throws Exception {
return Double.parseDouble(next());
}
public int[] nextIntArray() throws Exception {
return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
}
public String next() throws Exception {
while (!st.hasMoreTokens()) {
st = new StringTokenizer(br.readLine());
}
return st.nextToken();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0