結果
問題 | No.789 範囲の合計 |
ユーザー | 👑 hos.lyric |
提出日時 | 2019-02-23 10:04:48 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 109 ms / 1,000 ms |
コード長 | 2,443 bytes |
コンパイル時間 | 865 ms |
コンパイル使用メモリ | 126,232 KB |
実行使用メモリ | 14,696 KB |
最終ジャッジ日時 | 2024-06-13 04:12:52 |
合計ジャッジ時間 | 2,666 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,944 KB |
testcase_02 | AC | 106 ms
6,944 KB |
testcase_03 | AC | 77 ms
6,944 KB |
testcase_04 | AC | 107 ms
14,152 KB |
testcase_05 | AC | 98 ms
14,480 KB |
testcase_06 | AC | 102 ms
9,624 KB |
testcase_07 | AC | 70 ms
6,944 KB |
testcase_08 | AC | 100 ms
14,696 KB |
testcase_09 | AC | 94 ms
13,708 KB |
testcase_10 | AC | 109 ms
6,940 KB |
testcase_11 | AC | 90 ms
7,788 KB |
testcase_12 | AC | 92 ms
6,940 KB |
testcase_13 | AC | 1 ms
6,944 KB |
testcase_14 | AC | 1 ms
6,940 KB |
ソースコード
import std.conv, std.functional, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void bAdd(T)(T[] bit, int pos, T val) in { assert(0 <= pos && pos < bit.length, "bAdd: 0 <= pos < |bit| must hold"); } do { for (int x = pos; x < bit.length; x |= x + 1) { bit[x] += val; } } // sum of [0, pos) T bSum(T)(T[] bit, int pos) in { assert(0 <= pos && pos <= bit.length, "bSum: 0 <= pos <= |bit| must hold"); } do { T sum = 0; for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) { sum += bit[x]; } return sum; } int N; int[] T; long[] X, Y; void main() { try { for (; ; ) { N = readInt(); T = new int[N]; X = new long[N]; Y = new long[N]; foreach (i; 0 .. N) { T[i] = readInt(); X[i] = readLong(); Y[i] = readLong(); } long[] xs; foreach (i; 0 .. N) { if (T[i] == 0) { xs ~= X[i]; } } xs = xs.sort.uniq.array; const xsLen = cast(int)(xs.length); auto bit = new long[xsLen]; long ans; foreach (i; 0 .. N) { if (T[i] == 0) { const pos = xs.lowerBound(X[i]); bit.bAdd(pos, Y[i]); } else { const l = xs.lowerBound(X[i]); const r = xs.upperBound(Y[i]); ans += (bit.bSum(r) - bit.bSum(l)); } } writeln(ans); } } catch (EOFException e) { } }