結果

問題 No.1332 Range Nearest Query
ユーザー 👑 hos.lyrichos.lyric
提出日時 2021-01-08 22:33:42
言語 D
(dmd 2.106.1)
結果
WA  
実行時間 -
コード長 4,199 bytes
コンパイル時間 2,175 ms
コンパイル使用メモリ 119,768 KB
実行使用メモリ 32,860 KB
最終ジャッジ日時 2023-09-04 11:48:49
合計ジャッジ時間 26,325 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 2 ms
4,384 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 229 ms
24,416 KB
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 AC 122 ms
6,296 KB
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
権限があれば一括ダウンロードができます

ソースコード

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]; --pos) {
            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) {
  }
}
0