1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
struct PairHash {inline std::size_t operator()(const std::pair<int,int> & v) const {return v.first*31+v.second;}};
#define MAX_N 202020
#define INF 987654321
#define EPS 1e-9
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define all3 array<ll,3>
#define all5 array<ll,5>
#define vall5 vector<all5>
#define vll vector<ll>
#define vi vector<int>
#define vs vector<string>
#define usll unordered_set<ll>
#define uspll unordered_set<pll, PairHash>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
using namespace std;
vs solve(vll& A, vll& B, vpll& Q) {
ll n = A.size();
vpll range(n, {INT_MAX, INT_MIN});
usll aus, bus;
for(ll i = 0, j = 0; i < n; i++) {
if(aus.count(A[i])) range[i] = range[i - 1];
else {
aus.insert(A[i]);
while(j < n and aus.count(B[j])) {
bus.insert(B[j]);
if(aus.size() == bus.size()) {
range[i].first = min(range[i].first, j);
range[i].second = max(range[i].second, j);
}
j++;
}
}
}
string Y = "Yes", N = "No";
vs res;
for(auto& [a, b] : Q) {
auto [s, e] = range[a - 1];
res.push_back(s <= b - 1 and b - 1 <= e ? Y : N);
}
return res;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll tc = 1;
for(ll i = 1; i <= tc; i++) {
ll n, q;
cin>>n;
vll A(n), B(n);
for(ll j = 0; j < n; j++) cin>>A[j];
for(ll j = 0; j < n; j++) cin>>B[j];
cin>>q;
vpll Q(q);
for(ll j = 0; j < q; j++) cin>>Q[j].first>>Q[j].second;
auto res = solve(A,B, Q);
for(auto& r : res) cout<<r<<endl;
}
return 0;
}
|
