結果
問題 | No.1332 Range Nearest Query |
ユーザー |
![]() |
提出日時 | 2021-01-08 22:37:46 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 236 ms / 2,500 ms |
コード長 | 6,819 bytes |
コンパイル時間 | 3,561 ms |
コンパイル使用メモリ | 216,568 KB |
最終ジャッジ日時 | 2025-01-17 12:55:39 |
ジャッジサーバーID (参考情報) |
judge4 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 48 |
ソースコード
#include <bits/stdc++.h> using namespace std; const long long MOD=1000000007; // const long long MOD=998244353; #define LOCAL #pragma region Macros typedef long long ll; typedef __int128_t i128; typedef unsigned int uint; typedef unsigned long long ull; #define ALL(x) (x).begin(),(x).end() const int INF=INT_MAX; const long long IINF=1e18; const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1}; const char dir[4]={'D','R','U','L'}; template<typename T> istream &operator>>(istream &is,vector<T> &v){ for (T &x:v) is >> x; return is; } template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){ for (int i=0;i<v.size();++i){ os << v[i] << (i+1==v.size()?"": " "); } return os; } template<typename T,typename U> ostream &operator<<(ostream &os,const pair<T,U> &p){ os << '(' << p.first << ',' << p.second << ')'; return os; } template<typename T,typename U,typename V> ostream&operator<<(ostream &os,const tuple<T,U,V> &t){ os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')'; return os; } template<typename T,typename U,typename V,typename W> ostream&operator<<(ostream &os,const tuple<T,U,V,W> &t){ os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')'; return os; } template<typename T,typename U> ostream &operator<<(ostream &os,const map<T,U> &m){ os << '{'; for (auto itr=m.begin();itr!=m.end();){ os << '(' << itr->first << ',' << itr->second << ')'; if (++itr!=m.end()) os << ','; } os << '}'; return os; } template<typename T,typename U> ostream &operator<<(ostream &os,const unordered_map<T,U> &m){ os << '{'; for (auto itr=m.begin();itr!=m.end();){ os << '(' << itr->first << ',' << itr->second << ')'; if (++itr!=m.end()) os << ','; } os << '}'; return os; } template<typename T> ostream &operator<<(ostream &os,const set<T> &s){ os << '{'; for (auto itr=s.begin();itr!=s.end();){ os << *itr; if (++itr!=s.end()) os << ','; } os << '}'; return os; } template<typename T> ostream &operator<<(ostream &os,const multiset<T> &s){ os << '{'; for (auto itr=s.begin();itr!=s.end();){ os << *itr; if (++itr!=s.end()) os << ','; } os << '}'; return os; } template<typename T> ostream &operator<<(ostream &os,const unordered_set<T> &s){ os << '{'; for (auto itr=s.begin();itr!=s.end();){ os << *itr; if (++itr!=s.end()) os << ','; } os << '}'; return os; } template<typename T> ostream &operator<<(ostream &os,const deque<T> &v){ for (int i=0;i<v.size();++i){ os << v[i] << (i+1==v.size()?"": " "); } return os; } void debug_out(){cerr << '\n';} template<class Head,class... Tail> void debug_out(Head&& head,Tail&&... tail){ cerr << head; if (sizeof...(Tail)>0) cerr << ", "; debug_out(move(tail)...); } #ifdef LOCAL #define debug(...) cerr << " ";\ cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\ cerr << " ";\ debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;} template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;} template<class T1,class T2> inline bool chmin(T1 &a,T2 b){ if (a>b){a=b; return true;} return false; } template<class T1,class T2> inline bool chmax(T1 &a,T2 b){ if (a<b){a=b; return true;} return false; } #pragma endregion template<typename Monoid> struct SegmentTree{ typedef function<Monoid(Monoid,Monoid)> F; int n; F f; Monoid id; vector<Monoid> dat; SegmentTree(int n_,F f,Monoid id):f(f),id(id){init(n_);} void init(int n_){ n=1; while(n<n_) n<<=1; dat.assign(n<<1,id); } void build(const vector<Monoid> &v){ for (int i=0;i<v.size();++i) dat[i+n]=v[i]; for (int i=n-1;i;--i) dat[i]=f(dat[i<<1|0],dat[i<<1|1]); } void update(int k,Monoid x){ dat[k+=n]=x; while(k>>=1) dat[k]=f(dat[k<<1|0],dat[k<<1|1]); } Monoid query(int a,int b){ if (a>=b) return id; Monoid vl=id,vr=id; for (int l=a+n,r=b+n;l<r;l>>=1,r>>=1){ if (l&1) vl=f(vl,dat[l++]); if (r&1) vr=f(dat[--r],vr); } return f(vl,vr); } template<typename C> int find_subtree(int k,const C &check,Monoid &M,bool type){ while(k<n){ Monoid nxt=type?f(dat[k<<1|type],M):f(M,dat[k<<1|type]); if (check(nxt)) k=k<<1|type; else M=nxt,k=k<<1|(type^1); } return k-n; } // min i s.t. f(seg[a],seg[a+1],...,seg[i]) satisfy "check" template<typename C> int find_first(int a,const C &check){ Monoid L=id; if (a<=0){ if (check(f(L,dat[1]))) return find_subtree(1,check,L,false); return -1; } int b=n; for (int l=a+n,r=b+n;l<r;l>>=1,r>>=1){ if (l&1){ Monoid nxt=f(L,dat[l]); if (check(nxt)) return find_subtree(l,check,L,false); L=nxt; ++l; } } return -1; } // max i s.t. f(seg[i],...,seg[b-2],seg[b-1]) satisfy "check" template<typename C> int find_last(int b,const C &check){ Monoid R=id; if (b>=n){ if (check(f(dat[1],R))) return find_subtree(1,check,R,true); return -1; } int a=n; for (int l=a,r=b+n;l<r;l>>=1,r>>=1){ if (r&1){ Monoid nxt=f(dat[--r],R); if (check(nxt)) return find_subtree(r,check,R,true); R=nxt; } } return -1; } Monoid operator[](int i){return dat[i+n];} }; int main(){ cin.tie(0); ios::sync_with_stdio(false); int N; cin >> N; vector<pair<int,int>> X; for (int i=0;i<N;++i){ int x; cin >> x; X.emplace_back(x,i); } sort(ALL(X)); int Q; cin >> Q; vector<tuple<int,int,int,int>> query; for (int i=0;i<Q;++i){ int l,r,x; cin >> l >> r >> x; --l; query.emplace_back(x,l,r,i); } sort(ALL(query)); vector<ll> ans(Q,IINF); SegmentTree<ll> seg1(N,[](ll a,ll b){return min(a,b);},IINF) ,seg2(N,[](ll a,ll b){return max(a,b);},-IINF); for (int i=Q-1,j=N-1;i>=0;--i){ int l,r,x,id; tie(x,l,r,id)=query[i]; while (j>=0&&X[j].first>=x) seg1.update(X[j].second,X[j].first),--j; chmin(ans[id],seg1.query(l,r)-x); } for (int i=0,j=0;i<Q;++i){ int l,r,x,id; tie(x,l,r,id)=query[i]; while (j<N&&X[j].first<=x) seg2.update(X[j].second,X[j].first),++j; chmin(ans[id],x-seg2.query(l,r)); } for (int a:ans) cout << a << '\n'; }