結果

問題 No.1332 Range Nearest Query
ユーザー satashun
提出日時 2021-01-08 21:47:43
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 550 ms / 2,500 ms
コード長 3,174 bytes
コンパイル時間 2,167 ms
コンパイル使用メモリ 200,824 KB
最終ジャッジ日時 2025-01-17 11:38:21
ジャッジサーバーID
（参考情報） 		judge2 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 48
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T, class U>
void chmin(T& t, const U& u) {
    if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
    if (t < u) t = u;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << "," << p.second << ")";
    return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    rep(i, v.size()) {
        if (i) os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#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
const int INF = TEN(9) + 10;
const int sz = 1 << 20;
struct segtree {
    using Val = int;
    vector<vector<Val>> dat;
    segtree() {}
    void init(vector<Val> num) {
        dat.resize(sz * 2);
        rep(i, sz * 2) { dat[i].clear(); }
        rep(i, num.size()) { dat[sz - 1 + i].pb(num[i]); }
        for (int i = sz - 2; i >= 0; --i) {
            int lc = i * 2 + 1, rc = i * 2 + 2;
            dat[i].resize(dat[lc].size() + dat[rc].size());
            merge(dat[lc].begin(), dat[lc].end(), dat[rc].begin(),
                  dat[rc].end(), dat[i].begin());
        }
    }
    Val ask(int a, int b, int u, int k = 0, int l = 0, int r = sz) {
        if (b <= l || r <= a) return INF;
        if (a <= l && r <= b) {
            if (dat[k].size() == 0) return INF;
            int res = INF;
            if (u <= dat[k][0])
                res = dat[k][0] - u;
            else if (u >= dat[k].back())
                res = u - dat[k].back();
            else {
                auto it = lower_bound(ALL(dat[k]), u);
                res = min(abs((*it) - u), abs(*(prev(it)) - u));
            }
            return res;
        }
        return min(ask(a, b, u, k * 2 + 1, l, (l + r) / 2),
                   ask(a, b, u, k * 2 + 2, (l + r) / 2, r));
    }
} seg;
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    V<int> X(N);
    rep(i, N) cin >> X[i];
    segtree seg;
    seg.init(X);
    int Q;
    cin >> Q;
    while (Q--) {
        int l, r, y;
        cin >> l >> r >> y;
        --l;
        int ans = INF;
        cout << seg.ask(l, r, y) << '\n';
    }
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0