結果
問題 | No.2859 Falling Balls |
ユーザー |
|
提出日時 | 2024-08-25 14:53:13 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 1,922 ms / 3,000 ms |
コード長 | 19,117 bytes |
コンパイル時間 | 5,832 ms |
コンパイル使用メモリ | 93,932 KB |
実行使用メモリ | 195,104 KB |
最終ジャッジ日時 | 2024-08-25 14:53:52 |
合計ジャッジ時間 | 36,499 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 30 |
ソースコード
package contest240825;import java.io.*;import java.util.*;import java.util.function.IntUnaryOperator;import java.util.function.LongUnaryOperator;public class F {InputStream is;FastWriter out;String INPUT = "";public void solve(){int n = ni(), K = ni();int[] t = na(n);int[] x = na(n);int[] c = na(n);n++;t = Arrays.copyOf(t, n);x = Arrays.copyOf(x, n);c = Arrays.copyOf(c, n);// (t+x/k, t-x/k)// kt+x, kt-xlong[][] co = new long[n][];for(int i = 0;i < n;i++){co[i] = new long[]{K*(long)t[i] + x[i], K*(long)t[i] - x[i], t[i], c[i]};}Arrays.sort(co, (a, b) -> Long.compare(a[0], b[0]));// tr(co);int[][] co2 = new int[n][];long[] ys = new long[n];long[] y2s = new long[n];for(int i = 0;i < n;i++){ys[i] = co[i][0];y2s[i] = co[i][1];}int[] ys2 = shrink(ys);int[] y2s2 = shrink(y2s);for(int i = 0;i < n;i++){co2[i] = new int[]{ys2[i], y2s2[i], (int)co[i][2], (int)co[i][3]};}Arrays.sort(co2, (xx, yy) -> xx[2] - yy[2]);StaticRangeTreeRMQ srt = new StaticRangeTreeRMQ(co2, ys2.length);Arrays.sort(co2, (xx, yy) -> xx[2] - yy[2]);long[] dp = new long[n];Arrays.fill(dp, Long.MIN_VALUE / 100);long ans = 0;for(int i = 0;i < n;i++){if(co2[i][3] == 0){dp[i] = 0;}else {dp[i] = -srt.min(0, co2[i][0] + 1, 0, co2[i][1] + 1) + co2[i][3];}// tr(co2[i], dp[i]);ans = Math.max(ans, dp[i]);srt.update(co2[i][0], co2[i][1], -dp[i]);}out.println(ans);}public static int[] shrink(long[] a){int n = a.length;long[] b = Arrays.copyOf(a, n);Arrays.sort(b);// b = radixSort(b);int p = 0;for(int i = 0;i < n;i++){if(i == 0 || b[i] != b[i-1])b[p++] = b[i];}int[] ret = new int[n];for(int i = 0;i < n;i++) {ret[i] = Arrays.binarySearch(b, 0, p, a[i]);}return ret;}public static class SegmentTreeRMQ {public final int M, H, N;public int[] vals;public static final int I = Integer.MAX_VALUE;public SegmentTreeRMQ(int n){N = n;M = Integer.highestOneBit(Math.max(N-1, 1))<<2;H = M>>>1;vals = new int[M];Arrays.fill(vals, 0, M, I);}public SegmentTreeRMQ(int[] a){this(a.length);for(int i = 0;i < N;i++){vals[H+i] = a[i];}// Arrays.fill(vals, H+N, M, I);for(int i = H-1;i >= 1;i--)propagate(i);}public void update(int pos, int x){vals[H+pos] = x;for(int i = (H+pos)>>>1;i >= 1;i >>>= 1)propagate(i);}private void propagate(int i){vals[i] = Math.min(vals[2*i], vals[2*i+1]);}public int min(int l, int r){int min = I;if(l >= r)return min;l += H; r += H;for(;l < r;l>>>=1,r>>>=1){if((l&1) == 1)min = Math.min(min, vals[l++]);if((r&1) == 1)min = Math.min(min, vals[--r]);}return min;}public int firstle(int l, int v) {if(l >= H)return -1;int cur = H+l;while(true){if(vals[cur] <= v){if(cur >= H)return cur-H;cur = 2*cur;}else{cur++;if((cur&cur-1) == 0)return -1;if((cur&1)==0)cur>>>=1;}}}public int lastle(int l, int v) {if(l < 0)return -1;int cur = H+l;while(true){if(vals[cur] <= v){if(cur >= H)return cur-H;cur = 2*cur + 1;}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;}public static class SegmentTreeRMQL {public final int M, H, N;public long[] vals;public static final long I = Long.MAX_VALUE / 10;public SegmentTreeRMQL(int n){N = n;M = Integer.highestOneBit(Math.max(N-1, 1))<<2;H = M>>>1;vals = new long[M];Arrays.fill(vals, 0, M, I);}public SegmentTreeRMQL(int[] a){this(a.length);for(int i = 0;i < N;i++){vals[H+i] = a[i];}// Arrays.fill(vals, H+N, M, I);for(int i = H-1;i >= 1;i--)propagate(i);}public void update(int pos, long x){vals[H+pos] = x;for(int i = (H+pos)>>>1;i >= 1;i >>>= 1)propagate(i);}private void propagate(int i){vals[i] = Math.min(vals[2*i], vals[2*i+1]);}public long min(int l, int r){long min = I;if(l >= r)return min;l += H; r += H;for(;l < r;l>>>=1,r>>>=1){if((l&1) == 1)min = Math.min(min, vals[l++]);if((r&1) == 1)min = Math.min(min, vals[--r]);}return min;}public int firstle(int l, long v) {if(l >= H)return -1;int cur = H+l;while(true){if(vals[cur] <= v){if(cur >= H)return cur-H;cur = 2*cur;}else{cur++;if((cur&cur-1) == 0)return -1;if((cur&1)==0)cur>>>=1;}}}public int lastle(int l, long v) {if(l < 0)return -1;int cur = H+l;while(true){if(vals[cur] <= v){if(cur >= H)return cur-H;cur = 2*cur + 1;}else{if((cur&cur-1) == 0)return -1;cur--;if((cur&1)==1)cur>>>=1;}}}}public static class StaticRangeTreeRMQ {public int M, H, N;public SegmentTreeRMQL[] st;public int[][] maps;public int[] count;public long I = Long.MAX_VALUE / 10;/*** @param co DESTRUCTIVE* @param n limit of coordinate*/public StaticRangeTreeRMQ(int[][] co, int n){N = n;M = Integer.highestOneBit(Math.max(N-1, 1))<<2;H = M>>>1;Arrays.sort(co, new Comparator<int[]>() { // x ascpublic int compare(int[] a, int[] b) {if(a[0] != b[0])return a[0] - b[0];return a[1] - b[1];}});maps = new int[M][];st = new SegmentTreeRMQL[M];count = new int[M];for(int i = 0;i < co.length;i++){count[H+co[i][0]]++;}int off = 0;for(int i = 0;i < n;i++){maps[H+i] = new int[count[H+i]];for(int j = 0;j < count[H+i];j++,off++){maps[H+i][j] = co[off][1];}st[H+i] = new SegmentTreeRMQL(count[H+i]);}// mergefor(int i = H-1;i >= 1;i--){if(maps[2*i+1] == null){maps[i] = maps[2*i];count[i] = count[2*i];}else{count[i] = count[2*i] + count[2*i+1];maps[i] = new int[count[i]];int j = 0, k = 0, l = 0;while(j < count[2*i] && k < count[2*i+1]){maps[i][l++] = Math.min(maps[2*i][j], maps[2*i+1][k]);int nj = j;if(maps[2*i][j] <= maps[2*i+1][k])nj++;if(maps[2*i][j] >= maps[2*i+1][k])k++;j = nj;}while(j < count[2*i])maps[i][l++] = maps[2*i][j++];while(k < count[2*i+1])maps[i][l++] = maps[2*i+1][k++];if(l != count[i]){count[i] = l;maps[i] = Arrays.copyOf(maps[i], l);}}st[i] = new SegmentTreeRMQL(count[i]);}}public void update(int x, int y, long v){for(int pos = H+x;pos >= 1;pos>>>=1){int ind = Arrays.binarySearch(maps[pos], y);if(ind >= 0){st[pos].update(ind, v);}else{throw new RuntimeException(String.format("access to non-existing point : (%d,%d):%d", x, y, v));}}}public long min(int xl, int xr, int yl, int yr) { return min(xl, xr, yl, yr, 0, H, 1); }public long min(int xl, int xr, int yl, int yr, int cl, int cr, int cur){if(xl <= cl && cr <= xr){int indl = Arrays.binarySearch(maps[cur], yl);int indr = Arrays.binarySearch(maps[cur], yr);if(indl < 0)indl = -indl - 1;if(indr < 0)indr = -indr - 1;return st[cur].min(indl, indr);}else{int mid = cl+cr>>>1;long ret = I;if(Math.max(cl, xl) < Math.min(mid, xr)){ret = Math.min(ret, min(xl, xr, yl, yr, cl, mid, 2*cur));}if(Math.max(mid, xl) < Math.min(cr, xr)){ret = Math.min(ret, min(xl, xr, yl, yr, mid, cr, 2*cur+1));}return ret;}}}public static void main(String[] args) {new F().run();}public void run(){long S = System.currentTimeMillis();is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());out = new FastWriter(System.out);solve();out.flush();long G = System.currentTimeMillis();tr(G-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();}private boolean eof(){if(lenbuf == -1)return true;int lptr = ptrbuf;while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;try {is.mark(1000);while(true){int b = is.read();if(b == -1){is.reset();return true;}else if(!isSpaceChar(b)){is.reset();return false;}}} catch (IOException e) {return true;}}private final 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 boolean isSpaceChar(int c) { return !(c >= 32 && 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))){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 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[] 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 int ni(){int num = 0, 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 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();}}public static class FastWriter{private static final int BUF_SIZE = 1<<13;private final byte[] buf = new byte[BUF_SIZE];private final OutputStream out;private int ptr = 0;private FastWriter(){out = null;}public FastWriter(OutputStream os){this.out = os;}public FastWriter(String path){try {this.out = new FileOutputStream(path);} catch (FileNotFoundException e) {throw new RuntimeException("FastWriter");}}public FastWriter write(byte b){buf[ptr++] = b;if(ptr == BUF_SIZE)innerflush();return this;}public FastWriter write(char c){return write((byte)c);}public FastWriter write(char[] s){for(char c : s){buf[ptr++] = (byte)c;if(ptr == BUF_SIZE)innerflush();}return this;}public FastWriter write(String s){s.chars().forEach(c -> {buf[ptr++] = (byte)c;if(ptr == BUF_SIZE)innerflush();});return this;}private static int countDigits(int l) {if (l >= 1000000000) return 10;if (l >= 100000000) return 9;if (l >= 10000000) return 8;if (l >= 1000000) return 7;if (l >= 100000) return 6;if (l >= 10000) return 5;if (l >= 1000) return 4;if (l >= 100) return 3;if (l >= 10) return 2;return 1;}public FastWriter write(int x){if(x == Integer.MIN_VALUE){return write((long)x);}if(ptr + 12 >= BUF_SIZE)innerflush();if(x < 0){write((byte)'-');x = -x;}int d = countDigits(x);for(int i = ptr + d - 1;i >= ptr;i--){buf[i] = (byte)('0'+x%10);x /= 10;}ptr += d;return this;}private static int countDigits(long l) {if (l >= 1000000000000000000L) return 19;if (l >= 100000000000000000L) return 18;if (l >= 10000000000000000L) return 17;if (l >= 1000000000000000L) return 16;if (l >= 100000000000000L) return 15;if (l >= 10000000000000L) return 14;if (l >= 1000000000000L) return 13;if (l >= 100000000000L) return 12;if (l >= 10000000000L) return 11;if (l >= 1000000000L) return 10;if (l >= 100000000L) return 9;if (l >= 10000000L) return 8;if (l >= 1000000L) return 7;if (l >= 100000L) return 6;if (l >= 10000L) return 5;if (l >= 1000L) return 4;if (l >= 100L) return 3;if (l >= 10L) return 2;return 1;}public FastWriter write(long x){if(x == Long.MIN_VALUE){return write("" + x);}if(ptr + 21 >= BUF_SIZE)innerflush();if(x < 0){write((byte)'-');x = -x;}int d = countDigits(x);for(int i = ptr + d - 1;i >= ptr;i--){buf[i] = (byte)('0'+x%10);x /= 10;}ptr += d;return this;}public FastWriter write(double x, int precision){if(x < 0){write('-');x = -x;}x += Math.pow(10, -precision)/2;// if(x < 0){ x = 0; }write((long)x).write(".");x -= (long)x;for(int i = 0;i < precision;i++){x *= 10;write((char)('0'+(int)x));x -= (int)x;}return this;}public FastWriter writeln(char c){ return write(c).writeln(); }public FastWriter writeln(int x){ return write(x).writeln(); }public FastWriter writeln(long x){ return write(x).writeln(); }public FastWriter writeln(double x, int precision){ return write(x, precision).writeln(); }public FastWriter write(int... xs){boolean first = true;for(int x : xs) {if (!first) write(' ');first = false;write(x);}return this;}public FastWriter write(long... xs){boolean first = true;for(long x : xs) {if (!first) write(' ');first = false;write(x);}return this;}public FastWriter write(IntUnaryOperator f, int... xs){boolean first = true;for(int x : xs) {if (!first) write(' ');first = false;write(f.applyAsInt(x));}return this;}public FastWriter write(LongUnaryOperator f, long... xs){boolean first = true;for(long x : xs) {if (!first) write(' ');first = false;write(f.applyAsLong(x));}return this;}public FastWriter writeln(){return write((byte)'\n');}public FastWriter writeln(int... xs) { return write(xs).writeln(); }public FastWriter writeln(long... xs) { return write(xs).writeln(); }public FastWriter writeln(IntUnaryOperator f, int... xs) { return write(f, xs).writeln(); }public FastWriter writeln(LongUnaryOperator f, long... xs) { return write(f, xs).writeln(); }public FastWriter writeln(char[] line) { return write(line).writeln(); }public FastWriter writeln(char[]... map) { for(char[] line : map)write(line).writeln();return this; }public FastWriter writeln(String s) { return write(s).writeln(); }private void innerflush(){try {out.write(buf, 0, ptr);ptr = 0;} catch (IOException e) {throw new RuntimeException("innerflush");}}public void flush(){innerflush();try {out.flush();} catch (IOException e) {throw new RuntimeException("flush");}}public FastWriter print(byte b) { return write(b); }public FastWriter print(char c) { return write(c); }public FastWriter print(char[] s) { return write(s); }public FastWriter print(String s) { return write(s); }public FastWriter print(int x) { return write(x); }public FastWriter print(long x) { return write(x); }public FastWriter print(double x, int precision) { return write(x, precision); }public FastWriter println(char c){ return writeln(c); }public FastWriter println(int x){ return writeln(x); }public FastWriter println(long x){ return writeln(x); }public FastWriter println(double x, int precision){ return writeln(x, precision); }public FastWriter print(int... xs) { return write(xs); }public FastWriter print(long... xs) { return write(xs); }public FastWriter print(IntUnaryOperator f, int... xs) { return write(f, xs); }public FastWriter print(LongUnaryOperator f, long... xs) { return write(f, xs); }public FastWriter println(int... xs) { return writeln(xs); }public FastWriter println(long... xs) { return writeln(xs); }public FastWriter println(IntUnaryOperator f, int... xs) { return writeln(f, xs); }public FastWriter println(LongUnaryOperator f, long... xs) { return writeln(f, xs); }public FastWriter println(char[] line) { return writeln(line); }public FastWriter println(char[]... map) { return writeln(map); }public FastWriter println(String s) { return writeln(s); }public FastWriter println() { return writeln(); }}public static void trnz(int... o){for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" ");System.out.println();}// print ids which are 1public static void trt(long... o){Queue<Integer> stands = new ArrayDeque<>();for(int i = 0;i < o.length;i++){for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));}System.out.println(stands);}public static void tf(boolean... r){for(boolean x : r)System.out.print(x?'#':'.');System.out.println();}public static void tf(boolean[]... b){for(boolean[] r : b) {for(boolean x : r)System.out.print(x?'#':'.');System.out.println();}System.out.println();}public void tf(long[]... b){if(INPUT.length() != 0) {for (long[] r : b) {for (long x : r) {for (int i = 0; i < 64; i++) {System.out.print(x << ~i < 0 ? '#' : '.');}}System.out.println();}System.out.println();}}public void tf(long... b){if(INPUT.length() != 0) {for (long x : b) {for (int i = 0; i < 64; i++) {System.out.print(x << ~i < 0 ? '#' : '.');}}System.out.println();}}private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }}