結果
問題 | No.777 再帰的ケーキ |
ユーザー |
|
提出日時 | 2018-12-24 00:43:38 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 937 ms / 2,000 ms |
コード長 | 6,223 bytes |
コンパイル時間 | 4,131 ms |
コンパイル使用メモリ | 82,120 KB |
実行使用メモリ | 65,556 KB |
最終ジャッジ日時 | 2024-09-25 10:52:06 |
合計ジャッジ時間 | 12,538 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 33 |
ソースコード
package adv2018;import java.io.ByteArrayInputStream;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.Arrays;import java.util.Comparator;import java.util.InputMismatchException;public class Day25 {InputStream is;PrintWriter out;String INPUT = "";void solve(){int n = ni();int[][] co = new int[n][];for(int i = 0;i < n;i++){co[i] = new int[]{ni(), ni(), ni(), -1};}int[] ys = new int[n];for(int i = 0;i < n;i++){ys[i] = co[i][1];}ys = shrink(ys);for(int i = 0;i < n;i++){co[i][3] = ys[i];}Arrays.sort(co, new Comparator<int[]>() {public int compare(int[] a, int[] b) {if(a[0] != b[0])return a[0] - b[0];return -(a[1] - b[1]);}});SegmentTreeRMQL st = new SegmentTreeRMQL(n);long ans = 0;for(int[] c : co){long max = Math.max(0, -st.minx(0, c[3]));long val = max + c[2];ans = Math.max(ans, val);if(st.minx(c[3], c[3]+1) > -val){st.update(c[3], -val);}}out.println(ans);}public 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;}public long min(int l, int r){ return l >= r ? 0 : min(l, r, 0, H, 1);}private long min(int l, int r, int cl, int cr, int cur){if(l <= cl && cr <= r){return st[cur];}else{int mid = cl+cr>>>1;long ret = Long.MAX_VALUE;if(cl < r && l < mid){ret = Math.min(ret, min(l, r, cl, mid, 2*cur));}if(mid < r && l < cr){ret = Math.min(ret, min(l, r, mid, cr, 2*cur+1));}return ret;}}public int firstle(int l, long v) {int cur = H+l;while(true){if(st[cur] <= v){if(cur < H){cur = 2*cur;}else{return cur-H;}}else{cur++;if((cur&cur-1) == 0)return -1;if((cur&1)==0)cur>>>=1;}}}public int lastle(int l, long v) {int cur = H+l;while(true){if(st[cur] <= v){if(cur < H){cur = 2*cur+1;}else{return cur-H;}}else{if((cur&cur-1) == 0)return -1;cur--;if((cur&1)==1)cur>>>=1;}}}}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;}void run() throws Exception{is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());out = new PrintWriter(System.out);long s = System.currentTimeMillis();solve();out.flush();if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");// Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){// @Override// public void run() {// long s = System.currentTimeMillis();// solve();// out.flush();// if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");// }// };// t.start();// t.join();}public static void main(String[] args) throws Exception { new Day25().run(); }private byte[] inbuf = new byte[1024];public int lenbuf = 0, ptrbuf = 0;private int readByte(){if(lenbuf == -1)throw new InputMismatchException();if(ptrbuf >= lenbuf){ptrbuf = 0;try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }if(lenbuf <= 0)return -1;}return inbuf[ptrbuf++];}private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }private double nd() { return Double.parseDouble(ns()); }private char nc() { return (char)skip(); }private String ns(){int b = skip();StringBuilder sb = new StringBuilder();while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')sb.appendCodePoint(b);b = readByte();}return sb.toString();}private char[] ns(int n){char[] buf = new char[n];int b = skip(), p = 0;while(p < n && !(isSpaceChar(b))){buf[p++] = (char)b;b = readByte();}return n == p ? buf : Arrays.copyOf(buf, p);}private int[] na(int n){int[] a = new int[n];for(int i = 0;i < n;i++)a[i] = ni();return a;}private long[] nal(int n){long[] a = new long[n];for(int i = 0;i < n;i++)a[i] = nl();return a;}private char[][] nm(int n, int m) {char[][] map = new char[n][];for(int i = 0;i < n;i++)map[i] = ns(m);return map;}private int[][] nmi(int n, int m) {int[][] map = new int[n][];for(int i = 0;i < n;i++)map[i] = na(m);return map;}private int ni() { return (int)nl(); }private long nl(){long num = 0;int b;boolean minus = false;while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));if(b == '-'){minus = true;b = readByte();}while(true){if(b >= '0' && b <= '9'){num = num * 10 + (b - '0');}else{return minus ? -num : num;}b = readByte();}}private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }}