結果

問題 No.1332 Range Nearest Query
ユーザー kiyoshi0205kiyoshi0205
提出日時 2021-01-08 22:47:01
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 272 ms / 2,500 ms
コード長 5,808 bytes
コンパイル時間 3,259 ms
コンパイル使用メモリ 201,072 KB
実行使用メモリ 33,644 KB
最終ジャッジ日時 2023-08-10 10:50:51
合計ジャッジ時間 15,694 ms
ジャッジサーバーID
(参考情報)
judge12 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 2 ms
4,384 KB
testcase_02 AC 2 ms
4,384 KB
testcase_03 AC 230 ms
22,664 KB
testcase_04 AC 229 ms
22,924 KB
testcase_05 AC 237 ms
23,512 KB
testcase_06 AC 194 ms
32,092 KB
testcase_07 AC 196 ms
32,196 KB
testcase_08 AC 197 ms
33,292 KB
testcase_09 AC 197 ms
33,200 KB
testcase_10 AC 195 ms
32,532 KB
testcase_11 AC 196 ms
33,224 KB
testcase_12 AC 195 ms
32,204 KB
testcase_13 AC 195 ms
32,644 KB
testcase_14 AC 194 ms
32,340 KB
testcase_15 AC 195 ms
32,388 KB
testcase_16 AC 265 ms
33,528 KB
testcase_17 AC 265 ms
33,380 KB
testcase_18 AC 262 ms
33,164 KB
testcase_19 AC 268 ms
32,712 KB
testcase_20 AC 262 ms
32,908 KB
testcase_21 AC 272 ms
32,684 KB
testcase_22 AC 270 ms
33,420 KB
testcase_23 AC 268 ms
32,720 KB
testcase_24 AC 257 ms
32,128 KB
testcase_25 AC 260 ms
32,540 KB
testcase_26 AC 194 ms
32,164 KB
testcase_27 AC 164 ms
33,644 KB
testcase_28 AC 49 ms
6,936 KB
testcase_29 AC 49 ms
6,964 KB
testcase_30 AC 51 ms
6,952 KB
testcase_31 AC 46 ms
7,072 KB
testcase_32 AC 52 ms
7,052 KB
testcase_33 AC 52 ms
6,960 KB
testcase_34 AC 47 ms
6,920 KB
testcase_35 AC 49 ms
6,956 KB
testcase_36 AC 48 ms
6,936 KB
testcase_37 AC 50 ms
7,000 KB
testcase_38 AC 175 ms
19,172 KB
testcase_39 AC 90 ms
7,808 KB
testcase_40 AC 257 ms
31,676 KB
testcase_41 AC 121 ms
10,756 KB
testcase_42 AC 176 ms
18,900 KB
testcase_43 AC 142 ms
14,368 KB
testcase_44 AC 214 ms
22,528 KB
testcase_45 AC 203 ms
21,296 KB
testcase_46 AC 160 ms
14,352 KB
testcase_47 AC 184 ms
21,428 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define uniq(v) vsort(v);(v).erase(unique(all(v)),(v).end())
#define endl "\n"
#define eb emplace_back
#define print(x) cout<<x<<endl
#define printyes print("Yes")
#define printno print("No")
#define printYES print("YES")
#define printNO print("NO")
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
constexpr ll mod=1000000007;
// constexpr ll mod=998244353;
constexpr ll inf=1LL<<60;
constexpr double eps=1e-9;
const double PI=acos(-1);
template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}
template<class T> ostream& operator<<(ostream& os,const vector<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const set<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;}
template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;}
#ifdef DEBUG
void debugg(){cout<<endl;}
template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);}
#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif

void startupcpp(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(15);
}

double distance(ddatas x,ddatas y){
  double a=x.first-y.first,b=x.second-y.second;
  return sqrt(a*a+b*b);
}

ll modinv(ll a,ll m=mod) {
  ll b=m,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+m)%m;
}

ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}

vec modncrlistp,modncrlistm;

ll modncr(ll n,ll r){
  if(n<r)return 0;
  ll i,size=modncrlistp.size();
  if(size<=n){
    modncrlistp.resize(n+1);
    modncrlistm.resize(n+1);
    if(!size){
      modncrlistp[0]=modncrlistm[0]=1;
      size++;
    }
    For(i,size,n+1){
      modncrlistp[i]=modncrlistp[i-1]*i%mod;
      modncrlistm[i]=modinv(modncrlistp[i]);
    }
  }
  return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}

ll modpow(ll a,ll n,ll m=mod){
  ll res=1;
  while(n>0){
    if(n&1)res=res*a%m;
    a=a*a%m;
    n>>=1;
  }
  return res;
}

ll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

ll countdigits(ll n,ll k=10){
  ll ans=0;
  while(n){n/=k;ans++;}
  return ans;
}

ll sumdigits(ll n,ll k=10){
  ll ans=0;
  while(n){ans+=n%k;n/=k;}
  return ans;
}
template<typename T> struct segtree{
private:
  int N=1;
  T E;
  using func=function<T(T,T)>;
  func f,g;
  vector<T> tree;
public:
  segtree(){}
  segtree(vector<T>& v,T e,func Merge,func Act):E(e),f(Merge),g(Act){
    int i,K=v.size();
    while(N<K)N<<=1;
    tree.resize(N<<1);
    For(i,N,N+K)tree[i]=v[i-N];
    For(i,N+K,N<<1)tree[i]=E;
    brep1(i,N)tree[i]=f(tree[i<<1],tree[(i<<1)|1]);
  }
  segtree(vector<T>& v,T e,func Merge){*this=segtree(v,e,Merge,Merge);};
  segtree(int N,T e,func F){
    vector<T> res(N,e);
    *this=segtree(res,e,F);
  }
  void action(int i,T a){
    if((i<0)|(i>=N))return;
    i+=N;
    tree[i]=g(tree[i],a);
    while(i>1){
      i>>=1;
      tree[i]=f(tree[i<<1],tree[(i<<1)|1]);
    }
  }
  void input(int i,T a){
    if((i<0)|(i>=N))return;
    tree[i+=N]=a;
    while(i>1){
      i>>=1;
      tree[i]=f(tree[i<<1],tree[(i<<1)|1]);
    }
  }
  T queli(int a,int b){
    if((a>=b)|(a<0)|(b<=0)|(a>=N)|(b>N))return E;
    T l(E),r(E);
    for(a+=N,b+=N;a<b;a>>=1,b>>=1){
      if(a&1)l=f(l,tree[a++]);
      if(b&1)r=f(tree[--b],r);
    }
    return f(l,r);
  }
};

ll N,M,K,H,W,A,B,C,D;
string s,t;
ll ans;
int main(){
  startupcpp();
  // int codeforces;cin>>codeforces;while(codeforces--){
  ll i,j;
  cin>>N;
  vec A(N);
  rep(i,N)cin>>A[i];
  cin>>M;
  vec l(M),r(M);
  pvec v;
  rep(i,N){
    v.eb(A[i],i);
  }
  rep(i,M){
    ll x;
    cin>>l[i]>>r[i]>>x;
    --l[i];
    v.eb(x,i+N);
  }
  vsort(v);
  segtree<ll> rMq(N,-inf,[](ll a,ll b){return max(a,b);}),rmq(N,inf,[](ll a,ll b){return min(a,b);});
  vec ans(M,inf);
  for(auto x:v){
    if(x.second<N){
      rMq.input(x.second,x.first);
      // rmq.input(x.second,x.first);
    }else{
      i=x.second-N;
      chmin(ans[i],x.first-rMq.queli(l[i],r[i]));
    }
  }
  reverse(all(v));
  for(auto x:v){
    if(x.second<N){
      rmq.input(x.second,x.first);
      // rmq.input(x.second,x.first);
    }else{
      i=x.second-N;
      chmin(ans[i],rmq.queli(l[i],r[i])-x.first);
    }
  }
  for(auto x:ans)print(x);
// }
}
0