結果
問題 | No.951 【本日限定】1枚頼むともう1枚無料! |
ユーザー | k_6101 |
提出日時 | 2020-01-15 21:48:26 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 754 ms / 2,000 ms |
コード長 | 4,416 bytes |
コンパイル時間 | 4,937 ms |
コンパイル使用メモリ | 99,772 KB |
実行使用メモリ | 62,344 KB |
最終ジャッジ日時 | 2023-09-02 14:57:50 |
合計ジャッジ時間 | 32,509 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 132 ms
56,036 KB |
testcase_01 | AC | 138 ms
55,496 KB |
testcase_02 | AC | 145 ms
55,856 KB |
testcase_03 | AC | 135 ms
55,844 KB |
testcase_04 | AC | 138 ms
56,128 KB |
testcase_05 | AC | 134 ms
55,500 KB |
testcase_06 | AC | 140 ms
55,716 KB |
testcase_07 | AC | 143 ms
53,776 KB |
testcase_08 | AC | 147 ms
55,792 KB |
testcase_09 | AC | 261 ms
57,596 KB |
testcase_10 | AC | 212 ms
57,108 KB |
testcase_11 | AC | 247 ms
56,848 KB |
testcase_12 | AC | 372 ms
60,876 KB |
testcase_13 | AC | 593 ms
62,344 KB |
testcase_14 | AC | 300 ms
59,120 KB |
testcase_15 | AC | 302 ms
59,116 KB |
testcase_16 | AC | 381 ms
60,744 KB |
testcase_17 | AC | 421 ms
60,684 KB |
testcase_18 | AC | 135 ms
55,876 KB |
testcase_19 | AC | 134 ms
55,596 KB |
testcase_20 | AC | 137 ms
54,052 KB |
testcase_21 | AC | 207 ms
56,776 KB |
testcase_22 | AC | 205 ms
56,668 KB |
testcase_23 | AC | 209 ms
56,624 KB |
testcase_24 | AC | 718 ms
60,588 KB |
testcase_25 | AC | 734 ms
60,468 KB |
testcase_26 | AC | 690 ms
60,908 KB |
testcase_27 | AC | 717 ms
60,712 KB |
testcase_28 | AC | 645 ms
60,420 KB |
testcase_29 | AC | 653 ms
60,680 KB |
testcase_30 | AC | 136 ms
55,660 KB |
testcase_31 | AC | 136 ms
55,592 KB |
testcase_32 | AC | 211 ms
56,740 KB |
testcase_33 | AC | 211 ms
54,384 KB |
testcase_34 | AC | 221 ms
57,012 KB |
testcase_35 | AC | 695 ms
60,404 KB |
testcase_36 | AC | 681 ms
60,616 KB |
testcase_37 | AC | 705 ms
61,224 KB |
testcase_38 | AC | 701 ms
60,500 KB |
testcase_39 | AC | 754 ms
61,488 KB |
testcase_40 | AC | 703 ms
60,520 KB |
testcase_41 | AC | 719 ms
60,916 KB |
testcase_42 | AC | 729 ms
60,648 KB |
testcase_43 | AC | 689 ms
60,656 KB |
testcase_44 | AC | 694 ms
60,728 KB |
testcase_45 | AC | 712 ms
60,148 KB |
testcase_46 | AC | 656 ms
60,392 KB |
testcase_47 | AC | 630 ms
60,392 KB |
testcase_48 | AC | 635 ms
60,664 KB |
testcase_49 | AC | 666 ms
60,656 KB |
testcase_50 | AC | 647 ms
61,436 KB |
testcase_51 | AC | 643 ms
60,304 KB |
testcase_52 | AC | 615 ms
60,848 KB |
testcase_53 | AC | 717 ms
60,400 KB |
testcase_54 | AC | 584 ms
60,492 KB |
ソースコード
import java.io.BufferedWriter; import java.io.FileWriter; import java.io.InputStream; import java.io.PrintWriter; import java.lang.reflect.Array; import java.math.BigDecimal; import java.math.MathContext; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.Comparator; import java.util.Deque; import java.util.HashMap; import java.util.HashSet; import java.util.Iterator; import java.util.List; import java.util.Map; import java.util.Map.Entry; import java.util.PriorityQueue; import java.util.Queue; import java.util.Random; import java.util.Scanner; import java.util.Set; import java.util.Stack; import java.util.TreeMap; import java.util.TreeSet; import static java.util.Comparator.*; public class Main { public static void main(String[] args) { PrintWriter out = new PrintWriter(System.out); Solver solver = new Solver(System.in, out); solver.solve(); out.close(); } } class Solver { Scanner sc; PrintWriter out; public Solver(InputStream in, PrintWriter out) { sc = new Scanner(in); this.out = out; } // ================================================================== int[][][] dp = new int[2][5010][2]; // [交互に使う][金額][次にタダでもらえるなら 1 ] // [5000][5000][2] は取らない・・・ List<PP> list = new ArrayList<>(); public void solve() { int N = ni(); int K = ni(); int p, d; for (int i = 0; i < N; i++) { p = ni(); d = ni(); list.add(new PP(p, d)); } list.sort(comparing(PP::getKey, reverseOrder())); for (int i = 0; i < 5010; i++) { dp[0][i][0] = -1000000000; dp[0][i][1] = -1000000000; dp[1][i][0] = -1000000000; dp[1][i][1] = -1000000000; } dp[0][0][0] = 0; int from = 0, to = 1; for (int i = 0; i < N; i++) { for (int j = 0; j <= K; j++) { // 買わない かつ もらわない dp[to][j][0] = Math.max(dp[to][j][0], dp[from][j][0]); dp[to][j][1] = Math.max(dp[to][j][1], dp[from][j][1]); // 買う if((j + list.get(i).key) <= K) { // dp[to][j + PD[i][0]][0] = Math.max(dp[to][j + PD[i][0]][0], // dp[from][j][0] + PD[i][1]); dp[to][j + list.get(i).key][1] = Math.max(dp[to][j + list.get(i).key][1], dp[from][j][0] + list.get(i).val); dp[to][j + list.get(i).key][1] = Math.max(dp[to][j + list.get(i).key][1], dp[from][j][1] + list.get(i).val); } // もらう dp[to][j][0] = Math.max(dp[to][j][0], dp[from][j][1] + list.get(i).val); } from = (from + 1) % 2; to = (to + 1) % 2; } int ans = 0; for (int i = 0; i <= K; i++) { // out.println("dp[" + from + "][" + i + "][0] = " + dp[from][i][0]); // out.println("dp[" + from + "][" + i + "][1] = " + dp[from][i][1]); ans = Math.max(ans, dp[from][i][0]); ans = Math.max(ans, dp[from][i][1]); // out.println(" --> ans = " + ans); } out.println(ans); } class PP{ public int key, val; public PP(int key, int val) { this.key = key; this.val = val; } public int getKey() { return key; } public void setKey(int key) { this.key = key; } public int getVal() { return val; } public void setVal(int val) { this.val = val; } } // ------------------------------------------ // 入力 // ------------------------------------------ public int ni() { return sc.nextInt(); } public long nl() { return sc.nextLong(); } public String ns() { return sc.next(); } public char[] nc() { return sc.next().toCharArray(); } public int[] ndi(int N) { int[] ans = new int[N]; for (int i = 0; i < N; i++) { ans[i] = ni(); } return ans; } public long[] ndl(int N) { long[] ans = new long[N]; for (int i = 0; i < N; i++) { ans[i] = nl(); } return ans; } public String[] nds(int N) { String[] ans = new String[N]; for (int i = 0; i < N; i++) { ans[i] = ns(); } return ans; } public char[][] ndc(int N) { char[][] ans = new char[N][]; for (int i = 0; i < N; i++) { ans[i] = nc(); } return ans; } public int[][] nddi(int N, int S) { int[][] ans = new int[N][S]; for (int i = 0; i < N; i++) { for (int j = 0; j < S; j++) { ans[i][j] = ni(); } } return ans; } }