結果

問題 No.1332 Range Nearest Query
コンテスト
ユーザー AngrySadEight
提出日時 2025-09-17 09:30:14
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,995 ms / 2,500 ms
コード長 7,075 bytes
コンパイル時間 3,645 ms
コンパイル使用メモリ 201,460 KB
実行使用メモリ 46,256 KB
最終ジャッジ日時 2025-09-17 09:31:24
合計ジャッジ時間 59,972 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 48
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll N;
    cin >> N;
    vector<ll> X(N);
    for (ll i = 0; i < N; i++){
        cin >> X[i];
    }
    ll Q;
    cin >> Q;
    vector<ll> l(Q);
    vector<ll> r(Q);
    vector<ll> x(Q);
    for (ll i = 0; i < Q; i++){
        cin >> l[i] >> r[i] >> x[i];
        l[i]--;
        r[i]--;
    }
    ll div = 600;
    vector<vector<pll>> qs(502, vector<pll>(0));
    for (ll i = 0; i < Q; i++){
        qs[l[i] / div].push_back(make_pair(r[i], i));
    }
    for (ll i = 0; i <= 500; i++){
        sort(all(qs[i]));
    }

    // まずは座標圧縮
    map<ll, ll> mp;
    for (ll i = 0; i < N; i++){
        mp[X[i]]++;
    }
    for (ll i = 0; i < Q; i++){
        mp[x[i]]++;
    }
    ll now = 0;
    vector<ll> targs(0);
    for (auto it = mp.begin(); it != mp.end(); it++){
        it->second = now;
        targs.push_back(it->first);
        now++;
    }

    vector<ll> ans(Q);
    
    vector<ll> small(now + div, 0);
    vector<ll> large(now / div + 1, 0);

    vector<ll> mX(N);
    vector<ll> mx(Q);
    for (ll i = 0; i < N; i++){
        mX[i] = mp[X[i]];
    }
    for (ll i = 0; i < Q; i++){
        mx[i] = mp[x[i]];
    }

    ll now_l = 0;
    ll now_r = -1;
    
    for (ll i = 0; i <= 500; i++){
        for (ll j = 0; j < qs[i].size(); j++){
            ll nid = qs[i][j].second;
            ll nl = l[nid];
            ll nr = r[nid];
            ll nx = x[nid];

            // 左を広げる
            for (ll k = now_l - 1; k >= nl; k--){
                small[mX[k]]++;
                large[mX[k] / div]++;
            }

            // 右を広げる
            for (ll k = now_r + 1; k <= nr; k++){
                small[mX[k]]++;
                large[mX[k] / div]++;
            }

            // 左をせばめる
            for (ll k = now_l; k <= nl - 1; k++){
                small[mX[k]]--;
                large[mX[k] / div]--;
            }

            // 右をせばめる
            for (ll k = now_r; k >= nr + 1; k--){
                small[mX[k]]--;
                large[mX[k] / div]--;
            }

            // 答えを求める
            ll left_ans = -1;
            ll right_ans = now;
            ll small_id = mx[nid];
            ll large_id = mx[nid] / div;
            ll rem = mx[nid] % div;
            // debug(rem);

            
            // 左側
            for (ll k = 0; k <= rem; k++){
                if (small[small_id - rem + k] > 0){
                    left_ans = max(left_ans, small_id - rem + k);
                }
            }
            if (left_ans == -1){
                for (ll k = large_id - 1; k >= 0; k--){
                    if (large[k] > 0){
                        for (ll l = 0; l < div; l++){
                            if (small[k * div + l] > 0){
                                left_ans = max(left_ans, k * div + l);
                            }
                        }
                        break;
                    }
                }
            }

            
            // 右側
            for (ll k = rem; k < div; k++){
                if (small[small_id - rem + k] > 0){
                    right_ans = min(right_ans, small_id - rem + k);
                }
            }
            if (right_ans == now){
                for (ll k = large_id + 1; k <= now / div; k++){
                    if (large[k] > 0){
                        for (ll l = 0; l < div; l++){
                            if (small[k * div + l] > 0){
                                right_ans = min(right_ans, k * div + l);
                            }
                        }
                        break;
                    }
                }
            }
            // debug_out(nid, left_ans, right_ans);
            now_l = nl;
            now_r = nr;

            ll INF = 10000000000000023;
            ans[nid] = INF;
            if (left_ans >= 0){
                ans[nid] = min(ans[nid], targs[small_id] - targs[left_ans]);
            }
            if (right_ans < now){
                ans[nid] = min(ans[nid], targs[right_ans] - targs[small_id]);
            }
        }
    }
    // debug(targs);
    for (ll i = 0; i < Q; i++){
        cout << ans[i] << endl;
    }
}
0