結果
問題 | No.1496 不思議な数え上げ |
ユーザー | uwi |
提出日時 | 2021-04-30 23:18:56 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,123 ms / 3,000 ms |
コード長 | 13,520 bytes |
コンパイル時間 | 6,623 ms |
コンパイル使用メモリ | 98,504 KB |
実行使用メモリ | 71,744 KB |
最終ジャッジ日時 | 2023-09-26 08:22:28 |
合計ジャッジ時間 | 46,466 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 63 ms
50,700 KB |
testcase_01 | AC | 64 ms
50,456 KB |
testcase_02 | AC | 63 ms
50,324 KB |
testcase_03 | AC | 912 ms
70,496 KB |
testcase_04 | AC | 890 ms
70,728 KB |
testcase_05 | AC | 1,047 ms
70,500 KB |
testcase_06 | AC | 825 ms
67,388 KB |
testcase_07 | AC | 922 ms
70,500 KB |
testcase_08 | AC | 822 ms
67,584 KB |
testcase_09 | AC | 1,039 ms
69,868 KB |
testcase_10 | AC | 1,008 ms
69,648 KB |
testcase_11 | AC | 920 ms
69,880 KB |
testcase_12 | AC | 1,048 ms
70,496 KB |
testcase_13 | AC | 995 ms
70,824 KB |
testcase_14 | AC | 987 ms
67,752 KB |
testcase_15 | AC | 815 ms
66,028 KB |
testcase_16 | AC | 1,123 ms
71,744 KB |
testcase_17 | AC | 1,044 ms
67,828 KB |
testcase_18 | AC | 917 ms
70,268 KB |
testcase_19 | AC | 1,028 ms
70,424 KB |
testcase_20 | AC | 750 ms
66,216 KB |
testcase_21 | AC | 780 ms
67,516 KB |
testcase_22 | AC | 911 ms
70,396 KB |
testcase_23 | AC | 898 ms
68,860 KB |
testcase_24 | AC | 993 ms
69,976 KB |
testcase_25 | AC | 901 ms
71,072 KB |
testcase_26 | AC | 876 ms
68,368 KB |
testcase_27 | AC | 988 ms
68,692 KB |
testcase_28 | AC | 1,073 ms
69,460 KB |
testcase_29 | AC | 905 ms
70,728 KB |
testcase_30 | AC | 899 ms
67,240 KB |
testcase_31 | AC | 964 ms
70,652 KB |
testcase_32 | AC | 875 ms
68,552 KB |
testcase_33 | AC | 624 ms
66,136 KB |
testcase_34 | AC | 596 ms
66,328 KB |
testcase_35 | AC | 113 ms
52,748 KB |
testcase_36 | AC | 843 ms
67,832 KB |
testcase_37 | AC | 767 ms
65,220 KB |
testcase_38 | AC | 772 ms
65,204 KB |
testcase_39 | AC | 930 ms
65,904 KB |
testcase_40 | AC | 527 ms
63,104 KB |
testcase_41 | AC | 964 ms
64,108 KB |
ソースコード
package contest210430; import java.io.*; import java.util.ArrayDeque; import java.util.Arrays; import java.util.InputMismatchException; import java.util.Queue; import java.util.function.IntUnaryOperator; import java.util.function.LongUnaryOperator; public class E { InputStream is; FastWriter out; String INPUT = ""; long[] cum; public void solve() { int n = ni(); ans = new long[n]; int[] P = na(n); long[] A = nal(n); cum = new long[n+1]; for(int i = 0;i < n;i++){ cum[i+1] = cum[i] + P[i]; } dfs(0, n, P, A); P = rev_(P); cum = new long[n+1]; for(int i = 0;i < n;i++){ cum[i+1] = cum[i] + P[i]; } dfs2(0, n, P, A); for(int i = 0;i < n;i++){ if(P[i] <= A[P[i]-1]){ ans[P[i]-1]++; } } for(long v : ans)out.println(v); } public static int[] rev_(int[] a){for(int i = 0, j = a.length-1;i < j;i++,j--){int c = a[i]; a[i] = a[j]; a[j] = c;}return a;} int[] make(int[] a, int f, int t) { int step = Integer.signum(t-f); int[] ret = new int[Math.abs(f-t)+1]; ret[0] = Integer.MAX_VALUE; for(int i = 1;f != t;f += step, i++){ ret[i] = Math.min(ret[i-1], a[f]); } return ret; } long[] ans; void dfs(int l, int r, int[] P, long[] A) { if(r-l <= 1){ return; } // tr(P, l, r); int h = l+r>>1; int[] L = make(P, h-1, l-1); int[] R = make(P, h, r); // tr(L, R); int rp = 0; for(int i = 1;i < L.length;i++){ int mn = L[i]; while(rp < R.length && R[rp] >= mn){ rp++; } int lb = lowerBound(cum, A[mn-1]+cum[h-i]+1); lb = Math.min(lb-1, h + rp - 1); // tr(rp, lb, i, lb-h, A[mn-1], cum[h-i], cum); ans[mn-1] += Math.max(0, lb-h); } // tr(ans); dfs(l, h, P, A); dfs(h, r, P, A); } void dfs2(int l, int r, int[] P, long[] A) { if(r-l <= 1){ return; } // tr(P, l, r); int h = l+r+1>>1; int[] L = make(P, h-1, l-1); int[] R = make(P, h, r); // tr(L, R); int rp = 0; for(int i = 1;i < L.length;i++){ int mn = L[i]; while(rp < R.length && R[rp] >= mn){ rp++; } int lb = lowerBound(cum, A[mn-1]+cum[h-i]+1); lb = Math.min(lb-1, h + rp - 1); // tr(rp, lb, i, lb-h, A[mn-1], cum[h-i], cum); ans[mn-1] += Math.max(0, lb-h); } // tr(ans); dfs2(l, h, P, A); dfs2(h, r, P, A); } public static int lowerBound(long[] a, long v) { int low = -1, high = a.length; while(high-low > 1){ int h = high+low>>>1; if(a[h] >= v){ high = h; }else{ low = h; } } return high; } public static void main(String[] args) { new E().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[] 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 1 public 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)); } }