結果
問題 | No.1332 Range Nearest Query |
ユーザー |
|
提出日時 | 2024-12-03 20:40:12 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 42,517 bytes |
コンパイル時間 | 6,712 ms |
コンパイル使用メモリ | 351,608 KB |
最終ジャッジ日時 | 2025-02-19 15:47:51 |
合計ジャッジ時間 | 12,504 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
In file included from /usr/include/c++/13/string:43, from /usr/include/c++/13/bitset:52, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:52, from /usr/include/x86_64-linux-gnu/c++/13/bits/extc++.h:32, from main.cpp:7: /usr/include/c++/13/bits/allocator.h: In destructor ‘constexpr std::__cxx11::basic_string<char>::_Alloc_hider::~_Alloc_hider()’: /usr/include/c++/13/bits/allocator.h:184:7: error: inlining failed in call to ‘always_inline’ ‘constexpr std::allocator< <template-parameter-1-1> >::~allocator() noexcept [with _Tp = char]’: target specific option mismatch 184 | ~allocator() _GLIBCXX_NOTHROW { } | ^ In file included from /usr/include/c++/13/string:54: /usr/include/c++/13/bits/basic_string.h:181:14: note: called from here 181 | struct _Alloc_hider : allocator_type // TODO check __is_final | ^~~~~~~~~~~~
ソースコード
#pragma region Macros#pragma GCC optimize("O3,unroll-loops")#pragma GCC target("sse,sse2,sse3,ssse3,sse4,fma,mmx,abm,bmi,bmi2,popcnt,lzcnt")#pragma GCC target("avx2") // CF, CodeChef, HOJ ではコメントアウト#include <bits/extc++.h>// #include <atcoder/all>// using namespace atcoder;using namespace std;using namespace __gnu_pbds;// #include <boost/multiprecision/cpp_dec_float.hpp>// #include <boost/multiprecision/cpp_int.hpp>// namespace mp = boost::multiprecision;// using lll = mp::cpp_int;// using lld = mp::cpp_dec_float_50; // 十進50桁. ldは19桁.// // using lld = mp::cpp_dec_float_100;// // using lld = mp::number<mp::cpp_dec_float<200>>;// lld Beps = 0.00000000000000000000000000000001; // 1e-32// const bool equals(lld a, lld b) { return mp::fabs(a - b) < Beps; }#define pb emplace_back#define int ll#define endl '\n'using ll = long long;using ld = long double;const ld PI = acosl(-1);const int INF = 1 << 30;const ll INFL = 1LL << 61;const int MOD = 998244353;// const int MOD = 1000000007;const ld EPS = 1e-10;const bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }const vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1, 0}; // → ↓ ← ↑ ↘ ↙ ↖ ↗ 自const vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1, 0};struct Edge {using cost_type = int;int from, to;cost_type cost;Edge() {}Edge(int to, cost_type cost) : to(to), cost(cost), from(-1) {}Edge(int from, int to, cost_type cost) : from(from), to(to), cost(cost) {}bool operator ==(const Edge &e) {return this->from == e.from && this->to == e.to && this->cost == e.cost;}bool operator !=(const Edge &e) {return this->from != e.from or this->to != e.to or this->cost != e.cost;}bool operator <(const Edge &e) { return this->cost < e.cost; }bool operator >(const Edge &e) { return this->cost > e.cost; }};chrono::system_clock::time_point start;__attribute__((constructor))void constructor() {ios::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(10);start = chrono::system_clock::now();}struct RNG {using state_type = uint32_t;using result_type = uint32_t;state_type x = 123456789, y = 362436039, z = 521288629, w = 88675123;constexpr static double INV_MAX = 1.0 / 0xFFFFFFFF;// constexpr RNG(state_type seed = 88675123): w(seed) {}RNG() {auto now = chrono::high_resolution_clock::now();w = static_cast<state_type>(now.time_since_epoch().count() & 0xFFFFFFFF);}constexpr result_type operator()() {state_type t = x ^ (x << 11);x = y, y = z, z = w;return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));}constexpr result_type Int(state_type a) { // [0, a)return ((uint64_t) (*this)() * a) >> 32;}constexpr result_type Int(state_type a, state_type b) { // [a, b]return Int(b - a + 1) + a;}constexpr double prob() { // [0, 1]return (*this)() * INV_MAX;}constexpr double Double(double a, double b) { // [a, b]return prob() * (b - a) + a;}} rng;namespace bit_function {using i64 = ll;// using i64 = uint64_t;// bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)i64 lrmask(int l, int r) { return (1LL << r) - (1LL << l); }i64 sub_bit(i64 x, int l, int r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可i64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }i64 popcount(i64 x) { return __builtin_popcountll(x); }i64 popcount(i64 x, int l, int r) { return __builtin_popcountll(sub_bit(x, l, r)); }i64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); } // 最上位bitより下のみi64 unpopcount(i64 x, int l, int r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); } // 最上位bitより上も含まれうるbool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; } // xが負のときは常にfalsebool is_pow4(i64 x) { return __builtin_popcountll(x) == 1 && __builtin_ctzll(x) % 2 == 0; }//bool is_pow4(ll x) { return __builtin_popcountll(x) == 1 && (x&0x55555555); }int top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)int bot_bit(i64 x) { return __builtin_ctzll(x);} // 2^kの位 (x > 0)int next_bit(i64 x, int k) { // upper_boundx >>= (k + 1);int pos = k + 1;while (x > 0) {if (x & 1) return pos;x >>= 1;pos++;}return -1;}int prev_bit(i64 x, int k) {// k = min(k, bit_width(x)); ?int pos = 0;while (x > 0 && pos < k) {if (x & 1) {if (pos < k) return pos;}x >>= 1;pos++;}return -1;}int kth_bit(i64 x, int k) { // kは1-indexedint pos = 0, cnt = 0;while (x > 0) {if (x & 1) {cnt++;if (cnt == k) return pos;}x >>= 1;pos++;}return -1;}i64 msb(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // maski64 lsb(i64 x) { return (x & -x); } // maskint countl_zero(i64 x) { return __builtin_clzll(x); }int countl_one(i64 x) { // countl_oneと定義が異なるので注意i64 ret = 0, k = 63 - __builtin_clzll(x);while (k != -1 && (x & (1LL << k))) { k--; ret++; }return ret;}int countr_zero(i64 x) { return __builtin_ctzll(x); } // x=0のとき64int countr_one(i64 x) { int ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }// int countr_one(ll x) { return __builtin_popcount(x ^ (x & -~x));i64 l_one(i64 x) { // 最上位で連なってる1のmaskif (x == 0) return 0;i64 ret = 0, k = 63 - __builtin_clzll(x);while (k != -1 && (x & (1LL << k))) { ret += 1LL << k; k--; }return ret;}int floor_log2(i64 x) { return 63 - __builtin_clzll(x); } // top_bitint ceil_log2(i64 x) { return 64 - __builtin_clzll(x - 1); }i64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // msbi64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }i64 rotl(i64 x, int k) { // 有効bit内でrotate. オーバーフロー注意i64 w = bit_width(x); k %= w;return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);}// i64 rotl(i64 x, i64 l, i64 m, i64 r) {}i64 rotr(i64 x, int k) {i64 w = bit_width(x); k %= w;return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);}// i64 rotr(i64 x, i64 l, i64 m, i64 r) {}i64 bit_reverse(i64 x) { // 有効bit内で左右反転i64 r = 0, w = bit_width(x);for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);return r;}// i64 bit_reverse(i64 x, int l, int r) {}bool is_palindrome(i64 x) { return x == bit_reverse(x); }bool is_palindrome(i64 x, int l, int r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }i64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意i64 erase(i64 x, int l, int r) { return x >> r << l | x & ((1LL << l) - 1); } // [l, r) をカットi64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }i64 hamming(i64 a, i64 b, int l, int r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }i64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }i64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数i64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数i64 next_combination(i64 x) {i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctzll(x) + 1));}} using namespace bit_function;namespace util_function {namespace Std = std;__int128_t POW(__int128_t x, int n) {__int128_t ret = 1;assert(n >= 0);if (x == 1 or n == 0) ret = 1;else if (x == -1 && n % 2 == 0) ret = 1;else if (x == -1) ret = -1;else if (n % 2 == 0) {// assert(x < INFL);ret = POW(x * x, n / 2);} else {// assert(x < INFL);ret = x * POW(x, n - 1);}return ret;}int per(int x, int y) { // x = qy + r (0 <= r < y) を満たすqassert(y != 0);if (x >= 0 && y > 0) return x / y;if (x >= 0 && y < 0) return x / y - (x % y < 0);if (x < 0 && y < 0) return x / y + (x % y < 0);return x / y - (x % y < 0); // (x < 0 && y > 0)}int mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすrassert(y != 0);return x - y * per(x, y);} // https://yukicoder.me/problems/no/2781int floor(int x, int y) { // (ld)x / y 以下の最大の整数assert(y != 0);if (y < 0) x = -x, y = -y;return x >= 0 ? x / y : (x + 1) / y - 1;}int ceil(int x, int y) { // (ld)x / y 以上の最小の整数assert(y != 0);if (y < 0) x = -x, y = -y;return x > 0 ? (x - 1) / y + 1 : x / y;}int round(int x, int y) { // (ld)x / y を小数第1位について四捨五入assert(y != 0);if (x*y < 0) return -((abs(x) * 2 + abs(y)) / (abs(y) * 2)); // https://www.acmicpc.net/problem/2108return (x * 2 + y) / (y * 2);}int round(int x, int y, int k) { // (ld)x / y を10^kの位に関して四捨五入assert(y != 0 && k >= 0);if (k == 0) return (x * 2 + y) / (y * 2);x /= y * POW(10, k - 1);if (x % 10 >= 5) return (x + 10 - x % 10) * POW(10, k - 1);return x * POW(10, k - 1);}int round2(int x, int y) { // 五捨五超入 // 未verifyassert(y != 0);if (y < 0) y = -y, x = -x;int z = x / y;if ((z * 2 + 1) * y <= y * 2) z++;return z;}int Floor(ld x) { // 未. 負数でも小さい方に丸めるif (x > -EPS) return (int)(floorl(x + EPS) + EPS);return -(int)((ceill(-x - EPS)) + EPS);}int Ceil(ld x) { // 未. 負数でも大きい方に丸めるif (x > EPS) return (int)(ceill(x - EPS) + EPS);return -(int)((floorl(-x + EPS)) + EPS);}int Round(ld x) { // 未. 負数でも.5の場合は大きい方に丸めるif (x > EPS) return (int)(Std::round(x + EPS) + EPS);return (int)(Std::round(x + EPS) - EPS);}// int get(ld x, int k) { // 未. xの10^kの位の桁// }ld floor(ld x, int k) { // xを10^kの位に関してflooringld d = pow(10, -k);return Floor(x * d) / d; // 未verify}ld ceil(ld x, int k) { // xを10^kの位に関してceilingld d = pow(10, -k);return Ceil(x * d) / d; // 未verify}ld round(ld x, int k) { // xを10^kの位に関して四捨五入.ld d = pow(10, -k);return Round(x * d) / d;}// int kth(int x, int y, int k) { // x / yの10^kの位の桁// }int floor(ld x, ld y) { // 誤差対策TODOassert(!equals(y, 0));return Std::floor(x / y);// floor(x) = ceil(x - 1) という話も}int ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしいassert(!equals(y, 0));return Std::ceil(x / y);// ceil(x) = floor(x + 1)}int perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q// 未verify. 誤差対策TODO. EPS外してもいいかも。assert(!equals(y, 0));if (x >= 0 && y > 0) return Std::floor(x / y)+EPS;if (x >= 0 && y < 0) return -Std::floor(x / fabs(y));if (x < 0 && y < 0) return Std::floor(x / y) + (x - Std::floor(x/y)*y < -EPS);return Std::floor(x / y) - (x - Std::floor(x/y)*y < -EPS); // (x < 0 && y > 0)}ld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r// 未verify. 誤差対策TODO. -0.0が返りうる。assert(!equals(y, 0));if (x >= 0) return x - fabs(y)*fabs(per(x, y));return x - fabs(y)*floor(x, fabs(y));}int seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODOint modf(ld x) {if (x < 0) return ceill(x);else return floorl(x);}// 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?int seisuu(int x, int y) {assert(y != 0);return x / y;}int seisuu(ld x, ld y) { // 誤差対策TODOassert(!equals(y, 0));return (int)(x / y);}int floor_log(int base, int x) { // log_base{x} のfloorassert(base >= 2);int ret = 0, now = 1;while (now <= x) {now *= base;if (now <= x) ret++;}return ret;}int ceil_log(int base, int x) { // log_base{x} のceilassert(base >= 2);int ret = 0, now = 1;while (now < x) {now *= base;ret++;}return ret;}template <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {if (a.first > b.first or a.first == b.first && a.second > b.second) return a;return b;}template <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {if (a.first < b.first or a.first == b.first && a.second < b.second) return a;return b;}template <class T> bool chmax(T &a, const T &b) {if (a < b) { a = b; return true; } return false;}template <class T> bool chmin(T &a, const T &b) {if (a > b) { a = b; return true; } return false;}template <class T> bool chmax(pair<T, T> &a, const pair<T, T> &b) {if (a.first < b.first or a.first == b.first && a.second < b.second) { a = b; return true; }return false;}template <class T> bool chmin(pair<T, T> &a, const pair<T, T> &b) {if (a.first > b.first or a.first == b.first && a.second > b.second) { a = b; return true; }return false;}template <class T> T mid(T a, T b, T c) { // 誤差対策TODOreturn a + b + c - Std::max({a, b, c}) - Std::min({a, b, c});}template <typename T, typename... Args>void Sort(T& a, T& b, T& c, Args&... args) {vector<T> vec = {a, b, c, args...};sort(vec.begin(), vec.end());auto it = vec.begin();a = *it++; b = *it++; c = *it++;int dummy[] = { (args = *it++, 0)... };static_cast<void>(dummy);}template <typename T, typename... Args>void Sortr(T& a, T& b, T& c, Args&... args) {vector<T> vec = {a, b, c, args...};sort(vec.rbegin(), vec.rend());auto it = vec.begin();a = *it++; b = *it++; c = *it++;int dummy[] = { (args = *it++, 0)... };static_cast<void>(dummy);}template <class T>void sort(vector<T> &A, vector<T> &B) {vector<pair<T, T>> P(A.size());for (int i = 0; i < A.size(); i++) P[i] = {A[i], B[i]};sort(P.begin(), P.end());for (int i = 0; i < A.size(); i++) A[i] = P[i].first, B[i] = P[i].second;}template <class T>void unique(vector<T> &A, vector<T> &B) {vector<T> A2, B2;A2.reserve(A.size()); B2.reserve(B.size());for (int i = 0; i < A.size(); i++) {if (i == 0 or A[i] != A[i - 1] or B[i] != B[i - 1]) {A2.push_back(A[i]);B2.push_back(B[i]);}}}istream &operator >>(istream &is, __int128_t& x) {string S; is >> S;__int128_t ret = 0;int f = 1;if (S[0] == '-') f = -1;for (int i = 0; i < S.length(); i++)if ('0' <= S[i] && S[i] <= '9')ret = ret * 10 + S[i] - '0';x = ret * f;return (is);}ostream &operator <<(ostream &os, __int128_t x) {ostream::sentry s(os);if (s) {__uint128_t tmp = x < 0 ? -x : x;char buffer[128]; char *d = end(buffer);do {--d; *d = "0123456789"[tmp % 10]; tmp /= 10;} while (tmp != 0);if (x < 0) { --d; *d = '-'; }int len = end(buffer) - d;if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);}return os;}__int128_t sto128(const string &S) {__int128_t ret = 0; int f = 1;if (S[0] == '-') f = -1;for (int i = 0; i < S.length(); i++)if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';return ret * f;}__int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }__int128_t lcm(__int128_t a, __int128_t b) {return a / gcd(a, b) * b;// lcmが__int128_tに収まる必要あり}string to_string(double x, int k) { // 小数第k+1を四捨五入して小数第k位までを出力// 切り捨てがほしい場合は to_string(x, k+1) として pop_back() すればよい?ostringstream os;os << fixed << setprecision(k) << x;return os.str();}string to_string(__int128_t x) {string ret = "";if (x < 0) { ret += "-"; x *= -1; }while (x) { ret += (char)('0' + x % 10); x /= 10; }reverse(ret.begin(), ret.end());return ret;}string to_string(char c) { string s = ""; s += c; return s; }} using namespace util_function;struct custom_hash {static uint64_t splitmix64(uint64_t x) {x += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}size_t operator()(uint64_t x) const {static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}};template<class T> size_t HashCombine(const size_t seed,const T &v) {return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));}template<class T,class S> struct hash<pair<T,S>>{size_t operator()(const pair<T,S> &keyval) const noexcept {return HashCombine(hash<T>()(keyval.first), keyval.second);}};template<class T> struct hash<vector<T>>{size_t operator()(const vector<T> &keyval) const noexcept {size_t s=0;for (auto&& v: keyval) s=HashCombine(s,v);return s;}};template<int N> struct HashTupleCore{template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{size_t s=HashTupleCore<N-1>()(keyval);return HashCombine(s,get<N-1>(keyval));}};template <> struct HashTupleCore<0>{template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }};template<class... Args> struct hash<tuple<Args...>>{size_t operator()(const tuple<Args...> &keyval) const noexcept {return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);}};template<typename T>class Compress {public:int sz = 0;vector<T> uniqV;Compress() {}template<typename... Vecs>Compress(const Vecs&... vecs) {(uniqV.insert(uniqV.end(), vecs.begin(), vecs.end()), ...);sort(uniqV.begin(), uniqV.end());uniqV.erase(unique(uniqV.begin(), uniqV.end()), uniqV.end());sz = uniqV.size();}vector<int> zip(const vector<T> &V) {vector<int> ret(V.size());for (int i = 0; i < V.size(); i++) {ret[i] = encode(V[i]);}return ret;}vector<T> unzip(const vector<int> &V) {vector<T> ret(V.size());for (int i = 0; i < V.size(); i++) {ret[i] = decode(V[i]);}return ret;}int size() { return sz; }int encode(T x) {auto it = lower_bound(uniqV.begin(), uniqV.end(), x);return it - uniqV.begin();}T decode(int x) {if (x < 0 or x >= uniqV.size()) return -1; // xが範囲外の場合return uniqV[x];}};class UnionFind {public:UnionFind() = default;UnionFind(int N) : par(N), sz(N, 1) {iota(par.begin(), par.end(), 0);}int root(int x) {if (par[x] == x) return x;return (par[x] = root(par[x]));}bool unite(int x, int y) {int rx = root(x);int ry = root(y);if (rx == ry) return false;if (sz[rx] < sz[ry]) swap(rx, ry);sz[rx] += sz[ry];par[ry] = rx;return true;}bool issame(int x, int y) { return (root(x) == root(y)); }int size(int x) { return sz[root(x)]; }vector<vector<int>> groups(int N) {vector<vector<int>> G(N);for (int x = 0; x < N; x++) {G[root(x)].push_back(x);}G.erase( remove_if(G.begin(), G.end(),[&](const vector<int>& V) { return V.empty(); }), G.end());return G;}private:vector<int> par, sz;};template<typename T> struct BIT {int N;vector<T> bit[2];BIT(int N_, int x = 0) : N(N_ + 1) {bit[0].assign(N, 0); bit[1].assign(N, 0);if (x != 0)for (int i = 0; i < N; i++) add(i, x);}BIT(const vector<T> &A) : N(A.size() + 1) {bit[0].assign(N, 0); bit[1].assign(N, 0);for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);}void add_sub(int p, int i, T x) {while (i < N) { bit[p][i] += x; i += (i & -i); }}void add(int l, int r, T x) {add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);add_sub(1, l + 1, x); add_sub(1, r + 1, -x);}void add(int i, T x) { add(i, i + 1, x); }T sum_sub(int p, int i) {T ret = T(0);while (i > 0) { ret += bit[p][i]; i -= (i & -i); }return ret;}T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }T sum(int l, int r) { return sum(r) - sum(l); }T get(int i) { return sum(i, i + 1); }void set(int i, T x) { T s = get(i); add(i, -s + x); }};template<int mod> class Modint {public:int val = 0;Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }Modint(const Modint &r) { val = r.val; }Modint operator -() { return Modint(-val); } // 単項Modint operator +(const Modint &r) { return Modint(*this) += r; }Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }Modint operator -(const Modint &r) { return Modint(*this) -= r; }Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }Modint operator *(const Modint &r) { return Modint(*this) *= r; }Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }Modint operator /(const Modint &r) { return Modint(*this) /= r; }Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置Modint operator ++(signed) { ++*this; return *this; } // 後置Modint& operator --() { val--; if (val < 0) val += mod; return *this; }Modint operator --(signed) { --*this; return *this; }Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }Modint &operator /=(const Modint &r) {int a = r.val, b = mod, u = 1, v = 0;while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}val = val * u % mod; if (val < 0) val += mod;return *this;}Modint &operator /=(const int &q) {Modint r(q); int a = r.val, b = mod, u = 1, v = 0;while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}val = val * u % mod; if (val < 0) val += mod;return *this;}bool operator ==(const Modint& r) { return this -> val == r.val; }bool operator !=(const Modint& r) { return this -> val != r.val; }bool operator <(const Modint& r) { return this -> val < r.val; }bool operator >(const Modint& r) { return this -> val > r.val; }friend istream &operator >>(istream &is, Modint& x) {int t; is >> t; x = t; return (is);}friend ostream &operator <<(ostream &os, const Modint& x) {return os << x.val;}};using mint = Modint<MOD>;mint modpow(const mint &x, int n) {if (n < 0) return (mint)1 / modpow(x, -n); // 未verifyassert(n >= 0);if (n == 0) return 1;mint t = modpow(x, n / 2);t = t * t;if (n & 1) t = t * x;return t;}int modpow(__int128_t x, int n, int mod) {if (n == 0 && mod == 1) return 0;assert(n >= 0 && mod > 0); // TODO: n <= -1__int128_t ret = 1;while (n > 0) {if (n % 2 == 1) ret = ret * x % mod;x = x * x % mod;n /= 2;}return ret;}// int modinv(__int128_t x, int mod) { //// assert(mod > 0);// // assert(x > 0);// if (x == 1 or x == 0) return 1;// return mod - modinv(mod % x, mod) * (mod / x) % mod;// }vector<mint> _fac, _finv, _inv;void COMinit(int N) {_fac.resize(N + 1); _finv.resize(N + 1); _inv.resize(N + 1);_fac[0] = _fac[1] = 1; _finv[0] = _finv[1] = 1; _inv[1] = 1;for (int i = 2; i <= N; i++) {_fac[i] = _fac[i-1] * mint(i);_inv[i] = -_inv[MOD % i] * mint(MOD / i);_finv[i] = _finv[i - 1] * _inv[i];}}mint FAC(int N) {if (N < 0) return 0; return _fac[N];}mint FACinv(int N) {if (N < 0) return 0; return _finv[N];}mint COM(int N, int K) {if (N < K) return 0; if (N < 0 or K < 0) return 0;return _fac[N] * _finv[K] * _finv[N - K];}mint COMinv(int N, int K) {if (N < K) return 0; if (N < 0 or K < 0) return 0;return _finv[N] * _fac[K] * _fac[N - K];}mint MCOM(const vector<int> &V) {int N = 0;for (int i = 0; i < V.size(); i++) N += V[i];mint ret = _fac[N];for (int i = 0; i < V.size(); i++) ret *= _finv[V[i]];return ret;}mint PERM(int N, int K) {if (N < K) return 0; if (N < 0 or K < 0) return 0;return _fac[N] * _finv[N - K];}mint NHK(int N, int K) { // initのサイズに注意if (N == 0 && K == 0) return 1;return COM(N + K - 1, K);}#pragma endregion// https://maspypy.github.io/library/ds/wavelet_matrix/wavelet_matrix.hpp// モノイドが乗る動的セグ木// set, add, mul// count(l, r, a, b)// prod(l, r, a, b)// count_and_prod(l, r, a, b)// kth(l, r, k), next(l, r, x), prev(l, r, x) : x以上の最小値/x以下の最大値// kth_value_and_prod(l, r, k) : [l, r) の [0, k] 番目に小さい要素の総積?// prod_index_range(l, r, a, b) : [l, r) の [a, b) 番目に小さい要素の総積?// max_rightconst int inf = INFL;template <typename E>struct Monoid_Add {using X = E;using value_type = X;static constexpr X op(const X &x, const X &y) noexcept { return x + y; }static constexpr X inverse(const X &x) noexcept { return -x; }static constexpr X power(const X &x, ll n) noexcept { return X(n) * x; }static constexpr X unit() { return X(0); }static constexpr bool commute = true;};template <typename T>struct Index_Compression_DISTINCT_SMALL {int mi, ma;vector<int> dat;vector<int> build(vector<int> X) {mi = 0, ma = -1;if (!X.empty()) {mi = *min_element(X.begin(), X.end());ma = *max_element(X.begin(), X.end());}dat.assign(ma - mi + 2, 0);for (auto &x : X) dat[x - mi + 1]++;for (int i = 0; i < dat.size(); i++) dat[i + 1] += dat[i];for (auto &x : X) x = dat[x - mi]++;for (int i = dat.size() - 1; i >= 1; i--) dat[i] = dat[i - 1];dat[0] = 0;return X;}int operator()(ll x) { return dat[clamp<ll>(x - mi, 0, ma - mi + 1)]; }};template <typename T>struct Index_Compression_SAME_SMALL {int mi, ma;vector<int> dat;vector<int> build(vector<int> X) {mi = 0, ma = -1;if (!X.empty()) {mi = *min_element(X.begin(), X.end());ma = *max_element(X.begin(), X.end());}dat.assign(ma - mi + 2, 0);for (auto &x : X) dat[x - mi + 1] = 1;for (int i = 0; i < dat.size(); i++) dat[i + 1] += dat[i];for (auto &x : X) x = dat[x - mi];return X;}int operator()(ll x) { return dat[clamp<ll>(x - mi, 0, ma - mi + 1)]; }};template <typename T>vector<int> argsort(const vector<T> &A) {vector<int> ids(A.size());iota(ids.begin(), ids.end(), 0);sort(ids.begin(), ids.end(),[&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });return ids;}template <typename T>struct Index_Compression_SAME_LARGE {vector<T> dat;vector<int> build(vector<T> X) {vector<int> I = argsort(X);vector<int> res(X.size());for (auto &i : I) {if (!dat.empty() && dat.back() == X[i]) {res[i] = dat.size() - 1;} else {res[i] = dat.size();dat.pb(X[i]);}}dat.shrink_to_fit();return res;}int operator()(T x) { return lower_bound(dat.begin(), dat.end(), x) - dat.begin(); }};template <typename T>struct Index_Compression_DISTINCT_LARGE {vector<T> dat;vector<int> build(vector<T> X) {vector<int> I = argsort(X);vector<int> res(X.size());for (auto& i : I) {res[i] = dat.size();dat.pb(X[i]);}dat.shrink_to_fit();return res;}int operator()(T x) { return lower_bound(dat.begin(), dat.end(), x) - dat.begin(); }};template <typename T, bool SMALL>using Index_Compression_DISTINCT =typename conditional<SMALL, Index_Compression_DISTINCT_SMALL<T>,Index_Compression_DISTINCT_LARGE<T>>::type;template <typename T, bool SMALL>using Index_Compression_SAME =typename conditional<SMALL, Index_Compression_SAME_SMALL<T>,Index_Compression_SAME_LARGE<T>>::type;// SAME : [2,3,2] -> [0,1,0]// DISTINCT : [2,2,3] -> [0,2,1]// (x) : lower_bound(X,x) をかえすtemplate <typename T, bool SAME, bool SMALL>using Index_Compression =typename conditional<SAME, Index_Compression_SAME<T, SMALL>,Index_Compression_DISTINCT<T, SMALL>>::type;struct Bit_Vector {int n;bool prepared = 0;vector<pair<uint64_t, uint32_t>> 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].first |= uint64_t(1) << (i & 63);}void reset() {fill(dat.begin(), dat.end(), pair<uint64_t, uint32_t>{0, 0});prepared = 0;}void build() {prepared = 1;for (int i = 0; i < dat.size() - 1; i++) dat[i + 1].second = dat[i].second + popcount(dat[i].first);}// [0, k) 内の 1 の個数bool operator[](int i) { return dat[i >> 6].first >> (i & 63) & 1; }int count_prefix(int k, bool f = true) {assert(prepared);auto [a, b] = dat[k >> 6];int ret = b + popcount(a & ((uint64_t(1) << (k & 63)) - 1));return (f ? ret : k - ret);}int count(int L, int R, bool f = true) { return count_prefix(R, f) - count_prefix(L, f); }string to_string() {string ans;for (int i = 0; i < n; i++) {ans += '0' + (dat[i / 64].first >> (i % 64) & 1);}return ans;}};template <typename, typename = void_t<>>struct has_inverse : false_type {};template <typename T>struct has_inverse<T, void_t<decltype(T::inverse(declval<typename T::value_type>()))>> : true_type {};struct Dummy_Data_Structure {using MX = Monoid_Add<bool>;void build(const vector<bool> &A) {}};template <typename Y, bool SMALL_Y, typename SEGTREE = Dummy_Data_Structure>struct Wavelet_Matrix {using Mono = typename SEGTREE::MX;using T = typename Mono::value_type;static_assert(Mono::commute);int n, log, K;Index_Compression<Y, true, SMALL_Y> IDX;vector<Y> ItoY;vector<int> mid;vector<Bit_Vector> bv;vector<SEGTREE> seg;Wavelet_Matrix() {}Wavelet_Matrix(const vector<Y> &A) { build(A); }Wavelet_Matrix(const vector<Y> &A, vector<T> &SUM_Data) { build(A, SUM_Data); }template <typename F>Wavelet_Matrix(int n, F f) {build(n, f);}template <typename F>void build(int m, F f) {vector<Y> A(m);vector<T> S(m);for (int i = 0; i < m; i++) tie(A[i], S[i]) = f(i);build(A, S);}void build(const vector<Y> &A) { build(A, vector<T>(A.size(), Mono::unit())); }void build(const vector<Y> &A, vector<T> S) {n = A.size();vector<int> B = IDX.build(A);K = 0;for (auto &x: B) chmax(K, x + 1);ItoY.resize(K);for (int i = 0; i < n; i++) ItoY[B[i]] = A[i];log = 0;while ((1 << log) < K) log++;mid.resize(log), bv.assign(log, Bit_Vector(n));vector<int> B0(n), B1(n);vector<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++) {bool f = (B[i] >> d & 1);if (!f) { B0[p0] = B[i], S0[p0] = S[i], p0++; }if (f) { bv[d].set(i), B1[p1] = B[i], S1[p1] = S[i], p1++; }}swap(B, B0), swap(S, S0);move(B1.begin(), B1.begin() + p1, B.begin() + p0);move(S1.begin(), S1.begin() + p1, S.begin() + p0);mid[d] = p0, bv[d].build(), seg[d].build(S);}}// [L, R) x [0, y)int prefix_count(int L, int R, Y y) {int p = IDX(y);if (L == R or p == 0) return 0;if (p == K) return R - L;int cnt = 0;for (int d = log - 1; d >= 0; d--) {int l0 = bv[d].count_prefix(L, 0), r0 = bv[d].count_prefix(R, 0);int l1 = L + mid[d] - l0, r1 = R + mid[d] - r0;if (p >> d & 1) cnt += r0 - l0, L = l1, R = r1;if (!(p >> d & 1)) L = l0, R = r0;}return cnt;}// [L, R) x [y1, y2)int count(int L, int R, Y y1, Y y2) { return prefix_count(L, R, y2) - prefix_count(L, R, y1); }// [L, R) x [0, y)pair<int, T> prefix_count_and_prod(int L, int R, Y y) {int p = IDX(y);if (p == 0) return {0, Mono::unit()};if (p == K) return {R - L, seg[log].prod(L, R)};int cnt = 0;T t = Mono::unit();for (int d = log - 1; d >= 0; d--) {int l0 = bv[d].count_prefix(L, 0), r0 = bv[d].count_prefix(R, 0);int l1 = L + mid[d] - l0, r1 = R + mid[d] - r0;if (p >> d & 1) { cnt += r0 - l0, t = Mono::op(t, seg[d].prod(l0, r0)), L = l1, R = r1; }if (!(p >> d & 1)) L = l0, R = r0;}return {cnt, t};}// [L, R) x [y1, y2)pair<int, T> count_and_prod(int L, int R, Y y1, Y y2) {if constexpr (has_inverse<Mono>::value) {auto [c1, t1] = prefix_count_and_prod(L, R, y1);auto [c2, t2] = prefix_count_and_prod(L, R, y2);return {c2 - c1, Mono::op(Mono::inverse(t1), t2)};}int lo = IDX(y1), hi = IDX(y2), cnt = 0;T t = Mono::unit();auto dfs = [&](auto &dfs, int d, int L, int R, int a, int b) -> void {assert(b - a == (1 << d));if (hi <= a or b <= lo) return;if (lo <= a && b <= hi) {cnt += R - L, t = Mono::op(t, seg[d].prod(L, R));return;}d--;int c = (a + b) / 2;int l0 = bv[d].count_prefix(L, 0), r0 = bv[d].count_prefix(R, 0);int l1 = L + mid[d] - l0, r1 = R + mid[d] - r0;dfs(dfs, d, l0, r0, a, c), dfs(dfs, d, l1, r1, c, b);};dfs(dfs, log, L, R, 0, 1 << log);return {cnt, t};}// [L, R) x [y1, y2)T prefix_prod(int L, int R, Y y) { return prefix_count_and_prod(L, R, y).second; }// [L, R) x [y1, y2)T prod(int L, int R, Y y1, Y y2) { return count_and_prod(L, R, y1, y2).second; }T prod_all(int L, int R) { return seg[log].prod(L, R); }Y kth(int L, int R, int k) {assert(0 <= k && k < R - L);int p = 0;for (int d = log - 1; d >= 0; d--) {int l0 = bv[d].count_prefix(L, 0), r0 = bv[d].count_prefix(R, 0);int l1 = L + mid[d] - l0, r1 = R + mid[d] - r0;if (k < r0 - l0) {L = l0, R = r0;} else {k -= r0 - l0, L = l1, R = r1, p |= 1 << d;}}return ItoY[p];}// y 以上最小 OR infY next(int L, int R, Y y) {int k = IDX(y);int p = K;auto dfs = [&](auto &dfs, int d, int L, int R, int a, int b) -> void {if (p <= a or L == R or b <= k) return;if (d == 0) {chmin(p, a);return;}d--;int c = (a + b) / 2;int l0 = bv[d].count_prefix(L, 0), r0 = bv[d].count_prefix(R, 0);int l1 = L + mid[d] - l0, r1 = R + mid[d] - r0;dfs(dfs, d, l0, r0, a, c), dfs(dfs, d, l1, r1, c, b);};dfs(dfs, log, L, R, 0, 1 << log);return (p == K ? inf : ItoY[p]);}// y 以下最大 OR -infY prev(int L, int R, Y y) {int k = IDX(y + 1);int p = -1;auto dfs = [&](auto &dfs, int d, int L, int R, int a, int b) -> void {if (b - 1 <= p or L == R or k <= a) return;if (d == 0) {chmax(p, a);return;}d--;int c = (a + b) / 2;int l0 = bv[d].count_prefix(L, 0), r0 = bv[d].count_prefix(R, 0);int l1 = L + mid[d] - l0, r1 = R + mid[d] - r0;dfs(dfs, d, l1, r1, c, b), dfs(dfs, d, l0, r0, a, c);};dfs(dfs, log, L, R, 0, 1 << log);return (p == -1 ? -inf : ItoY[p]);}Y median(bool UPPER, int L, int R) {assert(0 <= L && L < R && R <= n);int k = (UPPER ? (R - L) / 2 : (R - L - 1) / 2);return kth(L, R, k);}pair<Y, T> kth_value_and_prod(int L, int R, int k) {assert(0 <= k && k <= R - L);if (k == R - L) return { inf, seg[log].prod(L, R) };int p = 0;T t = Mono::unit();for (int d = log - 1; d >= 0; d--) {int l0 = bv[d].count_prefix(L, 0), r0 = bv[d].count_prefix(R, 0);int l1 = L + mid[d] - l0, r1 = R + mid[d] - r0;if (k < r0 - l0) {L = l0, R = r0;} else {t = Mono::op(t, seg[d].prod(l0, r0)), k -= r0 - l0, L = l1, R = r1, p |= 1 << d;}}t = Mono::op(t, seg[0].prod(L, L + k));return {ItoY[p], t};}T prod_index_range(int L, int R, int k1, int k2) {static_assert(has_inverse<Mono>::value);T t1 = kth_value_and_prod(L, R, k1).second;T t2 = kth_value_and_prod(L, R, k2).second;return Mono::op(Mono::inverse(t1), t2);}// [L, R) x [0, y) での check(cnt, prod) が true となる最大の (cnt, prod)template <typename F>pair<int, T> max_right(F check, int L, int R) {int cnt = 0;T t = Mono::unit();assert(check(0, Mono::unit()));if (check(R - L, seg[log].prod(L, R))) { return {R - L, seg[log].prod(L, R)}; }for (int d = log - 1; d >= 0; d--) {int l0 = bv[d].count_prefix(L, 0), r0 = bv[d].count_prefix(R, 0);int l1 = L + mid[d] - l0, r1 = R + mid[d] - r0;int cnt1 = cnt + r0 - l0;T t1 = Mono::op(t, seg[d].prod(l0, r0));if (check(cnt1, t1)) {cnt = cnt1, t = t1, L = l1, R = r1;} else {L = l0, R = r0;}}return {cnt, t};}void set(int i, T t) {assert(0 <= i && i < n);int L = i, R = i + 1;seg[log].set(L, t);for (int d = log - 1; d >= 0; d--) {int l0 = bv[d].count_prefix(L, 0), r0 = bv[d].count_prefix(R, 0);int l1 = L + mid[d] - l0, r1 = R + mid[d] - r0;if (l0 < r0) L = l0, R = r0;if (l0 == r0) L = l1, R = r1;seg[d].set(L, t);}}void multiply(int i, T t) {assert(0 <= i && i < n);int L = i, R = i + 1;seg[log].multiply(L, t);for (int d = log - 1; d >= 0; d--) {int l0 = bv[d].count_prefix(L, 0), r0 = bv[d].count_prefix(R, 0);int l1 = L + mid[d] - l0, r1 = R + mid[d] - r0;if (l0 < r0) L = l0, R = r0;if (l0 == r0) L = l1, R = r1;seg[d].multiply(L, t);}}void add(int i, T t) { multiply(i, t); }};signed main() {int N;cin >> N;vector<int> A(N);for (int i = 0; i < N; i++) cin >> A[i];Wavelet_Matrix<ll, false> WM(A);int Q;cin >> Q;for (int q = 0; q < Q; q++) {int l, r, x;cin >> l >> r >> x;l--; r--;int a = WM.prev(l, r + 1, x);int b = WM.next(l, r + 1, x);if (a == -1) a = INFL;if (b == -1) b = INFL;cout << min(abs(a - x), abs(b - x)) << endl;}}