結果
問題 | No.777 再帰的ケーキ |
ユーザー |
![]() |
提出日時 | 2018-12-25 01:15:39 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 1,463 ms / 2,000 ms |
コード長 | 4,909 bytes |
コンパイル時間 | 3,914 ms |
コンパイル使用メモリ | 85,220 KB |
実行使用メモリ | 83,588 KB |
最終ジャッジ日時 | 2024-09-25 11:07:52 |
合計ジャッジ時間 | 17,632 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 33 |
ソースコード
import java.util.Arrays;import java.util.HashMap;import java.util.Map;public class Main {static class SegmentTreeRMQL {public int M, H, N;public long[] st;public SegmentTreeRMQL(int n){N = n;M = Integer.highestOneBit(Math.max(N-1, 1))<<2;H = M>>>1;st = new long[M];Arrays.fill(st, 0, M, Long.MAX_VALUE);}public SegmentTreeRMQL(long[] a){N = a.length;M = Integer.highestOneBit(Math.max(N-1, 1))<<2;H = M>>>1;st = new long[M];for(int i = 0;i < N;i++){st[H+i] = a[i];}Arrays.fill(st, H+N, M, Long.MAX_VALUE);for(int i = H-1;i >= 1;i--)propagate(i);}public void update(int pos, long x){st[H+pos] = x;for(int i = (H+pos)>>>1;i >= 1;i >>>= 1)propagate(i);}private void propagate(int i){st[i] = Math.min(st[2*i], st[2*i+1]);}public long minx(int l, int r){long min = Long.MAX_VALUE;if(l >= r)return min;while(l != 0){int f = l&-l;if(l+f > r)break;long v = st[(H+l)/f];if(v < min)min = v;l += f;}while(l < r){int f = r&-r;long v = st[(H+r)/f-1];if(v < min)min = v;r -= f;}return min;}}private static void solve() {int n = ni();int[][] p = ntable(n, 3);Arrays.sort(p, (o1, o2) -> o1[0] == o2[0] ? o2[1] - o1[1] : o1[0] - o2[0]);Map<Integer, Integer> map = new HashMap<>();int[] a = new int[n];for (int i = 0; i < n; i ++) {a[i] = p[i][1];}int[] b = shrink(a);for (int i = 0; i < n; i ++) {map.put(a[i], b[i]);}SegmentTreeRMQL st = new SegmentTreeRMQL(new long[n]);for (int[] v : p) {int u = map.get(v[1]);long now = -st.minx(u, u + 1);long nv = -(u == 0 ? 0 : st.minx(0, u)) + v[2];st.update(u, -Math.max(now, nv));}long ret = 0;for (int i = 0; i < n; i ++) {ret = Math.max(-st.minx(i, i + 1), ret);}System.out.println(ret);}public static int[] shrink(int[] a){int n = a.length;long[] b = new long[n];for(int i = 0;i < n;i++)b[i] = (long)a[i]<<32|i;Arrays.sort(b);int[] ret = new int[n];int p = 0;for(int i = 0;i < n;i++) {if(i>0 && (b[i]^b[i-1])>>32!=0)p++;ret[(int)b[i]] = p;}return ret;}public static void main(String[] args) {new Thread(null, new Runnable() {@Overridepublic 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));}}