結果
問題 | No.951 【本日限定】1枚頼むともう1枚無料! |
ユーザー | k_6101 |
提出日時 | 2020-01-15 22:04:44 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 649 ms / 2,000 ms |
コード長 | 4,442 bytes |
コンパイル時間 | 2,756 ms |
コンパイル使用メモリ | 101,968 KB |
実行使用メモリ | 61,736 KB |
最終ジャッジ日時 | 2023-09-02 17:17:45 |
合計ジャッジ時間 | 27,932 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 132 ms
55,996 KB |
testcase_01 | AC | 132 ms
55,800 KB |
testcase_02 | AC | 138 ms
55,908 KB |
testcase_03 | AC | 135 ms
55,524 KB |
testcase_04 | AC | 134 ms
55,816 KB |
testcase_05 | AC | 132 ms
55,836 KB |
testcase_06 | AC | 138 ms
55,632 KB |
testcase_07 | AC | 137 ms
55,656 KB |
testcase_08 | AC | 140 ms
56,308 KB |
testcase_09 | AC | 233 ms
57,324 KB |
testcase_10 | AC | 198 ms
56,324 KB |
testcase_11 | AC | 241 ms
57,248 KB |
testcase_12 | AC | 300 ms
59,576 KB |
testcase_13 | AC | 541 ms
60,584 KB |
testcase_14 | AC | 283 ms
59,596 KB |
testcase_15 | AC | 275 ms
59,784 KB |
testcase_16 | AC | 337 ms
61,052 KB |
testcase_17 | AC | 393 ms
61,736 KB |
testcase_18 | AC | 135 ms
55,708 KB |
testcase_19 | AC | 136 ms
56,164 KB |
testcase_20 | AC | 133 ms
55,956 KB |
testcase_21 | AC | 193 ms
56,636 KB |
testcase_22 | AC | 189 ms
56,820 KB |
testcase_23 | AC | 193 ms
57,216 KB |
testcase_24 | AC | 618 ms
60,612 KB |
testcase_25 | AC | 649 ms
60,736 KB |
testcase_26 | AC | 616 ms
60,664 KB |
testcase_27 | AC | 647 ms
60,868 KB |
testcase_28 | AC | 604 ms
61,308 KB |
testcase_29 | AC | 605 ms
60,852 KB |
testcase_30 | AC | 133 ms
56,044 KB |
testcase_31 | AC | 139 ms
56,048 KB |
testcase_32 | AC | 195 ms
57,124 KB |
testcase_33 | AC | 193 ms
56,656 KB |
testcase_34 | AC | 196 ms
56,720 KB |
testcase_35 | AC | 643 ms
60,516 KB |
testcase_36 | AC | 597 ms
60,764 KB |
testcase_37 | AC | 622 ms
60,588 KB |
testcase_38 | AC | 612 ms
60,816 KB |
testcase_39 | AC | 639 ms
60,640 KB |
testcase_40 | AC | 618 ms
60,084 KB |
testcase_41 | AC | 617 ms
60,744 KB |
testcase_42 | AC | 637 ms
60,820 KB |
testcase_43 | AC | 623 ms
60,572 KB |
testcase_44 | AC | 622 ms
60,652 KB |
testcase_45 | AC | 646 ms
61,000 KB |
testcase_46 | AC | 611 ms
60,476 KB |
testcase_47 | AC | 597 ms
60,440 KB |
testcase_48 | AC | 599 ms
60,412 KB |
testcase_49 | AC | 614 ms
60,256 KB |
testcase_50 | AC | 576 ms
60,780 KB |
testcase_51 | AC | 601 ms
60,588 KB |
testcase_52 | AC | 586 ms
60,084 KB |
testcase_53 | AC | 641 ms
60,664 KB |
testcase_54 | AC | 569 ms
60,420 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)); } long start = System.currentTimeMillis(); 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++) { p = list.get(i).key; d = list.get(i).val; 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 + p) <= 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 + p][1] = Math.max(dp[to][j + p][1], dp[from][j][0] + d); dp[to][j + p][1] = Math.max(dp[to][j + p][1], dp[from][j][1] + d); } // もらう dp[to][j][0] = Math.max(dp[to][j][0], dp[from][j][1] + d); } 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); // out.println("処理時間 = " + (System.currentTimeMillis() - start)); } 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; } }