結果
問題 | No.2242 Cities and Teleporters |
ユーザー |
👑 ![]() |
提出日時 | 2023-03-10 21:38:44 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 347 ms / 3,000 ms |
コード長 | 4,080 bytes |
コンパイル時間 | 2,192 ms |
コンパイル使用メモリ | 211,032 KB |
最終ジャッジ日時 | 2025-02-11 07:56:17 |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 26 |
ソースコード
#include <bits/stdc++.h>#pragma GCC optimize("Ofast")using namespace std;using std::cout;using std::cin;using std::endl;using ll=long long;using ld=long double;ll ILL=2167167167167167167;const int INF=2100000000;const int mod=998244353;#define rep(i,a,b) for (ll i=a;i<b;i++)#define all(p) p.begin(),p.end()template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}namespace po167{template<class T,T(*op)(T,T)>struct Doubling_op{int _n;long long Log;std::vector<std::vector<int>> index_data;std::vector<std::vector<T>> value_data;Doubling_op(int n,long long limit,std::vector<int> index,std::vector<T> value):_n(n){Log=2;while(limit){limit/=2;Log++;}index_data.resize(Log);value_data.resize(Log);index_data[0]=index;value_data[0]=value;for(int i=1;i<Log;i++){index_data[i].resize(_n);value_data[i].resize(_n);for(int j=0;j<_n;j++){int tmp=index_data[i-1][j];index_data[i][j]=index_data[i-1][tmp];value_data[i][j]=op(value_data[i-1][j],value_data[i-1][tmp]);}}}std::pair<int,T> query(long long times,int start_index,T start_value){for(int i=0;i<Log;i++){if(times&1){start_value=op(start_value,value_data[i][start_index]);start_index=index_data[i][start_index];}times>>=1;}return std::make_pair(start_index,start_value);}};struct Doubling{int _n;long long Log;std::vector<std::vector<int>> index_data;Doubling(int n,long long limit,std::vector<int> index):_n(n){Log=2;while(limit){limit/=2;Log++;}index_data.resize(Log);index_data[0]=index;for(int i=1;i<Log;i++){index_data[i].resize(_n);for(int j=0;j<_n;j++){int tmp=index_data[i-1][j];index_data[i][j]=index_data[i-1][tmp];}}}int query(long long times,int start_index){for(int i=0;i<Log;i++){if(times&1){start_index=index_data[i][start_index];}times>>=1;}return start_index;}};}using po167::Doubling_op;using po167::Doubling;using doubleing_F=long long;doubleing_F d_op(doubleing_F l,doubleing_F r){return l+r;}void solve();// oddloopint main() {ios::sync_with_stdio(false);cin.tie(nullptr);int t=1;//cin>>t;rep(i,0,t) solve();}void solve(){int N;cin>>N;vector<int> H(N),T(N);rep(i,0,N) cin>>H[i];rep(i,0,N) cin>>T[i];vector<int> order(N),rev(N);rep(i,0,N) order[i]=i;sort(all(order),[&](int l,int r){return H[l]<H[r];});auto p=H;So(p);rep(i,0,N) rev[order[i]]=i;vector<int> F(N),S(N+1);rep(i,0,N){F[i]=UB(p,T[i]);}int tmp=-1;rep(i,0,N){int a=order[i];chmax(tmp,T[a]);S[i+1]=UB(p,tmp);}Doubling D(N+1,N+1,S);int Q;cin>>Q;rep(roop,0,Q){int a,b;cin>>a>>b;a--,b--;swap(a,b);if(H[a]<=T[b]){cout<<"1\n";continue;}b=F[b];a=rev[a];if(D.query(N+1,b)<=a){cout<<"-1\n";continue;}int ans=1;for(int i=D.Log-1;i>=0;i--){if(D.index_data[i][b]<=a){ans+=(1<<i);b=D.index_data[i][b];}}cout<<ans+1<<"\n";}}