#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
/*
Phu Trong from Nguyen Tat Thanh High School for gifted student
*/
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
#define MAX 500005
int A[MAX], B[MAX];
int nArr, numQuery;
struct Queries{
int l, r, id;
Queries(){}
Queries(int _l, int _r, int _id): l(_l), r(_r), id(_id){}
} Q[MAX];
namespace SUBTASK_4{
bool check(void){
return nArr <= 100000 && numQuery <= 10;
}
void main(void){
auto solve = [&](int l, int r){
vector<pair<int, int>> events;
FOR(i, l, r){
events.emplace_back(B[i], i);
events.emplace_back(A[i], -i);
}
sort(events.begin(), events.end());
int curLine = 0;
for (int i = 0; i < (int)events.size(); ++i){
if(events[i].second < 0) --curLine;
else ++curLine;
if(i > 0 && curLine == 0){
if(events[i].second == -events[i - 1].second) return false;
}
}
return true;
};
for (int i = 1; i <= numQuery; ++i){
cout << (solve(Q[i].l, Q[i].r) ? "Yes\n" : "No\n");
}
}
}
namespace SUBTASK_6{
struct MinSegmentTree{
vector<int> st, lz;
int n;
MinSegmentTree(int _n = 0){
this -> n = _n;
st.resize((n << 2) + 5, INF);
lz.resize((n << 2) + 5, INF);
}
#define lson (nd << 1)
#define rson (nd << 1 | 1)
void pushDown(int nd){
if (lz[nd] == INF) return;
minimize(st[lson], lz[nd]);
minimize(st[rson], lz[nd]);
minimize(lz[lson], lz[nd]);
minimize(lz[rson], lz[nd]);
lz[nd] = INF;
}
void upd(int nd, int l, int r, int u, int v, int value){
if (u > r || v < l) return;
if (u <= l && v >= r){
minimize(st[nd], value);
minimize(lz[nd], value);
return;
}
int m = (l + r) >> 1;
pushDown(nd);
upd(lson, l, m, u, v, value);
upd(rson, m + 1, r, u, v, value);
st[nd] = min(st[rson], st[lson]);
}
int query(int nd, int l, int r, int u, int v){
if (u > r || v < l) return INF;
if (u <= l && v >= r) return st[nd];
int m = (l + r) >> 1;
pushDown(nd);
int ql = query(lson, l, m, u, v);
int qr = query(rson, m + 1, r, u, v);
return min(ql, qr);
}
};
struct MaxSegmentTree{
vector<int> st, lz;
int n;
MaxSegmentTree(int _n = 0){
this -> n = _n;
st.resize((n << 2) + 5, 0);
lz.resize((n << 2) + 5, 0);
}
#define lson (nd << 1)
#define rson (nd << 1 | 1)
void pushDown(int nd){
if (lz[nd] == 0) return;
maximize(st[lson], lz[nd]);
maximize(st[rson], lz[nd]);
maximize(lz[lson], lz[nd]);
maximize(lz[rson], lz[nd]);
lz[nd] = 0;
}
void upd(int nd, int l, int r, int u, int v, int value){
if (u > r || v < l) return;
if (u <= l && v >= r){
maximize(st[nd], value);
maximize(lz[nd], value);
return;
}
int m = (l + r) >> 1;
pushDown(nd);
upd(lson, l, m, u, v, value);
upd(rson, m + 1, r, u, v, value);
st[nd] = max(st[rson], st[lson]);
}
int query(int nd, int l, int r, int u, int v){
if (u > r || v < l) return 0;
if (u <= l && v >= r) return st[nd];
int m = (l + r) >> 1;
pushDown(nd);
int ql = query(lson, l, m, u, v);
int qr = query(rson, m + 1, r, u, v);
return max(ql, qr);
}
};
struct SegmentTree{
vector<int> st;
int n;
SegmentTree(int _n = 0){
this -> n = _n;
st.resize((n << 2) + 5);
}
#define lson (nd << 1)
#define rson (nd << 1 | 1)
void upd(int nd, int l, int r, int pos, int value){
if(l == r){
st[nd] = value;
return;
}
int m = (l + r) >> 1;
if(pos <= m) upd(lson, l, m, pos, value);
else upd(rson, m + 1, r, pos, value);
st[nd] = min(st[lson], st[rson]);
}
int query(int nd, int l, int r, int u, int v){
if (u > r || v < l) return INF;
if (u <= l && v >= r) return st[nd];
int m = (l + r) >> 1;
int ql = query(lson, l, m, u, v);
int qr = query(rson, m + 1, r, u, v);
return min(ql, qr);
}
};
int left[MAX], right[MAX];
vector<pair<int, int>> events[MAX];
vector<int> rem[MAX];
int ans[MAX];
void main(void){
MaxSegmentTree lf(2 * nArr);
for (int i = 1; i <= nArr; ++i){
left[i] = lf.query(1, 1, 2 * nArr, B[i], A[i]);
lf.upd(1, 1, 2 * nArr, B[i], A[i], i);
}
MinSegmentTree rg(2 * nArr);
for (int i = nArr; i >= 1; --i){
right[i] = rg.query(1, 1, 2 * nArr, B[i], A[i]);
if(right[i] > nArr + 1) right[i] = nArr + 1;
rg.upd(1, 1, 2 * nArr, B[i], A[i], i);
}
// cout << "DEBUG: \n";
// FOR(i, 1, nArr) cout << left[i] << " \n"[i == nArr];
// FOR(i, 1, nArr) cout << right[i] << " \n"[i == nArr];
FOR(i, 1, nArr) {
rem[right[i]].emplace_back(i);
}
for (int i = 1; i <= numQuery; ++i){
events[Q[i].r].emplace_back(Q[i].l, i);
}
SegmentTree myit(nArr);
for (int r = 1; r <= nArr; ++r){
myit.upd(1, 1, nArr, r, left[r]);
for (int&j: rem[r]){
myit.upd(1, 1, nArr, j, r);
}
for (pair<int, int>&x : events[r]){
int l = x.first, id = x.second;
ans[id] = (myit.query(1, 1, nArr, l, r) >= l);
}
}
for (int i = 1; i <= numQuery; ++i){
cout << (ans[i] ? "Yes" : "No") << '\n';
}
}
}
void process(void){
cin >> nArr;
for (int i = 1; i <= nArr; ++i) cin >> A[i];
for (int i = 1; i <= nArr; ++i) cin >> B[i];
cin >> numQuery;
for (int i = 1; i <= numQuery; ++i){
cin >> Q[i].l >> Q[i].r;
Q[i].id = i;
}
if(SUBTASK_4 :: check()) {
SUBTASK_4 :: main();
return;
}
SUBTASK_6 :: main();
}
signed main(){
#define name "Whisper"
cin.tie(nullptr) -> sync_with_stdio(false);
//freopen(name".inp", "r", stdin);
//freopen(name".out", "w", stdout);
process();
return (0 ^ 0);
}
