結果
問題 | No.618 labo-index |
ユーザー | 👑 hos.lyric |
提出日時 | 2019-01-29 17:27:37 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 594 ms / 6,000 ms |
コード長 | 3,252 bytes |
コンパイル時間 | 1,098 ms |
コンパイル使用メモリ | 113,200 KB |
実行使用メモリ | 7,500 KB |
最終ジャッジ日時 | 2023-09-03 23:15:59 |
合計ジャッジ時間 | 14,477 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 6 ms
4,376 KB |
testcase_05 | AC | 6 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,376 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 3 ms
4,376 KB |
testcase_09 | AC | 4 ms
4,380 KB |
testcase_10 | AC | 6 ms
4,376 KB |
testcase_11 | AC | 3 ms
4,376 KB |
testcase_12 | AC | 3 ms
4,376 KB |
testcase_13 | AC | 5 ms
4,380 KB |
testcase_14 | AC | 4 ms
4,380 KB |
testcase_15 | AC | 5 ms
4,380 KB |
testcase_16 | AC | 6 ms
4,376 KB |
testcase_17 | AC | 4 ms
4,380 KB |
testcase_18 | AC | 9 ms
4,376 KB |
testcase_19 | AC | 562 ms
6,660 KB |
testcase_20 | AC | 586 ms
6,140 KB |
testcase_21 | AC | 587 ms
7,208 KB |
testcase_22 | AC | 572 ms
5,916 KB |
testcase_23 | AC | 557 ms
7,488 KB |
testcase_24 | AC | 583 ms
5,600 KB |
testcase_25 | AC | 581 ms
5,876 KB |
testcase_26 | AC | 572 ms
5,860 KB |
testcase_27 | AC | 576 ms
6,132 KB |
testcase_28 | AC | 578 ms
6,692 KB |
testcase_29 | AC | 556 ms
6,176 KB |
testcase_30 | AC | 585 ms
5,948 KB |
testcase_31 | AC | 590 ms
5,912 KB |
testcase_32 | AC | 592 ms
7,236 KB |
testcase_33 | AC | 566 ms
6,396 KB |
testcase_34 | AC | 594 ms
7,424 KB |
testcase_35 | AC | 567 ms
7,500 KB |
testcase_36 | AC | 185 ms
6,696 KB |
testcase_37 | AC | 542 ms
6,188 KB |
testcase_38 | AC | 1 ms
4,376 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 Q; int[] T; long[] X; void main() { try { for (; ; ) { Q = readInt(); T = new int[Q]; X = new long[Q]; foreach (q; 0 .. Q) { T[q] = readInt(); X[q] = readLong(); } long geta; long[] xs; geta = 0; foreach (q; 0 .. Q) { switch (T[q]) { case 1: { X[q] -= geta; xs ~= X[q]; } break; case 2: { X[q] = xs[cast(int)(X[q]) - 1]; debug { writeln("remove ", X[q]); } } break; case 3: { geta += X[q]; } break; default: assert(false); } } xs = xs.sort.uniq.array; const xsLen = cast(int)(xs.length); debug { writeln("xs = ", xs); } auto bit = new long[xsLen]; geta = 0; foreach (q; 0 .. Q) { switch (T[q]) { case 1: { bit.bAdd(xs.lowerBound(X[q]), +1); } break; case 2: { bit.bAdd(xs.lowerBound(X[q]), -1); } break; case 3: { geta += X[q]; } break; default: assert(false); } debug { writeln("geta = ", geta); writeln("bit = ", bit); } // # {geta + x >= lo} >= lo, # {geta + x >= hi} < hi long lo = 0, hi = 2L^^60; for (; lo + 1 < hi; ) { const mid = (lo + hi) / 2; const pos = xs.lowerBound(mid - geta); ((bit.bSum(xsLen) - bit.bSum(pos) >= mid) ? lo : hi) = mid; } writeln(lo); } } } catch (EOFException e) { } }