結果
| 問題 | No.1332 Range Nearest Query |
| コンテスト | |
| ユーザー |
 maspy
|
| 提出日時 | 2026-04-13 19:37:02 |
| 言語 | C++23 (gcc 15.2.0 + boost 1.89.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 27,428 bytes |
| 記録 | |
| コンパイル時間 | 5,551 ms |
| コンパイル使用メモリ | 384,888 KB |
| 実行使用メモリ | 16,128 KB |
| 最終ジャッジ日時 | 2026-04-13 19:37:38 |
| 合計ジャッジ時間 | 19,059 ms |
|
ジャッジサーバーID （参考情報） |
judge1_1 / judge2_1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 46 RE * 2 |
ソースコード
// BEGIN: main.cpp
#line 1 "main.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/1332"
// BEGIN: my_template.hpp
#line 1 "my_template.hpp"
#if defined(LOCAL)
#include <my_template_compiled.hpp>
#else
#if defined(__GNUC__)
#include <bits/allocator.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,popcnt")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i128 = __int128;
using u128 = unsigned __int128;
using f128 = __float128;
template <class T>
constexpr T infty = 0;
template <>
constexpr int infty<int> = 1'010'000'000;
template <>
constexpr ll infty<ll> = 2'020'000'000'000'000'000;
template <>
constexpr u32 infty<u32> = infty<int>;
template <>
constexpr u64 infty<u64> = infty<ll>;
template <>
constexpr i128 infty<i128> = i128(infty<ll>) * 2'000'000'000'000'000'000;
template <>
constexpr double infty<double> = numeric_limits<double>::infinity();
template <>
constexpr long double infty<long double> =
numeric_limits<long double>::infinity();
using pi = pair<ll, ll>;
using vi = vector<ll>;
template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vc<T>>;
template <class T>
using vvvc = vector<vvc<T>>;
template <class T>
using vvvvc = vector<vvvc<T>>;
template <class T>
using pq_max = priority_queue<T>;
template <class T>
using pq_min = priority_queue<T, vector<T>, greater<T>>;
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...) \
vector<vector<vector<vector<type>>>> name( \
a, vector<vector<vector<type>>>( \
b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
// https://trap.jp/post/1224/
#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a) - 1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a) - 1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b) - 1; i >= ll(a); --i)
#define overload4(a, b, c, d, e, ...) e
#define overload3(a, b, c, d, ...) d
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define len(x) ll(x.size())
#define elif else if
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define stoi stoll
int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(u32 x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
int popcnt(u64 x) { return __builtin_popcountll(x); }
int popcnt_sgn(int x) { return (__builtin_parity(unsigned(x)) & 1 ? -1 : 1); }
int popcnt_sgn(u32 x) { return (__builtin_parity(x) & 1 ? -1 : 1); }
int popcnt_sgn(ll x) { return (__builtin_parityll(x) & 1 ? -1 : 1); }
int popcnt_sgn(u64 x) { return (__builtin_parityll(x) & 1 ? -1 : 1); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)
int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
template <typename T>
T kth_bit(int k) {
return T(1) << k;
}
template <typename T>
bool has_kth_bit(T x, int k) {
return x >> k & 1;
}
template <typename UINT>
struct all_bit {
struct iter {
UINT s;
iter(UINT s) : s(s) {}
int operator*() const { return lowbit(s); }
iter &operator++() {
s &= s - 1;
return *this;
}
bool operator!=(const iter) const { return s != 0; }
};
UINT s;
all_bit(UINT s) : s(s) {}
iter begin() const { return iter(s); }
iter end() const { return iter(0); }
};
template <typename UINT>
struct all_subset {
static_assert(is_unsigned<UINT>::value);
struct iter {
UINT s, t;
bool ed;
iter(UINT s) : s(s), t(s), ed(0) {}
UINT operator*() const { return s ^ t; }
iter &operator++() {
(t == 0 ? ed = 1 : t = (t - 1) & s);
return *this;
}
bool operator!=(const iter) const { return !ed; }
};
UINT s;
all_subset(UINT s) : s(s) {}
iter begin() const { return iter(s); }
iter end() const { return iter(0); }
};
template <typename T>
T floor(T a, T b) {
return a / b - (a % b && (a ^ b) < 0);
}
template <typename T>
T ceil(T x, T y) {
return floor(x + y - 1, y);
}
template <typename T>
T bmod(T x, T y) {
return x - y * floor(x, y);
}
template <typename T>
pair<T, T> divmod(T x, T y) {
T q = floor(x, y);
return {q, x - q * y};
}
constexpr ll TEN[] = {
1LL,
10LL,
100LL,
1000LL,
10000LL,
100000LL,
1000000LL,
10000000LL,
100000000LL,
1000000000LL,
10000000000LL,
100000000000LL,
1000000000000LL,
10000000000000LL,
100000000000000LL,
1000000000000000LL,
10000000000000000LL,
100000000000000000LL,
1000000000000000000LL,
};
template <typename T, typename U>
T SUM(const U &A) {
return std::accumulate(A.begin(), A.end(), T{});
}
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
template <class C, class T>
inline long long LB(const C &c, const T &x) {
return lower_bound(c.begin(), c.end(), x) - c.begin();
}
template <class C, class T>
inline long long UB(const C &c, const T &x) {
return upper_bound(c.begin(), c.end(), x) - c.begin();
}
#define UNIQUE(x) \
sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()
template <typename T>
T POP(deque<T> &que) {
T a = que.front();
que.pop_front();
return a;
}
template <class T, class Container, class Compare>
T POP(priority_queue<T, Container, Compare> &que) {
T a = que.top();
que.pop();
return a;
}
template <typename T>
T POP(vc<T> &que) {
T a = que.back();
que.pop_back();
return a;
}
template <typename F>
ll binary_search(F check, ll ok, ll ng, bool check_ok = true) {
if (check_ok) assert(check(ok));
while (llabs(ok - ng) > 1) {
auto x = (ng + ok) / 2;
(check(x) ? ok : ng) = x;
}
return ok;
}
template <typename F>
double binary_search_real(F check, double ok, double ng, int iter = 100) {
FOR(iter) {
double x = (ok + ng) / 2;
(check(x) ? ok : ng) = x;
}
return (ok + ng) / 2;
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
T c = max<T>(a, b);
bool changed = (c != a);
a = c;
return changed;
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
T c = min<T>(a, b);
bool changed = (c != a);
a = c;
return changed;
}
// ? は -1
vc<int> s_to_vi(const string &S, char first_char) {
vc<int> A(S.size());
FOR(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }
return A;
}
template <typename T, typename U>
vc<T> cumsum(const vc<U> &A, int off = 1) {
int N = A.size();
vc<T> B(N + 1);
FOR(i, N) { B[i + 1] = B[i] + A[i]; }
if (off == 0) B.erase(B.begin());
return B;
}
// stable sort
template <typename T>
vc<int> argsort(const vc<T> &A) {
vc<int> ids(len(A));
iota(all(ids), 0);
sort(all(ids),
[&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });
return ids;
}
// A[I[0]], A[I[1]], ...
template <typename T>
vc<T> rearrange(const vc<T> &A, const vc<int> &I) {
vc<T> B(len(I));
FOR(i, len(I)) B[i] = A[I[i]];
return B;
}
template <typename T, typename... Vectors>
void concat(vc<T> &first, const Vectors &...others) {
vc<T> &res = first;
(res.insert(res.end(), others.begin(), others.end()), ...);
}
#endif
// END: my_template.hpp
#line 3 "main.cpp"
// BEGIN: other/io.hpp
#line 1 "other/io.hpp"
#define FASTIO
// https://judge.yosupo.jp/submission/21623
namespace fastio {
static constexpr uint32_t SZ = 1 << 17;
char ibuf[SZ];
char obuf[SZ];
char out[100];
// pointer of ibuf, obuf
uint32_t pil = 0, pir = 0, por = 0;
struct Pre {
char num[10000][4];
constexpr Pre() : num() {
for (int i = 0; i < 10000; i++) {
int n = i;
for (int j = 3; j >= 0; j--) {
num[i][j] = n % 10 | '0';
n /= 10;
}
}
}
} constexpr pre;
inline void load() {
memmove(ibuf, ibuf + pil, pir - pil);
pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);
pil = 0;
if (pir < SZ) ibuf[pir++] = '\n';
}
inline void flush() {
fwrite(obuf, 1, por, stdout);
por = 0;
}
void rd(char &c) {
do {
if (pil + 1 > pir) load();
c = ibuf[pil++];
} while (isspace(c));
}
void rd(string &x) {
x.clear();
char c;
do {
if (pil + 1 > pir) load();
c = ibuf[pil++];
} while (isspace(c));
do {
x += c;
if (pil == pir) load();
c = ibuf[pil++];
} while (!isspace(c));
}
template <typename T>
void rd_real(T &x) {
string s;
rd(s);
x = stod(s);
}
template <typename T>
void rd_integer(T &x) {
if (pil + 100 > pir) load();
char c;
do c = ibuf[pil++];
while (c < '-');
bool minus = 0;
if constexpr (is_signed<T>::value || is_same_v<T, i128>) {
if (c == '-') {
minus = 1, c = ibuf[pil++];
}
}
x = 0;
while ('0' <= c) {
x = x * 10 + (c & 15), c = ibuf[pil++];
}
if constexpr (is_signed<T>::value || is_same_v<T, i128>) {
if (minus) x = -x;
}
}
template <class T>
enable_if_t<is_integral_v<T> || is_same_v<T, i128> || is_same_v<T, u128>> rd(
T &x) {
rd_integer(x);
}
template <class T>
enable_if_t<is_floating_point_v<T> || is_same_v<T, f128>> rd(T &x) {
rd_real(x);
}
template <class T, class U>
void rd(pair<T, U> &p) {
rd(p.first), rd(p.second);
}
template <size_t N = 0, typename T>
void rd_tuple(T &t) {
if constexpr (N < tuple_size<T>::value) {
auto &x = get<N>(t);
rd(x);
rd_tuple<N + 1>(t);
}
}
template <class... T>
void rd(tuple<T...> &tpl) {
rd_tuple(tpl);
}
template <size_t N = 0, typename T>
void rd(array<T, N> &x) {
for (auto &d : x) rd(d);
}
template <class T>
void rd(vc<T> &x) {
for (auto &d : x) rd(d);
}
void read() {}
template <class H, class... T>
void read(H &h, T &...t) {
rd(h), read(t...);
}
inline void wt_range(const char *s, size_t n) {
size_t i = 0;
while (i < n) {
if (por == SZ) flush();
size_t chunk = min(n - i, (size_t)(SZ - por));
memcpy(obuf + por, s + i, chunk);
por += chunk;
i += chunk;
}
}
void wt(const char c) {
if (por == SZ) flush();
obuf[por++] = c;
}
void wt(const char *s) { wt_range(s, strlen(s)); }
void wt(const string &s) { wt_range(s.data(), s.size()); }
template <typename T>
void wt_integer(T x) {
if (por > SZ - 100) flush();
if (x < 0) {
obuf[por++] = '-', x = -x;
}
int outi;
for (outi = 96; x >= 10000; outi -= 4) {
memcpy(out + outi, pre.num[x % 10000], 4);
x /= 10000;
}
if (x >= 1000) {
memcpy(obuf + por, pre.num[x], 4);
por += 4;
} else if (x >= 100) {
memcpy(obuf + por, pre.num[x] + 1, 3);
por += 3;
} else if (x >= 10) {
int q = (x * 103) >> 10;
obuf[por] = q | '0';
obuf[por + 1] = (x - q * 10) | '0';
por += 2;
} else
obuf[por++] = x | '0';
memcpy(obuf + por, out + outi + 4, 96 - outi);
por += 96 - outi;
}
template <typename T>
inline void wt_real(T x) {
static char buf[1000];
int n = std::snprintf(buf, sizeof(buf), "%.15f", (double)x);
wt_range(buf, (size_t)n);
}
template <class T>
enable_if_t<is_integral_v<T> || is_same_v<T, i128> || is_same_v<T, u128>> wt(
T x) {
wt_integer(x);
}
template <class T>
enable_if_t<is_floating_point_v<T> || is_same_v<T, f128>> wt(T x) {
wt_real(x);
}
inline void wt(bool b) { wt(static_cast<char>('0' + (b ? 1 : 0))); }
template <class T, class U>
void wt(const pair<T, U> &val) {
wt(val.first);
wt(' ');
wt(val.second);
}
template <size_t N = 0, typename T>
void wt_tuple(const T &t) {
if constexpr (N < tuple_size<T>::value) {
if constexpr (N > 0) wt(' ');
wt(get<N>(t));
wt_tuple<N + 1>(t);
}
}
template <class... T>
void wt(const tuple<T...> &tpl) {
wt_tuple(tpl);
}
template <class T, size_t S>
void wt(const array<T, S> &val) {
auto n = val.size();
for (size_t i = 0; i < n; i++) {
if (i) wt(' ');
wt(val[i]);
}
}
template <class T>
void wt(const vector<T> &val) {
auto n = val.size();
for (size_t i = 0; i < n; i++) {
if (i) wt(' ');
wt(val[i]);
}
}
void print() { wt('\n'); }
template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
wt(head);
if (sizeof...(Tail)) wt(' ');
print(forward<Tail>(tail)...);
}
// gcc expansion. called automaticall after main.
void __attribute__((destructor)) _d() { flush(); }
} // namespace fastio
using fastio::flush;
using fastio::print;
using fastio::read;
#if defined(LOCAL)
#define HDR "[DEBUG:", __func__, __LINE__, "]"
#define SHOW(...) \
SHOW_IMPL(__VA_ARGS__, SHOW8, SHOW7, SHOW6, SHOW5, SHOW4, SHOW3, SHOW2, \
SHOW1) \
(__VA_ARGS__)
#define SHOW_IMPL(_1, _2, _3, _4, _5, _6, _7, _8, NAME, ...) NAME
#define SHOW1(x) print(HDR, #x, "=", (x)), flush()
#define SHOW2(x, y) print(HDR, #x, "=", (x), #y, "=", (y)), flush()
#define SHOW3(x, y, z) \
print(HDR, #x, "=", (x), #y, "=", (y), #z, "=", (z)), flush()
#define SHOW4(x, y, z, w) \
print(HDR, #x, "=", (x), #y, "=", (y), #z, "=", (z), #w, "=", (w)), flush()
#define SHOW5(x, y, z, w, v) \
print(HDR, #x, "=", (x), #y, "=", (y), #z, "=", (z), #w, "=", (w), #v, "=", \
(v)), \
flush()
#define SHOW6(x, y, z, w, v, u) \
print(HDR, #x, "=", (x), #y, "=", (y), #z, "=", (z), #w, "=", (w), #v, "=", \
(v), #u, "=", (u)), \
flush()
#define SHOW7(x, y, z, w, v, u, t) \
print(HDR, #x, "=", (x), #y, "=", (y), #z, "=", (z), #w, "=", (w), #v, "=", \
(v), #u, "=", (u), #t, "=", (t)), \
flush()
#define SHOW8(x, y, z, w, v, u, t, s) \
print(HDR, #x, "=", (x), #y, "=", (y), #z, "=", (z), #w, "=", (w), #v, "=", \
(v), #u, "=", (u), #t, "=", (t), #s, "=", (s)), \
flush()
#else
#define SHOW(...)
#endif
#define INT(...) \
int __VA_ARGS__; \
read(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
read(__VA_ARGS__)
#define U32(...) \
u32 __VA_ARGS__; \
read(__VA_ARGS__)
#define U64(...) \
u64 __VA_ARGS__; \
read(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
read(__VA_ARGS__)
#define CHAR(...) \
char __VA_ARGS__; \
read(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
read(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
read(name)
#define VV(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(w)); \
read(name)
void YES(bool t = 1) { print(t ? "YES" : "NO"); }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { print(t ? "Yes" : "No"); }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { print(t ? "yes" : "no"); }
void no(bool t = 1) { yes(!t); }
void YA(bool t = 1) { print(t ? "YA" : "TIDAK"); }
void TIDAK(bool t = 1) { YA(!t); }
// END: other/io.hpp
#line 4 "main.cpp"
// BEGIN: ds/wavelet_matrix/wavelet_matrix.hpp
#line 1 "ds/wavelet_matrix/wavelet_matrix.hpp"
// BEGIN: ds/bit_vector.hpp
#line 1 "ds/bit_vector.hpp"
struct Bit_Vector {
int n;
bool prepared = 0;
vc<pair<u64, u32>> dat;
Bit_Vector(int n = 0) : n(n) { dat.assign((n + 127) >> 6, {0, 0}); }
void set(int i) {
assert(!prepared && (0 <= i && i < n));
dat[i >> 6].fi |= u64(1) << (i & 63);
}
void reset() {
fill(all(dat), pair<u64, u32>{0, 0});
prepared = 0;
}
void build() {
prepared = 1;
FOR(i, len(dat) - 1) dat[i + 1].se = dat[i].se + popcnt(dat[i].fi);
}
bool operator[](int i) const { return dat[i >> 6].fi >> (i & 63) & 1; }
// [0, k) 内の 1 の個数
int count_prefix(int k, bool f = true) const {
assert(prepared);
auto [a, b] = dat[k >> 6];
int ret = b + popcnt(a & ((u64(1) << (k & 63)) - 1));
return (f ? ret : k - ret);
}
int count(int L, int R, bool f = true) const {
return count_prefix(R, f) - count_prefix(L, f);
}
string to_string() const {
string ans;
FOR(i, n) ans += '0' + (dat[i / 64].fi >> (i % 64) & 1);
return ans;
}
};
// END: ds/bit_vector.hpp
#line 2 "ds/wavelet_matrix/wavelet_matrix.hpp"
// BEGIN: ds/dummy_data_structure.hpp
#line 1 "ds/dummy_data_structure.hpp"
// BEGIN: alg/monoid/dummy.hpp
#line 1 "alg/monoid/dummy.hpp"
struct Monoid_Dummy {
using value_type = char;
static constexpr bool commute = true;
static value_type op(value_type, value_type) { return 0; }
static value_type unit() { return 0; }
};
// END: alg/monoid/dummy.hpp
#line 2 "ds/dummy_data_structure.hpp"
struct Dummy_Data_Structure {
using MX = Monoid_Dummy;
using T = typename MX::value_type;
void build(const vc<T>& A) {}
};// END: ds/dummy_data_structure.hpp
#line 3 "ds/wavelet_matrix/wavelet_matrix.hpp"
template <typename Y, typename SEGTREE>
struct Uncompressed_Wavelet_Matrix {
using Mono = typename SEGTREE::MX;
using T = typename Mono::value_type;
static_assert(Mono::commute);
static_assert(is_same_v<Y, int> || is_same_v<Y, ll>);
int n = 0, log = 0;
vc<int> mid;
vc<Bit_Vector> bv;
vc<SEGTREE> seg;
Y limit;
Uncompressed_Wavelet_Matrix() = default;
// f(i) = {A[i], dat[i]}
template <typename F>
Uncompressed_Wavelet_Matrix(int n, F f, int log = -1) {
build(n, f, log);
}
Uncompressed_Wavelet_Matrix(const vc<Y>& A, int log = -1) {
static_assert(is_same_v<SEGTREE, Dummy_Data_Structure>);
build(
len(A), [&](int i) -> pair<Y, T> { return {A[i], Mono::unit()}; }, log);
}
template <typename F>
void build(int n, F f, int log = -1) {
this->n = n;
vc<Y> A(n);
vc<T> S(n);
FOR(i, n) tie(A[i], S[i]) = f(i);
if (log == -1) {
log = (n == 0 ? 0 : topbit(MAX(A)) + 1);
} else {
for (auto& x : A) assert(0 <= x && topbit(x) < log);
}
this->log = log;
limit = Y(1) << log;
if constexpr (is_same_v<Y, int>) assert(0 <= log && log <= 30);
if constexpr (is_same_v<Y, ll>) assert(0 <= log && log <= 62);
mid.resize(log), bv.assign(log, Bit_Vector(n));
vc<Y> A0(n), A1(n);
vc<T> S0(n), S1(n);
seg.resize(log + 1);
seg[log].build(S);
for (int d = log - 1; d >= 0; --d) {
int p0 = 0, p1 = 0;
for (int i = 0; i < n; ++i) {
if (A[i] >> d & 1) {
bv[d].set(i), A1[p1] = A[i], S1[p1] = S[i], p1++;
} else {
A0[p0] = A[i], S0[p0] = S[i], p0++;
}
}
swap(A, A0), swap(S, S0);
move(A1.begin(), A1.begin() + p1, A.begin() + p0);
move(S1.begin(), S1.begin() + p1, S.begin() + p0);
mid[d] = p0, bv[d].build(), seg[d].build(S);
}
}
tuple<int, int, int, int> get_subtree(int d, int L, int R) const {
assert(1 <= d && d <= log);
int a = bv[d - 1].count_prefix(L), b = bv[d - 1].count_prefix(R);
return {L - a, R - b, mid[d - 1] + a, mid[d - 1] + b};
}
template <typename F>
void work_point(F f, int i) {
assert(0 <= i && i < n);
f(log, i);
FOR_R(d, log) {
int a = bv[d].count_prefix(i);
if (bv[d][i]) {
i = mid[d] + a;
} else {
i = i - a;
}
f(d, i);
}
}
template <typename F>
void work_prefix(F f, int L, int R, Y y) const {
assert(0 <= y && y <= limit);
if (y == 0) return;
if (y == limit) {
f(log, L, R);
return;
}
FOR_R(d, log) {
auto [L0, R0, L1, R1] = get_subtree(d + 1, L, R);
if (y >> d & 1) {
f(d, L0, R0);
L = L1, R = R1;
} else {
L = L0, R = R0;
}
}
}
template <typename F>
void work_range(F f, int L, int R, Y y1, Y y2) const {
assert(0 <= y1 && y1 <= y2 && y2 <= limit);
if (y1 == 0) return work_prefix(f, L, R, y2);
auto dfs = [&](auto& dfs, int d, int L, int R, Y y1, Y y2) -> void {
if (y1 == y2) return;
if (y1 == 0 && y2 == Y(1) << d) {
f(d, L, R);
return;
}
assert(d > 0);
auto [L0, R0, L1, R1] = get_subtree(d, L, R);
Y m = (Y(1) << (d - 1));
if (y2 <= m) {
dfs(dfs, d - 1, L0, R0, y1, y2);
} else if (y1 >= m) {
dfs(dfs, d - 1, L1, R1, y1 - m, y2 - m);
} else {
dfs(dfs, d - 1, L0, R0, y1, m);
dfs(dfs, d - 1, L1, R1, 0, y2 - m);
}
};
dfs(dfs, log, L, R, y1, y2);
}
// [L,R) x [0,y)
int prefix_count(int L, int R, Y y) const {
int cnt = 0;
work_prefix([&](int d, int a, int b) { cnt += b - a; }, L, R, y);
return cnt;
}
// [L,R) x [y1,y2)
int count(int L, int R, Y y1, Y y2) const {
return prefix_count(L, R, y2) - prefix_count(L, R, y1);
}
// [L,R) x [0,y)
T prefix_prod(int L, int R, Y y) const {
T ans = Mono::unit();
work_prefix(
[&](int d, int a, int b) { ans = Mono::op(ans, seg[d].prod(a, b)); }, L,
R, y);
return ans;
}
// [L,R) x [y1,y2)
T prod(int L, int R, Y y1, Y y2) const {
T ans = Mono::unit();
work_range(
[&](int d, int a, int b) { ans = Mono::op(ans, seg[d].prod(a, b)); }, L,
R, y1, y2);
return ans;
}
T prod_all(int L, int R) const { return seg[log].prod(L, R); }
// [L,R) x [0,y)
pair<int, T> prefix_count_and_prod(int L, int R, Y y) const {
pair<int, T> ans = {0, Mono::unit()};
work_prefix(
[&](int d, int a, int b) {
ans.fi += b - a;
ans.se = Mono::op(ans.se, seg[d].prod(a, b));
},
L, R, y);
return ans;
}
// [L,R) x [y1,y2)
pair<int, T> count_and_prod(int L, int R, Y y1, Y y2) const {
pair<int, T> ans = {0, Mono::unit()};
work_range(
[&](int d, int a, int b) {
ans.fi += b - a;
ans.se = Mono::op(ans.se, seg[d].prod(a, b));
},
L, R, y1, y2);
return ans;
}
Y kth(int L, int R, int k) const {
assert(0 <= k && k < R - L);
Y ans = 0;
for (int d = log - 1; d >= 0; --d) {
auto [L0, R0, L1, R1] = get_subtree(d + 1, L, R);
if (k < R0 - L0) {
L = L0, R = R0;
} else {
ans |= Y(1) << d;
k -= R0 - L0, L = L1, R = R1;
}
}
return ans;
}
template <bool upper>
Y median(int L, int R) const {
assert(0 <= L && L < R && R <= n);
int k = (upper ? (R - L) / 2 : (R - L - 1) / 2);
return kth(L, R, k);
}
void set(int i, T t) {
assert(0 <= i && i < n);
work_point([&](int d, int i) { seg[d].set(i, t); }, i);
}
void multiply(int i, T t) {
assert(0 <= i && i < n);
work_point([&](int d, int i) { seg[d].multiply(i, t); }, i);
}
void add(int i, T t) {
assert(0 <= i && i < n);
work_point([&](int d, int i) { seg[d].add(i, t); }, i);
}
// [L,R) x [0,y) での check(y, cnt, prod) が true となる最大の (Y,cnt,prod)
template <typename F>
tuple<Y, int, T> max_right(F check, int L, int R) const {
assert(limit < infty<Y>);
int cnt = 0;
Y y = 0;
T t = Mono::unit();
T t_all = seg[log].prod(L, R);
assert(check(0, 0, Mono::unit()));
if (check(limit, R - L, t_all)) {
y = binary_search([&](Y y) -> bool { return check(y, R - L, t_all); },
limit, infty<Y> + 1);
return {y, R - L, t_all};
}
for (int d = log - 1; d >= 0; --d) {
auto [L0, R0, L1, R1] = get_subtree(d + 1, L, R);
Y y1 = y | Y(1) << d;
int cnt1 = cnt + R0 - L0;
T t1 = Mono::op(t, seg[d].prod(L0, R0));
if (check(y1, cnt1, t1)) {
y = y1, cnt = cnt1, t = t1, L = L1, R = R1;
} else {
L = L0, R = R0;
}
}
return {y, cnt, t};
}
};
template <typename Y, typename SEGTREE>
struct Compressed_Wavelet_Matrix {
using Mono = typename SEGTREE::MX;
using T = typename Mono::value_type;
int n = 0;
vc<Y> key;
Uncompressed_Wavelet_Matrix<int, SEGTREE> wm;
Compressed_Wavelet_Matrix() = default;
// f(i) = {A[i], dat[i]}
template <typename F>
Compressed_Wavelet_Matrix(int n, F f) {
build(n, f);
}
Compressed_Wavelet_Matrix(const vc<Y>& A) {
static_assert(is_same_v<SEGTREE, Dummy_Data_Structure>);
build(A);
}
template <typename F>
void build(int n, F f) {
this->n = n;
vc<Y> A(n);
vc<T> S(n);
FOR(i, n) tie(A[i], S[i]) = f(i);
key = A;
UNIQUE(key);
wm.build(n, [&](int i) -> pair<int, T> {
int k = LB(key, A[i]);
return {k, S[i]};
});
}
void build(const vc<Y>& A) {
static_assert(is_same_v<SEGTREE, Dummy_Data_Structure>);
n = len(A);
key = A;
UNIQUE(key);
wm.build(n, [&](int i) -> pair<int, T> {
int k = LB(key, A[i]);
return {k, Mono::unit()};
});
}
Y kth(int L, int R, int k) const { return key[wm.kth(L, R, k)]; }
template <bool upper>
Y median(int L, int R) const {
return key[wm.template median<upper>(L, R)];
}
// [L,R) x [-inf,y)
int prefix_count(int L, int R, Y y) const {
return wm.prefix_count(L, R, LB(key, y));
}
// [L,R) x [y1,y2)
int count(int L, int R, Y y1, Y y2) const {
return wm.count(L, R, LB(key, y1), LB(key, y2));
}
// [L,R) x [-inf,y)
T prefix_prod(int L, int R, Y y) const {
return wm.prefix_prod(L, R, LB(key, y));
}
// [L,R) x [y1,y2)
T prod(int L, int R, Y y1, Y y2) const {
return wm.prod(L, R, LB(key, y1), LB(key, y2));
}
T prod_all(int L, int R) const { return wm.prod_all(L, R); }
// [L,R) x [-inf,y)
pair<int, T> prefix_count_and_prod(int L, int R, Y y) const {
return wm.prefix_count_and_prod(L, R, LB(key, y));
}
// [L,R) x [y1,y2)
pair<int, T> count_and_prod(int L, int R, Y y1, Y y2) const {
return wm.count_and_prod(L, R, LB(key, y1), LB(key, y2));
}
void set(int i, T t) { wm.set(i, t); }
void multiply(int i, T t) { wm.multiply(i, t); }
void add(int i, T t) { wm.add(i, t); }
};
template <typename Y, bool compress, typename SEGTREE = Dummy_Data_Structure>
using Wavelet_Matrix =
conditional_t<compress, Compressed_Wavelet_Matrix<Y, SEGTREE>,
Uncompressed_Wavelet_Matrix<Y, SEGTREE>>;
// END: ds/wavelet_matrix/wavelet_matrix.hpp
#line 5 "main.cpp"
void solve() {
LL(N);
VEC(ll, X, N);
Wavelet_Matrix<ll, false> WM(X);
LL(Q);
FOR(Q) {
LL(l, r, x);
--l;
ll ANS = infty<ll>;
ll n = WM.count(l, r, 0, x);
if (n > 0) chmin(ANS, abs(x - WM.kth(l, r, n - 1)));
if (n < r - l) chmin(ANS, abs(x - WM.kth(l, r, n)));
print(ANS);
}
}
signed main() {
solve();
return 0;
}// END: main.cpp