結果
問題 | No.777 再帰的ケーキ |
ユーザー | tenten |
提出日時 | 2020-12-16 18:57:35 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,466 bytes |
コンパイル時間 | 2,213 ms |
コンパイル使用メモリ | 80,048 KB |
実行使用メモリ | 95,172 KB |
最終ジャッジ日時 | 2023-10-20 09:46:54 |
合計ジャッジ時間 | 8,717 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
53,532 KB |
testcase_01 | AC | 55 ms
53,516 KB |
testcase_02 | AC | 55 ms
53,520 KB |
testcase_03 | AC | 54 ms
53,528 KB |
testcase_04 | AC | 54 ms
53,528 KB |
testcase_05 | AC | 53 ms
53,540 KB |
testcase_06 | AC | 54 ms
53,532 KB |
testcase_07 | AC | 55 ms
53,524 KB |
testcase_08 | AC | 55 ms
53,524 KB |
testcase_09 | AC | 54 ms
53,544 KB |
testcase_10 | AC | 55 ms
53,532 KB |
testcase_11 | AC | 55 ms
53,528 KB |
testcase_12 | AC | 54 ms
53,528 KB |
testcase_13 | AC | 54 ms
52,416 KB |
testcase_14 | AC | 55 ms
53,532 KB |
testcase_15 | AC | 54 ms
53,524 KB |
testcase_16 | AC | 54 ms
53,524 KB |
testcase_17 | AC | 54 ms
53,524 KB |
testcase_18 | AC | 53 ms
53,524 KB |
testcase_19 | AC | 54 ms
53,536 KB |
testcase_20 | AC | 54 ms
53,528 KB |
testcase_21 | AC | 153 ms
56,428 KB |
testcase_22 | AC | 156 ms
56,576 KB |
testcase_23 | AC | 92 ms
54,764 KB |
testcase_24 | AC | 95 ms
54,512 KB |
testcase_25 | AC | 154 ms
56,776 KB |
testcase_26 | AC | 152 ms
56,516 KB |
testcase_27 | AC | 118 ms
56,328 KB |
testcase_28 | AC | 1,979 ms
91,748 KB |
testcase_29 | TLE | - |
testcase_30 | AC | 1,969 ms
93,276 KB |
testcase_31 | TLE | - |
testcase_32 | AC | 913 ms
93,200 KB |
testcase_33 | AC | 468 ms
62,792 KB |
testcase_34 | AC | 541 ms
65,268 KB |
testcase_35 | AC | 1,434 ms
78,948 KB |
testcase_36 | AC | 938 ms
93,168 KB |
ソースコード
import java.util.*; import java.io.*; public class Main { public static void main (String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); Cake[] cakes = new Cake[n]; for (int i = 0; i < n; i++) { cakes[i] = new Cake(br.readLine()); } Arrays.sort(cakes); Cake.doCompress(); int size = 1; long max = 0; BinaryIndexedTree bit = new BinaryIndexedTree(Cake.size); for (Cake c : cakes) { int idx = c.getIdx(); long next = bit.getMax(idx - 1) + c.cal; max = Math.max(max, next); bit.set(idx, next); } System.out.println(max); } static class Cake implements Comparable<Cake> { static int size = 1; static TreeMap<Integer, Integer> compress = new TreeMap<>(); static void doCompress() { for (int x : compress.keySet()) { compress.put(x, size); size++; } } int width; int height; int cal; public Cake(int width, int height, int cal) { this.width = width; this.height = height; this.cal = cal; compress.put(height, Integer.MAX_VALUE); } public Cake(String line) { this(line.split(" ", 3)); } public Cake(String[] element) { this(Integer.parseInt(element[0]), Integer.parseInt(element[1]), Integer.parseInt(element[2])); } public int getIdx() { return compress.get(height); } public int compareTo(Cake another) { if (width == another.width) { return another.height - height; } else { return width - another.width; } } } } class BinaryIndexedTree { int size; long[] tree; public BinaryIndexedTree(int size) { this.size = size; tree = new long[size]; } public void set(int idx, long value) { int mask = 1; while (idx < size) { if ((idx & mask) != 0) { tree[idx] = Math.max(tree[idx], value); idx += mask; } mask <<= 1; } } public long getMax(int x) { int mask = 1; long ans = 0; while (x > 0) { if ((x & mask) != 0) { ans = Math.max(ans, tree[x]); x -= mask; } mask <<= 1; } return ans; } }