結果
| 問題 | No.1332 Range Nearest Query |
| ユーザー |
 haruki_K
|
| 提出日時 | 2021-01-09 06:55:40 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 588 ms / 2,500 ms |
| コード長 | 7,818 bytes |
| コンパイル時間 | 3,016 ms |
| コンパイル使用メモリ | 204,112 KB |
| 最終ジャッジ日時 | 2025-01-17 15:07:55 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 48 |
ソースコード
// >>> TEMPLATES#include <bits/stdc++.h>using namespace std;using ll = long long;using ld = long double;using i32 = int32_t;using i64 = int64_t;using u32 = uint32_t;using u64 = uint64_t;#define int ll#define rep(i,n) for (int i = 0; i < (int)(n); i++)#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)#define loop(i,a,B) for (int i = a; i B; i++)#define loopR(i,a,B) for (int i = a; i B; i--)#define all(x) begin(x), end(x)#define allR(x) rbegin(x), rend(x)#define rng(x,l,r) begin(x) + (l), begin(x) + (r)#define pb push_back#define eb emplace_back#define fst first#define snd secondtemplate <class A, class B> auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }template <class... T> auto mt(T&&... x) { return make_tuple(forward<T>(x)...); }template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;auto constexpr INF32 = inf<int32_t>;auto constexpr INF64 = inf<int64_t>;auto constexpr INF = inf<int>;#ifdef LOCAL#include "debug.hpp"#else#define dump(...) (void)(0)#define say(x) (void)(0)#define debug if (0)#endiftemplate <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> {vector<T> &data() { return this->c; }void clear() { this->c.clear(); }};template <class T> using pque_max = pque<T, less<T>>;template <class T> using pque_min = pque<T, greater<T>>;template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;template <class F> struct FixPoint : private F {constexpr FixPoint(F&& f) : F(forward<F>(f)) {}template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }};struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };#define MFP MakeFixPoint()|#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)template <class T, size_t d> struct vec_impl {using type = vector<typename vec_impl<T,d-1>::type>;template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }};template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }template <class T> void quit(T const& x) { cout << x << endl; exit(0); }template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }template <class T> int sz(T const& x) { return x.size(); }template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }const int dx[] = { 1,0,-1,0,1,-1,-1,1 };const int dy[] = { 0,1,0,-1,1,1,-1,-1 };constexpr int popcnt(ll x) { return __builtin_popcountll(x); }// [a,b]template <class Int> Int rand(Int a, Int b) { static mt19937_64 mt{random_device{}()}; return uniform_int_distribution<Int>(a,b)(mt); }i64 irand(i64 a, i64 b) { return rand<i64>(a,b); }u64 urand(u64 a, u64 b) { return rand<u64>(a,b); }template <class It> void shuffle(It l, It r) { shuffle(l, r, mt19937_64(random_device{}())); }// <<<// >>> wavelet matrixtemplate <class Int, size_t LOG> struct WaveletMatrix {static constexpr size_t LW = 6, W = 1<<LW; // W = 64vector<Int> a;vector<uint64_t> v[LOG], s[LOG];size_t z[LOG], n;static constexpr size_t popcount(uint64_t n) { return __builtin_popcountll(n); }static constexpr size_t bsr(uint64_t n) { return n ? 63-__builtin_clzll(n) : -1; }WaveletMatrix(vector<Int> a = {}) : a(a), n(a.size()) {for (auto x : a) assert(0 <= x), assert(bsr(x)+1 <= LOG);size_t m = n/W + 1;vector<Int> b(m);for (int d = LOG-1; d >= 0; --d) {v[d].resize(m), s[d].resize(m+1);rep (i,n) if (a[i]>>d&1) v[d][i>>LW] |= 1ull<<(i&(W-1));rep (i,m) s[d][i+1] = s[d][i] + popcount(v[d][i]);b.clear();rep (i,n) if (~a[i]>>d&1) b.push_back(a[i]);z[d] = b.size();rep (i,n) if (a[i]>>d&1) b.push_back(a[i]);swap(a,b);}}int size() const { return n; }Int operator[](size_t idx) const { return a[idx]; }template <bool val> size_t next(size_t d, size_t r) const {size_t k = s[d][r>>LW] + popcount(v[d][r>>LW] & ((1ull<<(r&(W-1)))-1));return val ? z[d] + k : r-k;}int rank(size_t l, size_t r, Int val) const { // [l,r)assert(l <= r); assert(r <= n);for (int d = LOG-1; d >= 0; --d) {if (val>>d&1) {l = next<1>(d,l), r = next<1>(d,r);} else {l = next<0>(d,l), r = next<0>(d,r);}}return r-l;}int count(size_t l, size_t r, size_t u) const { // [l,r) x [0,u)assert(l <= r); assert(r <= n);int ret = 0;for (int d = LOG-1; d >= 0; --d) {auto l0 = next<0>(d,l), r0 = next<0>(d,r);if (u>>d&1) {ret += r0-l0;l = next<1>(d,l), r = next<1>(d,r);} else {l = l0, r = r0;}}return ret;}int count(size_t l, size_t r, size_t d, size_t u) const { // [l,r)x[d,u)return count(l,r,u) - count(l,r,d);}Int quantile(size_t l, size_t r, size_t k) const { // a[l,r).sort.at(k)assert(l <= r); assert(r <= n);Int ret = 0;for (int d = LOG-1; d >= 0; --d) {auto l0 = next<0>(d,l), r0 = next<0>(d,r);if (k < r0-l0) {l = l0, r = r0;} else {k -= r0-l0, ret |= 1ull<<d;l = next<1>(d,l), r = next<1>(d,r);}}return ret;}};// <<<int32_t main() {int n; cin >> n;vector<int> a(n); cin >> a;WaveletMatrix<int, 32> wm(a);int q; cin >> q;while (q--) {int l, r, x; cin >> l >> r >> x; --l;int cnt = wm.count(l, r, x);int mi = INF;for (int k : { cnt-1, cnt }) {if (0 <= k and k < r-l) {chmin(mi, abs(x - wm.quantile(l, r, k)));}}cout << mi << "\n";}}