結果
問題 | No.728 ギブ and テイク |
ユーザー | 37zigen |
提出日時 | 2018-08-25 12:06:42 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 807 ms / 3,000 ms |
コード長 | 3,650 bytes |
コンパイル時間 | 4,362 ms |
コンパイル使用メモリ | 76,584 KB |
実行使用メモリ | 105,896 KB |
最終ジャッジ日時 | 2023-09-07 12:52:17 |
合計ジャッジ時間 | 10,699 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
49,172 KB |
testcase_01 | AC | 40 ms
49,108 KB |
testcase_02 | AC | 43 ms
49,112 KB |
testcase_03 | AC | 42 ms
48,884 KB |
testcase_04 | AC | 42 ms
49,228 KB |
testcase_05 | AC | 42 ms
49,156 KB |
testcase_06 | AC | 41 ms
48,924 KB |
testcase_07 | AC | 42 ms
49,052 KB |
testcase_08 | AC | 42 ms
48,860 KB |
testcase_09 | AC | 42 ms
49,248 KB |
testcase_10 | AC | 43 ms
49,388 KB |
testcase_11 | AC | 45 ms
49,128 KB |
testcase_12 | AC | 46 ms
49,008 KB |
testcase_13 | AC | 119 ms
55,184 KB |
testcase_14 | AC | 143 ms
57,344 KB |
testcase_15 | AC | 105 ms
55,016 KB |
testcase_16 | AC | 140 ms
57,312 KB |
testcase_17 | AC | 132 ms
57,336 KB |
testcase_18 | AC | 536 ms
82,956 KB |
testcase_19 | AC | 584 ms
84,048 KB |
testcase_20 | AC | 657 ms
89,452 KB |
testcase_21 | AC | 582 ms
85,524 KB |
testcase_22 | AC | 269 ms
65,652 KB |
testcase_23 | AC | 195 ms
60,768 KB |
testcase_24 | AC | 452 ms
77,476 KB |
testcase_25 | AC | 527 ms
76,604 KB |
testcase_26 | AC | 287 ms
65,196 KB |
testcase_27 | AC | 807 ms
105,896 KB |
testcase_28 | AC | 327 ms
86,180 KB |
testcase_29 | AC | 42 ms
48,880 KB |
testcase_30 | AC | 41 ms
48,956 KB |
testcase_31 | AC | 40 ms
49,012 KB |
testcase_32 | AC | 41 ms
49,120 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.ArrayList; import java.util.Arrays; import java.util.NoSuchElementException; import java.util.Scanner; public class Main { public static void main(String[] args) { new Main().run(); } class BIT { int n; long[] v; public BIT(int n_) { n = n_; v = new long[n + 1]; } void add(int k, long val) { ++k; while (k <= n) { v[k] += val; k += k & -k; } } long sum(int k) { ++k; k = Math.min(k, n); long ret = 0; while (k > 0) { ret += v[k]; k -= k & -k; } return ret; } long sum(long a, long b) { return sum((int) b) - sum((int) a - 1); } } void run() { Scanner sc = new Scanner(); int N = sc.nextInt(); long[][] A = new long[N][3]; for (int i = 0; i < N; ++i) { A[i][0] = sc.nextLong(); } for (int i = 0; i < N; ++i) { A[i][1] = sc.nextLong(); A[i][2] = sc.nextLong(); } ArrayList<Integer>[] rm = new ArrayList[N]; for (int i = 0; i < N; ++i) rm[i] = new ArrayList<>(); BIT bit = new BIT(N); long ans = 0; for (int i = 0; i < N; ++i) { {// A[m][0]>=A[i][0]-A[i][1]となる最小のmを求めたい int ok = N - 1, ng = -1; while (ok - ng > 1) { int m = (ok + ng) / 2; if (A[m][0] >= A[i][0] - A[i][1]) { ok = m; } else { ng = m; } } ans += bit.sum(ok, i); } bit.add(i, 1); // A[m][0] <= A[i][0] + A[i][2]なる最大のmを求めたい { int ok = i, ng = N; while (ng - ok > 1) { int m = (ok + ng) / 2; if (A[m][0] <= A[i][0] + A[i][2]) { ok = m; } else { ng = m; } } rm[ok].add(i); } for (int v : rm[i]) { bit.add(v, -1); } } System.out.println(ans); } void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } class Scanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; } else { ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } public boolean hasNext() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while (true) { if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; } else if (b == -1 || !isPrintableChar(b)) { return minus ? -n : n; } else { throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next()); } } }