結果

問題 No.618 labo-index
ユーザー 👑 hos.lyric
提出日時 2019-01-29 17:27:37
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 595 ms / 6,000 ms
コード長 3,252 bytes
コンパイル時間 1,174 ms
コンパイル使用メモリ 127,336 KB
実行使用メモリ 7,040 KB
最終ジャッジ日時 2024-06-13 03:50:17
合計ジャッジ時間 14,655 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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) {
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0