結果
問題 | No.951 【本日限定】1枚頼むともう1枚無料! |
ユーザー | hiromi_ayase |
提出日時 | 2019-12-18 18:54:10 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 395 ms / 2,000 ms |
コード長 | 3,288 bytes |
コンパイル時間 | 2,722 ms |
コンパイル使用メモリ | 91,028 KB |
実行使用メモリ | 58,396 KB |
最終ジャッジ日時 | 2023-09-21 04:08:59 |
合計ジャッジ時間 | 16,615 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 75 ms
51,036 KB |
testcase_01 | AC | 76 ms
51,024 KB |
testcase_02 | AC | 76 ms
51,296 KB |
testcase_03 | AC | 77 ms
50,968 KB |
testcase_04 | AC | 76 ms
51,028 KB |
testcase_05 | AC | 76 ms
50,828 KB |
testcase_06 | AC | 78 ms
50,860 KB |
testcase_07 | AC | 76 ms
51,204 KB |
testcase_08 | AC | 76 ms
51,004 KB |
testcase_09 | AC | 114 ms
53,556 KB |
testcase_10 | AC | 105 ms
53,440 KB |
testcase_11 | AC | 113 ms
53,212 KB |
testcase_12 | AC | 153 ms
53,540 KB |
testcase_13 | AC | 268 ms
53,584 KB |
testcase_14 | AC | 134 ms
53,376 KB |
testcase_15 | AC | 134 ms
53,576 KB |
testcase_16 | AC | 149 ms
53,308 KB |
testcase_17 | AC | 191 ms
53,552 KB |
testcase_18 | AC | 78 ms
50,896 KB |
testcase_19 | AC | 76 ms
51,208 KB |
testcase_20 | AC | 77 ms
51,388 KB |
testcase_21 | AC | 104 ms
53,592 KB |
testcase_22 | AC | 102 ms
53,572 KB |
testcase_23 | AC | 102 ms
53,456 KB |
testcase_24 | AC | 395 ms
58,396 KB |
testcase_25 | AC | 318 ms
55,752 KB |
testcase_26 | AC | 315 ms
55,416 KB |
testcase_27 | AC | 316 ms
55,696 KB |
testcase_28 | AC | 304 ms
55,656 KB |
testcase_29 | AC | 304 ms
55,572 KB |
testcase_30 | AC | 77 ms
50,908 KB |
testcase_31 | AC | 79 ms
50,916 KB |
testcase_32 | AC | 101 ms
53,564 KB |
testcase_33 | AC | 103 ms
53,644 KB |
testcase_34 | AC | 105 ms
53,584 KB |
testcase_35 | AC | 350 ms
57,384 KB |
testcase_36 | AC | 364 ms
57,604 KB |
testcase_37 | AC | 355 ms
57,476 KB |
testcase_38 | AC | 356 ms
57,608 KB |
testcase_39 | AC | 359 ms
57,720 KB |
testcase_40 | AC | 315 ms
53,452 KB |
testcase_41 | AC | 312 ms
55,576 KB |
testcase_42 | AC | 310 ms
55,400 KB |
testcase_43 | AC | 310 ms
55,388 KB |
testcase_44 | AC | 312 ms
56,080 KB |
testcase_45 | AC | 311 ms
56,020 KB |
testcase_46 | AC | 303 ms
55,376 KB |
testcase_47 | AC | 304 ms
55,652 KB |
testcase_48 | AC | 305 ms
56,000 KB |
testcase_49 | AC | 299 ms
55,596 KB |
testcase_50 | AC | 306 ms
55,316 KB |
testcase_51 | AC | 301 ms
55,836 KB |
testcase_52 | AC | 335 ms
58,192 KB |
testcase_53 | AC | 372 ms
58,248 KB |
testcase_54 | AC | 276 ms
55,900 KB |
ソースコード
import java.util.Arrays; public class Main { private static void solve() { int n = ni(); int k = ni(); int[][] p = ntable(n, 2); Arrays.sort(p, (o1, o2) -> o2[0] - o1[0]); int[][][] dp = new int[2][k + 1][2]; for (int[][] v : dp) for (int[] u : v) Arrays.fill(u, Integer.MIN_VALUE / 2); dp[0][k][0] = 0; for (int i = 0; i < n; i++) { int from = i % 2; int to = from ^ 1; int x = p[i][0]; int y = p[i][1]; for (int j = 0; j <= k; j++) { dp[to][j][0] = Math.max(dp[from][j][0], dp[from][j][1] + y); if (j + x <= k) dp[to][j][1] = Math.max(dp[from][j][1], dp[from][j + x][0] + y); else { dp[to][j][1] = dp[from][j][1]; } } } int ret = 0; for (int s = 0; s <= k; s++) { ret = Math.max(ret, dp[n % 2][s][0]); ret = Math.max(ret, dp[n % 2][s][1]); } System.out.println(ret); } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }