結果
問題 | No.2370 He ate many cakes |
ユーザー | tenten |
提出日時 | 2023-07-04 17:23:31 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 562 ms / 2,000 ms |
コード長 | 3,359 bytes |
コンパイル時間 | 2,307 ms |
コンパイル使用メモリ | 85,356 KB |
実行使用メモリ | 61,164 KB |
最終ジャッジ日時 | 2024-07-18 12:40:36 |
合計ジャッジ時間 | 8,214 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
49,856 KB |
testcase_01 | AC | 50 ms
50,060 KB |
testcase_02 | AC | 47 ms
50,352 KB |
testcase_03 | AC | 525 ms
60,540 KB |
testcase_04 | AC | 47 ms
50,128 KB |
testcase_05 | AC | 46 ms
50,088 KB |
testcase_06 | AC | 46 ms
50,212 KB |
testcase_07 | AC | 46 ms
49,936 KB |
testcase_08 | AC | 46 ms
49,816 KB |
testcase_09 | AC | 46 ms
50,212 KB |
testcase_10 | AC | 506 ms
58,824 KB |
testcase_11 | AC | 516 ms
60,448 KB |
testcase_12 | AC | 536 ms
58,896 KB |
testcase_13 | AC | 525 ms
60,568 KB |
testcase_14 | AC | 544 ms
60,652 KB |
testcase_15 | AC | 562 ms
60,780 KB |
testcase_16 | AC | 187 ms
55,944 KB |
testcase_17 | AC | 426 ms
61,164 KB |
testcase_18 | AC | 104 ms
53,488 KB |
testcase_19 | AC | 104 ms
53,488 KB |
ソースコード
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 k = sc.nextInt(); TreeMap<Long, Integer> evCount = new TreeMap<>(); TreeMap<Long, Integer> odCount = new TreeMap<>(); evCount.put(0L, 1); odCount.put(0L, 1); for (int i = 0; i < n; i++) { int x = sc.nextInt(); TreeMap<Long, Integer> counts; if (i % 2 == 0) { counts = evCount; } else { counts = odCount; } if (x == 0) { for (long y : counts.keySet()) { counts.put(y, counts.get(y) * 2); } } else if (x > 0) { Long key = Long.MAX_VALUE; while ((key = counts.lowerKey(key)) != null) { counts.put(key + x, counts.getOrDefault(key + x, 0) + counts.get(key)); } } else { Long key = Long.MIN_VALUE; while ((key = counts.higherKey(key)) != null) { counts.put(key + x, counts.getOrDefault(key + x, 0) + counts.get(key)); } } } odCount.put(Long.MAX_VALUE, 0); int sum = 0; Long key = Long.MAX_VALUE; while ((key = odCount.lowerKey(key)) != null) { sum += odCount.get(key); odCount.put(key, sum); } long left = Long.MIN_VALUE / 3; long right = Long.MAX_VALUE / 3; while (right - left > 1) { long m = (left + right) / 2; int current = 0; for (long x : evCount.keySet()) { current += evCount.get(x) * odCount.ceilingEntry(m - x).getValue(); if (current > k) { break; } } if (current >= k) { left = m; } else { right = m; } } System.out.println(left); } } 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(); } }