#include #include #define rep(i,n) for (int i = 0; i < int(n); ++i) #define repp(i,n,m) for (int i = m; i < int(n); ++i) #define reb(i,n) for (int i = int(n)-1; i >= 0; --i) #define all(v) v.begin(),v.end() using namespace std; using namespace atcoder; using ll = long long; using ull = unsigned long long; using ld = long double; using P = pair; using PL = pair; using pdd = pair; using pil = pair; using pli = pair; templateistream &operator>>(istream &is,vector &v){for(auto &e:v)is>>e;return is;} templatebool range(T a,T b,T x){return (a<=x&&xbool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));} template T rev(const T& str_or_vec){T res = str_or_vec; reverse(res.begin(),res.end()); return res; } templatebool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;} templatebool chmax(T &a,const T &b){if(avoid uniq(vector &v){sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());} templatevoid print(pair a); templatevoid print(vector v); templatevoid print(vector> v); void print(){ putchar(' '); } void print(bool a){ printf("%d", a); } void print(int a){ printf("%d", a); } void print(long a){ printf("%ld", a); } void print(long long a){ printf("%lld", a); } void print(char a){ printf("%c", a); } void print(char a[]){ printf("%s", a); } void print(const char a[]){ printf("%s", a); } void print(long double a){ printf("%.15Lf", a); } void print(const string& a){ for(auto&& i : a) print(i); } void print(unsigned int a){ printf("%u", a); } void print(unsigned long long a) { printf("%llu", a); } template void print(const T& a){ cout << a; } int out(){ putchar('\n'); return 0; } template int out(const T& t){ print(t); putchar('\n'); return 0; } template int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; } templatevoid print(pair a){print(a.first);print(),print(a.second);} templatevoid print(vector v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}} templatevoid print(vector> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}} void yes(){out("Yes");} void no (){out("No");} void yn (bool t){if(t)yes();else no();} void fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout< dx = {0,1,0,-1,1,1,-1,-1}; const vector dy = {1,0,-1,0,1,-1,-1,1}; const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string alp = "abcdefghijklmnopqrstuvwxyz"; const string NUM = "0123456789"; } // namespace noya2 using namespace noya2; using mint = modint998244353; //using mint = modint1000000007; //using mint = modint; void out(mint a){out(a.val());} void out(vector a){vector b(a.size()); rep(i,a.size()) b[i] = a[i].val(); out(b);} void out(vector> a){for (auto v : a) out(v);} istream &operator>>(istream &is,vector &v){for(auto &e:v){ll _x;is>>_x;e=_x;}return is;} void solve(){ int n; cin >> n; vector

ht(n); rep(i,n) cin >> ht[i].first; rep(i,n) cin >> ht[i].second; vector ids(n); iota(all(ids),0); auto comp = [&](int i, int j){ return ht[i].first < ht[j].first; }; sort(all(ids),comp); vector inv(n); rep(i,n) inv[ids[i]] = i; vector h(n), t(n); rep(i,n) h[i] = ht[ids[i]].first, t[i] = ht[ids[i]].second; vector

rui(n+1); rui[0] = P(0,-1); rep(i,n){ rui[i+1] = rui[i]; if (chmax(rui[i+1].first,t[i])){ rui[i+1].second = i; } } int m = 20; vector> dp(m,vector(n,-1)); rep(i,n){ int r = upper_bound(all(h),t[i]) - h.begin(); dp[0][i] = rui[r].second; } for (int j = 1; j < m; j++){ rep(i,n){ if (dp[j-1][i] != -1){ dp[j][i] = dp[j-1][dp[j-1][i]]; } } } map mp; int q; cin >> q; while(q--){ int a, b; cin >> a >> b; a = inv[a-1], b = inv[b-1]; if (dp[m-1][a] == -1 || h[b] > t[dp[m-1][a]]){ out(-1); continue; } if (mp.find(P(a,b)) != mp.end()){ out(mp[P(a,b)]); continue; } int ans = 1; while (h[b] > t[a]){ a = dp[0][a]; ans++; } out(ans); mp[P(a,b)] = ans; } } int main(){ fast_io(); int t = 1; //cin >> t; while(t--) solve(); }