結果

問題 No.1332 Range Nearest Query
ユーザー 👑 hos.lyric
提出日時 2021-01-08 22:41:45
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 451 ms / 2,500 ms
コード長 4,194 bytes
コンパイル時間 1,037 ms
コンパイル使用メモリ 132,224 KB
実行使用メモリ 34,200 KB
最終ジャッジ日時 2024-06-22 10:35:23
合計ジャッジ時間 18,781 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 48
権限があれば一括ダウンロードができます

ソースコード

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

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, 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)); }
// T: monoid
// op: T * T -> T
// query(a, b): returns t_a ... t_{b-1}
class SegmentTree(T, alias op) {
  import std.functional : binaryFun;
  alias opFun = binaryFun!op;
  const(T) idT;
  int n;
  T[] ts;
  this(int n_, const(T) idT) {
    this.idT = idT;
    for (n = 1; n < n_; n <<= 1) {}
    ts = new T[n << 1];
    ts[] = idT;
  }
  this(inout(T)[] ts_, const(T) idT) {
    this.idT = idT;
    const n_ = cast(int)(ts_.length);
    for (n = 1; n < n_; n <<= 1) {}
    ts = new T[n << 1];
    ts[0 .. n] = idT;
    ts[n .. n + n_] = ts_[];
    ts[n + n_ .. n << 1] = idT;
    build();
  }
  ref T at(int a) {
    return ts[n + a];
  }
  void build() {
    foreach_reverse (a; 1 .. n) ts[a] = opFun(ts[a << 1], ts[a << 1 | 1]);
  }
  void set(int a, const(T) val) {
    ts[a += n] = val;
    for (; a >>= 1; ) ts[a] = opFun(ts[a << 1], ts[a << 1 | 1]);
  }
  void mulL(int a, const(T) val) {
    set(a, opFun(val, ts[a + n]));
  }
  void mulR(int a, const(T) val) {
    set(a, opFun(ts[a + n], val));
  }
  T query(int a, int b) const {
    T prodL = idT, prodR = idT;
    for (a += n, b += n; a < b; a >>= 1, b >>= 1) {
      if (a & 1) prodL = opFun(prodL, ts[a++]);
      if (b & 1) prodR = opFun(ts[--b], prodR);
    }
    return opFun(prodL, prodR);
  }
}
enum INF = 10^^9 + 1000;
void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto X = new int[N];
      foreach (i; 0 .. N) {
        X[i] = readInt();
      }
      const Q = readInt();
      auto L = new int[Q];
      auto R = new int[Q];
      auto Y = new int[Q];
      foreach (q; 0 .. Q) {
        L[q] = readInt() - 1;
        R[q] = readInt();
        Y[q] = readInt();
      }
      
      alias Entry = Tuple!(int, "val", int, "key");
      auto xs = new Entry[N];
      foreach (i; 0 .. N) {
        xs[i] = Entry(X[i], i);
      }
      xs.sort;
      auto ys = new Entry[Q];
      foreach (q; 0 .. Q) {
        ys[q] = Entry(Y[q], q);
      }
      ys.sort;
      
      auto ans = new int[Q];
      ans[] = INF;
      {
        auto seg = new SegmentTree!(int, max)(N, -INF);
        int pos = 0;
        foreach (ref f; ys) {
          const q = f.key;
          for (; pos < N && xs[pos].val <= Y[q]; ) {
            const i = xs[pos++].key;
            seg.set(i, X[i]);
          }
          const res = seg.query(L[q], R[q]);
          if (res > -INF) {
            chmin(ans[q], Y[q] - res);
          }
        }
      }
      debug {
        writeln("ans = ", ans);
      }
      {
        auto seg = new SegmentTree!(int, min)(N, +INF);
        int pos = N;
        foreach_reverse (ref f; ys) {
          const q = f.key;
          for (; pos > 0 && xs[pos - 1].val >= Y[q]; ) {
            const i = xs[--pos].key;
            seg.set(i, X[i]);
          }
          const res = seg.query(L[q], R[q]);
          if (res < +INF) {
            chmin(ans[q], res - Y[q]);
          }
        }
      }
      
      foreach (q; 0 .. Q) {
        writeln(ans[q]);
      }
    }
  } catch (EOFException e) {
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0