結果

問題 No.1858 Gorgeous Knapsack
ユーザー tenten
提出日時 2023-12-07 09:16:00
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 2,725 bytes
コンパイル時間 6,206 ms
コンパイル使用メモリ 91,412 KB
実行使用メモリ 185,468 KB
最終ジャッジ日時 2024-09-27 02:00:39
合計ジャッジ時間 15,106 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 36 WA * 1
権限があれば一括ダウンロードができます

ソースコード

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

import java.io.*;
import java.util.*;
import java.util.stream.*;
public class Main {
    static Jewel[] jewels;
    static int[][] dp;
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int m = sc.nextInt();
        jewels = new Jewel[n];
        for (int i = 0; i < n; i++) {
            jewels[i] = new Jewel(sc.nextInt(), sc.nextInt());
        }
        Arrays.sort(jewels);
        dp = new int[n][m + 1];
        for (int[] arr : dp) {
            Arrays.fill(arr, -1);
        }
        long ans = 0;
        for (int i = n - 1; i >= 0; i--) {
            long base = jewels[i].value;
            ans = Math.max(ans, base * (base + dfw(i - 1, m - jewels[i].weight)));
        }
        System.out.println(ans);
    }
    
    static int dfw(int idx, int v) {
        if (v < 0) {
            return Integer.MIN_VALUE;
        }
        if (idx < 0) {
            return 0;
        }
        if (dp[idx][v] < 0) {
            dp[idx][v] = Math.max(dfw(idx - 1, v), dfw(idx - 1, v - jewels[idx].weight) + jewels[idx].value);
        }
        return dp[idx][v];
    }
    
    static class Jewel implements Comparable<Jewel> {
        int value;
        int weight;
        
        public Jewel(int value, int weight) {
            this.value = value;
            this.weight = weight;
        }
        
        public int compareTo(Jewel another) {
            return another.value - value;
        }
    }
}
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