結果

問題 No.1332 Range Nearest Query
ユーザー 👑 emthrmemthrm
提出日時 2021-01-08 22:00:05
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 233 ms / 2,500 ms
コード長 4,967 bytes
コンパイル時間 2,772 ms
コンパイル使用メモリ 209,888 KB
実行使用メモリ 17,040 KB
最終ジャッジ日時 2023-08-10 09:30:27
合計ジャッジ時間 13,712 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 189 ms
12,192 KB
testcase_04 AC 190 ms
12,192 KB
testcase_05 AC 202 ms
12,092 KB
testcase_06 AC 137 ms
16,796 KB
testcase_07 AC 136 ms
16,736 KB
testcase_08 AC 136 ms
16,780 KB
testcase_09 AC 137 ms
16,840 KB
testcase_10 AC 137 ms
17,040 KB
testcase_11 AC 137 ms
16,736 KB
testcase_12 AC 137 ms
16,788 KB
testcase_13 AC 137 ms
16,800 KB
testcase_14 AC 137 ms
16,796 KB
testcase_15 AC 136 ms
16,732 KB
testcase_16 AC 226 ms
16,840 KB
testcase_17 AC 211 ms
16,732 KB
testcase_18 AC 212 ms
16,736 KB
testcase_19 AC 212 ms
16,860 KB
testcase_20 AC 225 ms
16,876 KB
testcase_21 AC 213 ms
16,792 KB
testcase_22 AC 212 ms
16,732 KB
testcase_23 AC 207 ms
16,796 KB
testcase_24 AC 213 ms
16,736 KB
testcase_25 AC 211 ms
16,840 KB
testcase_26 AC 98 ms
16,732 KB
testcase_27 AC 95 ms
16,720 KB
testcase_28 AC 36 ms
4,888 KB
testcase_29 AC 39 ms
4,820 KB
testcase_30 AC 39 ms
4,840 KB
testcase_31 AC 33 ms
4,820 KB
testcase_32 AC 40 ms
4,824 KB
testcase_33 AC 40 ms
5,160 KB
testcase_34 AC 35 ms
4,896 KB
testcase_35 AC 37 ms
4,876 KB
testcase_36 AC 36 ms
4,888 KB
testcase_37 AC 38 ms
4,824 KB
testcase_38 AC 156 ms
10,956 KB
testcase_39 AC 79 ms
5,468 KB
testcase_40 AC 233 ms
16,708 KB
testcase_41 AC 103 ms
6,560 KB
testcase_42 AC 147 ms
10,676 KB
testcase_43 AC 119 ms
8,216 KB
testcase_44 AC 198 ms
11,860 KB
testcase_45 AC 166 ms
11,460 KB
testcase_46 AC 135 ms
8,436 KB
testcase_47 AC 159 ms
11,220 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

template <typename T>
struct SegmentTree {
  using Monoid = typename T::Monoid;

  SegmentTree(int n) : SegmentTree(std::vector<Monoid>(n, T::unity())) {}

  SegmentTree(const std::vector<Monoid> &a) : n(a.size()) {
    while (p2 < n) p2 <<= 1;
    dat.assign(p2 << 1, T::unity());
    for (int i = 0; i < n; ++i) dat[i + p2] = a[i];
    for (int i = p2 - 1; i > 0; --i) dat[i] = T::merge(dat[i << 1], dat[(i << 1) + 1]);
  }

  void set(int idx, Monoid val) {
    idx += p2;
    dat[idx] = val;
    while (idx >>= 1) dat[idx] = T::merge(dat[idx << 1], dat[(idx << 1) + 1]);
  }

  Monoid get(int left, int right) const {
    Monoid l_res = T::unity(), r_res = T::unity();
    for (left += p2, right += p2; left < right; left >>= 1, right >>= 1) {
      if (left & 1) l_res = T::merge(l_res, dat[left++]);
      if (right & 1) r_res = T::merge(dat[--right], r_res);
    }
    return T::merge(l_res, r_res);
  }

  Monoid operator[](const int idx) const { return dat[idx + p2]; }

  template <typename G>
  int find_right(int left, G g) {
    if (left >= n) return n;
    Monoid val = T::unity();
    left += p2;
    do {
      while (!(left & 1)) left >>= 1;
      Monoid nx = T::merge(val, dat[left]);
      if (!g(nx)) {
        while (left < p2) {
          left <<= 1;
          nx = T::merge(val, dat[left]);
          if (g(nx)) {
            val = nx;
            ++left;
          }
        }
        return left - p2;
      }
      val = nx;
      ++left;
    } while (__builtin_popcount(left) > 1);
    return n;
  }

  template <typename G>
  int find_left(int right, G g) {
    if (right <= 0) return -1;
    Monoid val = T::unity();
    right += p2;
    do {
      --right;
      while (right > 1 && (right & 1)) right >>= 1;
      Monoid nx = T::merge(dat[right], val);
      if (!g(nx)) {
        while (right < p2) {
          right = (right << 1) + 1;
          nx = T::merge(dat[right], val);
          if (g(nx)) {
            val = nx;
            --right;
          }
        }
        return right - p2;
      }
      val = nx;
    } while (__builtin_popcount(right) > 1);
    return -1;
  }

private:
  int n, p2 = 1;
  std::vector<Monoid> dat;
};

namespace monoid {
template <typename T>
struct RangeMinimumQuery {
  using Monoid = T;
  static constexpr T unity() { return std::numeric_limits<T>::max(); }
  static T merge(const T &a, const T &b) { return std::min(a, b); }
};

template <typename T>
struct RangeMaximumQuery {
  using Monoid = T;
  static constexpr T unity() { return std::numeric_limits<T>::min(); }
  static T merge(const T &a, const T &b) { return std::max(a, b); }
};

template <typename T>
struct RangeSumQuery {
  using Monoid = T;
  static constexpr T unity() { return 0; }
  static T merge(const T &a, const T &b) { return a + b; }
};
}  // monoid

int main() {
  int n; cin >> n;
  vector<int> X(n); REP(i, n) cin >> X[i];
  vector<int> pos(n);
  iota(ALL(pos), 0);
  sort(ALL(pos), [&](int a, int b) { return X[a] < X[b]; });
  int q; cin >> q;
  vector<int> l(q), r(q), x(q); REP(i, q) cin >> l[i] >> r[i] >> x[i], --l[i], --r[i];
  vector<int> query(q);
  iota(ALL(query), 0);
  sort(ALL(query), [&](int a, int b) { return x[a] < x[b]; });
  vector<int> ans(q, INF);
  SegmentTree<monoid::RangeMaximumQuery<int>> seg1(n);
  int pos_p = 0;
  REP(i, q) {
    int idx = query[i];
    while (pos_p < n && X[pos[pos_p]] <= x[idx]) {
      seg1.set(pos[pos_p], X[pos[pos_p]]);
      ++pos_p;
    }
    if (seg1.get(l[idx], r[idx] + 1) != monoid::RangeMaximumQuery<int>::unity()) {
      chmin(ans[idx], x[idx] - seg1.get(l[idx], r[idx] + 1));
    }
  }
  reverse(ALL(pos));
  reverse(ALL(query));
  SegmentTree<monoid::RangeMinimumQuery<int>> seg2(n);
  pos_p = 0;
  REP(i, q) {
    int idx = query[i];
    while (pos_p < n && X[pos[pos_p]] >= x[idx]) {
      seg2.set(pos[pos_p], X[pos[pos_p]]);
      ++pos_p;
    }
    if (seg2.get(l[idx], r[idx] + 1) != monoid::RangeMinimumQuery<int>::unity()) {
      chmin(ans[idx], seg2.get(l[idx], r[idx] + 1) - x[idx]);
    }
  }
  REP(i, q) cout << ans[i] << '\n';
  return 0;
}
0