結果
問題 | No.1332 Range Nearest Query |
ユーザー |
![]() |
提出日時 | 2022-05-01 16:02:38 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 332 ms / 2,500 ms |
コード長 | 18,119 bytes |
コンパイル時間 | 4,089 ms |
コンパイル使用メモリ | 333,764 KB |
最終ジャッジ日時 | 2025-01-29 01:18:23 |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 48 |
ソースコード
#line 1 "/home/maspy/compro/library/my_template.hpp"#include <bits/stdc++.h>using namespace std;using ll = long long;using pi = pair<ll, ll>;using vi = vector<ll>;using u32 = unsigned int;using u64 = unsigned long long;using i128 = __int128;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 vvvvvc = vector<vvvvc<T>>;template <class T>using pq = priority_queue<T>;template <class T>using pqg = priority_queue<T, vector<T>, greater<T>>;#define vec(type, name, ...) vector<type> name(__VA_ARGS__)#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__))))#define FOR_(n) for (ll _ = 0; (_) < (ll)(n); ++(_))#define FOR(i, n) for (ll i = 0; (i) < (ll)(n); ++(i))#define FOR3(i, m, n) for (ll i = (m); (i) < (ll)(n); ++(i))#define FOR_R(i, n) for (ll i = (ll)(n)-1; (i) >= 0; --(i))#define FOR3_R(i, m, n) for (ll i = (ll)(n)-1; (i) >= (ll)(m); --(i))#define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s))#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 stolltemplate <typename T>T SUM(vector<T> &A) {T sum = T(0);for (auto &&a: A) sum += a;return sum;}#define MIN(v) *min_element(all(v))#define MAX(v) *max_element(all(v))#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())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); }// (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, typename U>T ceil(T x, U y) {return (x > 0 ? (x + y - 1) / y : x / y);}template <typename T, typename U>T floor(T x, U y) {return (x > 0 ? x / y : (x - y + 1) / y);}template <typename T, typename U>pair<T, T> divmod(T x, U y) {T q = floor(x, y);return {q, x - q * y};}ll binary_search(function<bool(ll)> check, ll ok, ll ng) {assert(check(ok));while (abs(ok - ng) > 1) {auto x = (ng + ok) / 2;if (check(x))ok = x;elseng = x;}return ok;}template <class T, class S>inline bool chmax(T &a, const S &b) {return (a < b ? a = b, 1 : 0);}template <class T, class S>inline bool chmin(T &a, const S &b) {return (a > b ? a = b, 1 : 0);}vi s_to_vi(const string& S, char first_char) {vi A(S.size());FOR(i, S.size()) { A[i] = S[i] - first_char; }return A;}template <typename T>vector<T> cumsum(vector<T> &A, int off = 1) {int N = A.size();vector<T> B(N + 1);FOR(i, N) { B[i + 1] = B[i] + A[i]; }if (off == 0) B.erase(B.begin());return B;}template <typename CNT, typename T>vc<CNT> bincount(const vc<T> &A, int size) {vc<CNT> C(size);for (auto &&x: A) { ++C[x]; }return C;}template <typename T>vector<int> argsort(const vector<T> &A) {// stablevector<int> ids(A.size());iota(all(ids), 0);sort(all(ids),[&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); });return ids;}// A[I[0]], A[I[1]], ...template <typename T>vc<T> rearrange(const vc<T> &A, const vc<int> &I) {int n = len(A);assert(len(I) == n);vc<T> B(n);FOR(i, n) B[i] = A[I[i]];return B;}#line 1 "/home/maspy/compro/library/other/io.hpp"// based on yosupo's fastio#include <unistd.h>namespace detail {template <typename T, decltype(&T::is_modint) = &T::is_modint>std::true_type check_value(int);template <typename T>std::false_type check_value(long);} // namespace detailtemplate <typename T>struct is_modint : decltype(detail::check_value<T>(0)) {};template <typename T>using is_modint_t = enable_if_t<is_modint<T>::value>;template <typename T>using is_not_modint_t = enable_if_t<!is_modint<T>::value>;struct Scanner {FILE *fp;char line[(1 << 15) + 1];size_t st = 0, ed = 0;void reread() {memmove(line, line + st, ed - st);ed -= st;st = 0;ed += fread(line + ed, 1, (1 << 15) - ed, fp);line[ed] = '\0';}bool succ() {while (true) {if (st == ed) {reread();if (st == ed) return false;}while (st != ed && isspace(line[st])) st++;if (st != ed) break;}if (ed - st <= 50) {bool sep = false;for (size_t i = st; i < ed; i++) {if (isspace(line[i])) {sep = true;break;}}if (!sep) reread();}return true;}template <class T, enable_if_t<is_same<T, string>::value, int> = 0>bool read_single(T &ref) {if (!succ()) return false;while (true) {size_t sz = 0;while (st + sz < ed && !isspace(line[st + sz])) sz++;ref.append(line + st, sz);st += sz;if (!sz || st != ed) break;reread();}return true;}template <class T, enable_if_t<is_integral<T>::value, int> = 0>bool read_single(T &ref) {if (!succ()) return false;bool neg = false;if (line[st] == '-') {neg = true;st++;}ref = T(0);while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }if (neg) ref = -ref;return true;}template <class T, is_modint_t<T> * = nullptr>bool read_single(T &ref) {long long val = 0;bool f = read_single(val);ref = T(val);return f;}bool read_single(double &ref) {string s;if (!read_single(s)) return false;ref = std::stod(s);return true;}bool read_single(char &ref) {string s;if (!read_single(s) || s.size() != 1) return false;ref = s[0];return true;}template <class T>bool read_single(vector<T> &ref) {for (auto &d: ref) {if (!read_single(d)) return false;}return true;}template <class T, class U>bool read_single(pair<T, U> &p) {return (read_single(p.first) && read_single(p.second));}template <class A, class B, class C>bool read_single(tuple<A, B, C> &p) {return (read_single(get<0>(p)) && read_single(get<1>(p))&& read_single(get<2>(p)));}template <class A, class B, class C, class D>bool read_single(tuple<A, B, C, D> &p) {return (read_single(get<0>(p)) && read_single(get<1>(p))&& read_single(get<2>(p)) && read_single(get<3>(p)));}void read() {}template <class H, class... T>void read(H &h, T &... t) {bool f = read_single(h);assert(f);read(t...);}Scanner(FILE *fp) : fp(fp) {}};struct Printer {Printer(FILE *_fp) : fp(_fp) {}~Printer() { flush(); }static constexpr size_t SIZE = 1 << 15;FILE *fp;char line[SIZE], small[50];size_t pos = 0;void flush() {fwrite(line, 1, pos, fp);pos = 0;}void write(const char &val) {if (pos == SIZE) flush();line[pos++] = val;}template <class T, enable_if_t<is_integral<T>::value, int> = 0>void write(T val) {if (pos > (1 << 15) - 50) flush();if (val == 0) {write('0');return;}if (val < 0) {write('-');val = -val; // todo min}size_t len = 0;while (val) {small[len++] = char(0x30 | (val % 10));val /= 10;}for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }pos += len;}void write(const string &s) {for (char c: s) write(c);}void write(const char *s) {size_t len = strlen(s);for (size_t i = 0; i < len; i++) write(s[i]);}void write(const double &x) {ostringstream oss;oss << setprecision(15) << x;string s = oss.str();write(s);}void write(const long double &x) {ostringstream oss;oss << setprecision(15) << x;string s = oss.str();write(s);}template <class T, is_modint_t<T> * = nullptr>void write(T &ref) {write(ref.val);}template <class T>void write(const vector<T> &val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) write(' ');write(val[i]);}}template <class T, class U>void write(const pair<T, U> &val) {write(val.first);write(' ');write(val.second);}template <class A, class B, class C>void write(const tuple<A, B, C> &val) {auto &[a, b, c] = val;write(a), write(' '), write(b), write(' '), write(c);}template <class A, class B, class C, class D>void write(const tuple<A, B, C, D> &val) {auto &[a, b, c, d] = val;write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d);}template <class A, class B, class C, class D, class E>void write(const tuple<A, B, C, D, E> &val) {auto &[a, b, c, d, e] = val;write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e);}template <class A, class B, class C, class D, class E, class F>void write(const tuple<A, B, C, D, E, F> &val) {auto &[a, b, c, d, e, f] = val;write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e), write(' '), write(f);}template <class T, size_t S>void write(const array<T, S> &val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) write(' ');write(val[i]);}}void write(i128 val) {string s;bool negative = 0;if(val < 0){negative = 1;val = -val;}while (val) {s += '0' + int(val % 10);val /= 10;}if(negative) s += "-";reverse(all(s));if (len(s) == 0) s = "0";write(s);}};Scanner scanner = Scanner(stdin);Printer printer = Printer(stdout);void flush() { printer.flush(); }void print() { printer.write('\n'); }template <class Head, class... Tail>void print(Head &&head, Tail &&... tail) {printer.write(head);if (sizeof...(Tail)) printer.write(' ');print(forward<Tail>(tail)...);}void read() {}template <class Head, class... Tail>void read(Head &head, Tail &... tail) {scanner.read(head);read(tail...);}#define INT(...) \int __VA_ARGS__; \read(__VA_ARGS__)#define LL(...) \ll __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); }#line 2 "/home/maspy/compro/library/alg/group_add.hpp"template <class X>struct Group_Add {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 n * x; }static constexpr X unit() { return X(0); }static constexpr bool commute = true;};#line 3 "/home/maspy/compro/library/ds/fenwick.hpp"template <typename AbelGroup>struct FenwickTree {using E = typename AbelGroup::value_type;int n;vector<E> dat;E total;FenwickTree() : FenwickTree(0) {}FenwickTree(int n) : n(n), total(AbelGroup::unit()) {assert(AbelGroup::commute);dat.assign(n, AbelGroup::unit());}FenwickTree(vc<E> v) : n(len(v)), total(AbelGroup::unit()) {assert(AbelGroup::commute);FOR(i, n) total = AbelGroup::op(total, v[i]);dat = v;FOR3(i, 1, n + 1) {int j = i + (i & -i);if (j <= n) dat[j - 1] = AbelGroup::op(dat[i - 1], dat[j - 1]);}}void reset(){total = AbelGroup::unit();dat.assign(n, AbelGroup::unit());}E sum(int k) {E ret = AbelGroup::unit();for (; k > 0; k -= k & -k) ret = AbelGroup::op(ret, dat[k - 1]);return ret;}E sum(int L, int R) {E pos = AbelGroup::unit();while (L < R) {pos = AbelGroup::op(pos, dat[R - 1]);R -= R & -R;}E neg = AbelGroup::unit();while (R < L) {neg = AbelGroup::op(neg, dat[L - 1]);L -= L & -L;}return AbelGroup::op(pos, AbelGroup::inverse(neg));}E sum_all() { return total; }void add(int k, E x) {total = AbelGroup::op(total, x);for (++k; k <= n; k += k & -k) dat[k - 1] = AbelGroup::op(dat[k - 1], x);}template <class F>int max_right(F& check) {assert(check(E(0)));ll i = 0;E s = AbelGroup::unit();int k = 1;int N = len(dat) + 1;while (2 * k < N) k *= 2;while (k) {if (i + k < N && check(AbelGroup::op(s, dat[i + k - 1]))) {i += k;s = AbelGroup::op(s, dat[i - 1]);}k >>= 1;}return i;}int find_kth(E k) {auto check = [&](E x) -> bool { return x <= k; };return max_right(check);}void debug() { print("fenwick", dat); }};#line 1 "/home/maspy/compro/library/ds/waveletmatrix.hpp"#include <immintrin.h>struct bit_vector {using u32 = uint32_t;using i64 = int64_t;using u64 = uint64_t;static constexpr u32 w = 64;vector<u64> block;vector<u32> count;u32 n, zeros;inline u32 get(u32 i) const { return u32(block[i / w] >> (i % w)) & 1u; }inline void set(u32 i) { block[i / w] |= 1LL << (i % w); }bit_vector() {}bit_vector(int _n) { init(_n); }__attribute__((optimize("O3", "unroll-loops"))) void init(int _n) {n = zeros = _n;block.resize(n / w + 1, 0);count.resize(block.size(), 0);}__attribute__((target("popcnt"))) void build() {for (u32 i = 1; i < block.size(); ++i)count[i] = count[i - 1] + _mm_popcnt_u64(block[i - 1]);zeros = rank0(n);}inline u32 rank0(u32 i) const { return i - rank1(i); }__attribute__((target("bmi2,popcnt"))) inline u32 rank1(u32 i) const {return count[i / w] + _mm_popcnt_u64(_bzhi_u64(block[i / w], i % w));}};/*コンストラクタ:vector<T> を渡す静的な列に対して次が O(log N) 時間で行える・freq(l, r, lower, upper):[lower, upper) 内の要素の数え上げ・kth(l, r, lower, upper):[lower, upper) 内をソートしたときの k 番目*/template <typename T>struct WaveletMatrix {using u32 = uint32_t;using i64 = int64_t;using u64 = uint64_t;int n, lg;vc<T> key;vc<int> A;vector<bit_vector> bv;__attribute__((optimize("O3"))) WaveletMatrix(const vc<T>& dat): n(len(dat)) {key = dat;UNIQUE(key);A.resize(n);FOR(i, n) A[i] = LB(key, dat[i]);lg = __lg(max(MAX(A), 1)) + 1;bv.assign(lg, n);vc<int> cur = A, nxt(n);for (int h = lg - 1; h >= 0; --h) {for (int i = 0; i < n; ++i)if ((cur[i] >> h) & 1) bv[h].set(i);bv[h].build();array<decltype(begin(nxt)), 2> it{begin(nxt), begin(nxt) + bv[h].zeros};for (int i = 0; i < n; ++i) *it[bv[h].get(i)]++ = cur[i];swap(cur, nxt);}}inline pair<u32, u32> succ0(int l, int r, int h) const {return make_pair(bv[h].rank0(l), bv[h].rank0(r));}inline pair<u32, u32> succ1(int l, int r, int h) const {u32 l0 = bv[h].rank0(l);u32 r0 = bv[h].rank0(r);u32 zeros = bv[h].zeros;return make_pair(l + zeros - l0, r + zeros - r0);}T kth(u32 l, u32 r, u32 k) const {int res = 0;for (int h = lg - 1; h >= 0; --h) {u32 l0 = bv[h].rank0(l), r0 = bv[h].rank0(r);if (k < r0 - l0)l = l0, r = r0;else {k -= r0 - l0;res |= 1 << h;l += bv[h].zeros - l0;r += bv[h].zeros - r0;}}return key[res];}int freq(int l, int r, T lower, T upper) {return freq_upper(l, r, upper) - freq_upper(l, r, lower);}private:int freq_upper(int l, int r, T upper_t) {int upper = LB(key, upper_t);if (upper >= (1 << lg)) return r - l;int ret = 0;for (int h = lg - 1; h >= 0; --h) {bool f = (upper >> h) & 1;u32 l0 = bv[h].rank0(l), r0 = bv[h].rank0(r);if (f) {ret += r0 - l0;l += bv[h].zeros - l0;r += bv[h].zeros - r0;} else {l = l0;r = r0;}}return ret;}};#line 5 "main.cpp"void solve() {LL(N);VEC(ll, X, N);WaveletMatrix<ll> WM(X);const ll INF = 1LL << 60;LL(Q);FOR_(Q) {LL(l, r, x);--l;ll ANS = INF;ll n = WM.freq(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() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << setprecision(15);ll T = 1;// LL(T);FOR(_, T) solve();return 0;}