結果

問題 No.1332 Range Nearest Query
ユーザー minatominato
提出日時 2021-01-09 03:52:17
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,330 ms / 2,500 ms
コード長 4,498 bytes
コンパイル時間 3,236 ms
コンパイル使用メモリ 206,044 KB
最終ジャッジ日時 2025-01-17 15:04:37
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 48
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
template<class T> using vec = vector<T>;
template<class T> using vvec = vector<vector<T>>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
istream& operator>>(istream& is, __int128_t& x) {
    x = 0;
    string s;
    is >> s;
    int n = int(s.size()), it = 0;
    if (s[0] == '-') it++;
    for (; it < n; it++) x = (x * 10 + s[it] - '0');
    if (s[0] == '-') x = -x;
    return is;
}
ostream& operator<<(ostream& os, __int128_t x) {
    if (x == 0) return os << 0;
    if (x < 0) os << '-', x = -x;
    deque<int> deq;
    while (x) deq.emplace_front(x % 10), x /= 10;
    for (int e : deq) os << e;
    return os;
}
template<class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
    return os << "(" << p.first << ", " << p.second << ")";
}
template<class T> 
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    for (int i = 0; i < int(v.size()); i++) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "}";
}
template<class Container> inline int SZ(Container& v) { return int(v.size()); }
template<class T> inline void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }
template<class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) {a = b; return true ;} return false ;}
template<class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) {a = b; return true ;} return false ;}
inline int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); }
inline int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); }
inline int popcount(ull x) { return __builtin_popcountll(x); }
inline int kthbit(ull x, int k) { return (x>>k) & 1; }
inline constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x-1) * 10; }
inline void print() { cout << "\n"; }
template<class T>
inline void print(const vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        if (i) cout << " ";
        cout << v[i];
    }
    print();
}
template<class T, class... Args>
inline void print(const T& x, const Args& ... args) {
    cout << x << " ";
    print(args...);
}
#ifdef MINATO_LOCAL
inline void debug_out() { cerr << endl; }
template <class T, class... Args>
inline void debug_out(const T& x, const Args& ... args) {
    cerr << " " << x;
    debug_out(args...);
}
#define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

int main() {
    int N; cin >> N;
    vec<ll> X(N);
    rep(i,N) cin >> X[i];

    vvec<ll> node;
    {
        int sz = 1;
        while (sz < N) sz <<= 1;
        while (N < sz) {
            X.emplace_back(1e18);
            N++;
        }
        node.resize(N*2);
    }

    {
        auto rec=[&](auto self, int l, int r, int k)->void {
            if (r-l==1) {
                node[k].emplace_back(X[l]);
                return;
            }
            int m = (l+r)/2;
            self(self,l,m,k<<1|0);
            self(self,m,r,k<<1|1);
            merge(all(node[k<<1|0]),all(node[k<<1|1]),back_inserter(node[k]));
        };
        rec(rec,0,N,1);
    }

    auto get=[&](auto self, int a, int b, ll x, int k, int l, int r)->ll {
        if (a >= b) return (ll)1e18;
        if (r <= a || b <= l) return (ll)1e18;

        if (a <= l && r <= b) {
            int pos = lower_bound(all(node[k]),x) - node[k].begin();
            ll ret = 1e18;
            if (pos > 0) chmin(ret,abs(node[k][pos-1]-x));
            if (pos < SZ(node[k])) chmin(ret,abs(node[k][pos]-x));
            return ret;
        }

        ll vl = self(self, a, b, x, k<<1|0, l, (l+r)/2);
        ll vr = self(self, a, b, x, k<<1|1, (l+r)/2, r);
        return min(vl, vr);
    };

    int Q; cin >> Q;
    rep(_,Q) {
        int l,r,x; cin >> l >> r >> x;
        l--;
        cout << get(get,l,r,x,1,0,N) << ln;
    }
}
0