結果

問題 No.1332 Range Nearest Query
ユーザー 👑 tute7627tute7627
提出日時 2021-01-08 21:57:19
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 281 ms / 2,500 ms
コード長 6,104 bytes
コンパイル時間 2,384 ms
コンパイル使用メモリ 212,176 KB
実行使用メモリ 28,252 KB
最終ジャッジ日時 2023-08-10 09:23:28
合計ジャッジ時間 14,088 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 248 ms
19,340 KB
testcase_04 AC 245 ms
19,336 KB
testcase_05 AC 247 ms
19,288 KB
testcase_06 AC 138 ms
27,992 KB
testcase_07 AC 134 ms
28,188 KB
testcase_08 AC 133 ms
27,980 KB
testcase_09 AC 133 ms
28,188 KB
testcase_10 AC 134 ms
27,948 KB
testcase_11 AC 135 ms
28,196 KB
testcase_12 AC 134 ms
28,000 KB
testcase_13 AC 137 ms
28,092 KB
testcase_14 AC 136 ms
28,056 KB
testcase_15 AC 135 ms
28,116 KB
testcase_16 AC 276 ms
27,992 KB
testcase_17 AC 278 ms
27,920 KB
testcase_18 AC 275 ms
28,188 KB
testcase_19 AC 280 ms
27,904 KB
testcase_20 AC 272 ms
27,920 KB
testcase_21 AC 276 ms
28,096 KB
testcase_22 AC 278 ms
28,064 KB
testcase_23 AC 278 ms
28,252 KB
testcase_24 AC 281 ms
28,060 KB
testcase_25 AC 279 ms
27,944 KB
testcase_26 AC 116 ms
28,052 KB
testcase_27 AC 92 ms
28,056 KB
testcase_28 AC 37 ms
7,016 KB
testcase_29 AC 38 ms
7,216 KB
testcase_30 AC 39 ms
6,928 KB
testcase_31 AC 36 ms
7,020 KB
testcase_32 AC 40 ms
6,928 KB
testcase_33 AC 39 ms
7,116 KB
testcase_34 AC 36 ms
6,944 KB
testcase_35 AC 37 ms
7,020 KB
testcase_36 AC 37 ms
7,072 KB
testcase_37 AC 37 ms
7,080 KB
testcase_38 AC 172 ms
17,680 KB
testcase_39 AC 79 ms
7,456 KB
testcase_40 AC 269 ms
27,944 KB
testcase_41 AC 107 ms
9,912 KB
testcase_42 AC 170 ms
17,604 KB
testcase_43 AC 126 ms
12,572 KB
testcase_44 AC 223 ms
18,696 KB
testcase_45 AC 203 ms
18,160 KB
testcase_46 AC 157 ms
13,004 KB
testcase_47 AC 189 ms
17,900 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
template<typename T>void rearrange(vector<ll>&ord, vector<T>&v){
  auto tmp = v;
  for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<ll>&ord,Head&& head, Tail&&... tail){
  rearrange(ord, head);
  rearrange(ord, tail...);
}
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
template< typename Monoid ,typename F>
struct SegmentTree {
  int sz, n;
  vector< Monoid > seg;
  const F f;
  const Monoid M1;

  SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1), n(n){
    sz = 1;
    while(sz < n) sz <<= 1;
    seg.assign(2 * sz, M1);
  }

  void set(int k, const Monoid &x) {
    seg[k + sz] = x;
  }

  void build() {
    for(int k = sz - 1; k > 0; k--) {
      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
    }
  }

  void update(int k, const Monoid &x) {
    k += sz;
    seg[k] = x;
    while(k >>= 1) {
      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
    }
  }

  Monoid query(int a, int b) {
	  if(a>=b)return M1;
    Monoid L = M1, R = M1;
    for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
      if(a & 1) L = f(L, seg[a++]);
      if(b & 1) R = f(seg[--b], R);
    }
    return f(L, R);
  }

  Monoid operator[](const int &k) const {
    return seg[k + sz];
  }

  template< typename C >
  int find_subtree(int a, const C &check, Monoid &M, bool type) {
    while(a < sz) {
      Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);
      if(check(nxt)) a = 2 * a + type;
      else M = nxt, a = 2 * a + 1 - type;
    }
    return a - sz;
  }
  //[a,x]が条件を満たす最初のx,満たさなければ-1
  template< typename C >
  int find_first(int a, const C &check) {
    Monoid L = M1;
    if(a <= 0) {
      if(check(f(L, seg[1]))) return find_subtree(1, check, L, false);
      return -1;
    }
    int b = sz;
    for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
      if(a & 1) {
        Monoid nxt = f(L, seg[a]);
        if(check(nxt)) return find_subtree(a, check, L, false);
        L = nxt;
        ++a;
      }
    }
    return -1;
  }
  //[x,b)が条件を満たす最後のx,満たさなければ-1
  template< typename C >
  int find_last(int b, const C &check) {
    Monoid R = M1;
    if(b >= sz) {
      if(check(f(seg[1], R))) return find_subtree(1, check, R, true);
      return -1;
    }
    int a = sz;
    for(b += sz; a < b; a >>= 1, b >>= 1) {
      if(b & 1) {
        Monoid nxt = f(seg[--b], R);
        if(check(nxt)) return find_subtree(b, check, R, true);
        R = nxt;
      }
    }
    return -1;
  }
  void print(){
    for(ll i=0;i<n;i++)if((*this)[i]==M1)cout<<"x ";else cout<<(*this)[i]<<" ";
    cout<<endl;
  }
};
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n;cin>>n;
  auto f1=[&](ll x,ll y){return max(x,y);};
  SegmentTree<ll,decltype(f1)>segl(n,f1,-INF);
  auto f2=[&](ll x,ll y){return min(x,y);};
  SegmentTree<ll,decltype(f2)>segr(n,f2,INF);
  vector<ll>x(n);
  rep(i,0,n)cin>>x[i];
  vector<ll>ord(n);
  iota(ALL(ord),0);
  sort(ALL(ord),[&](ll i,ll j){return x[i]<x[j];});
  ll q;cin>>q;
  vector<ll>l(q),r(q),v(q);
  rep(i,0,q){
    cin>>l[i]>>r[i]>>v[i];
    l[i]--;
  }
  vector<ll>oq(q);
  iota(ALL(oq),0);
  sort(ALL(oq),[&](ll i,ll j){return v[i]<v[j];});
  rep(i,0,n){
    segr.set(i,x[i]);
  }
  segr.build();
  ll idx=0;
  vector<ll>ret(q);
  for(auto i:oq){
    while(idx<n&&x[ord[idx]]<v[i]){
      segl.update(ord[idx],x[ord[idx]]);
      segr.update(ord[idx],INF);
      idx++;
    }
    ll xl=segl.query(l[i],r[i]);
    ll xr=segr.query(l[i],r[i]);
    ret[i]=min(abs(v[i]-xl),abs(v[i]-xr));
  }
  rep(i,0,q)cout<<ret[i]<<endl;
  return 0;
}
0