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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
|
#include <bits/stdc++.h>
using namespace std;
template <typename T> inline void read(T &a){
T w=1; a=0;
char ch=getchar();
for(;ch < '0' || ch > '9';ch=getchar()) if(ch == '-') w=-1;
for(;ch>='0'&&ch<='9';ch=getchar()) a=(a<<3)+(a<<1)+(ch^48);
a*=w;
}
template <typename T> inline void ckmax(T &a, T b){a = a > b ? a : b;}
template <typename T> inline void ckmin(T &a, T b){a = a < b ? a : b;}
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define Debug(x) cout << #x << " = " << x << endl
#define For(i,l,r) for (int i = l; i <= r; ++i)
#define foR(i,l,r) for (int i = l; i >= r; --i)
const int N = 1e5 + 10;
struct Node {
int r, a, dw, id;
} s[N];
bool cmp1 (Node x, Node y) { return x.dw < y.dw; }
bool cmp2 (Node x, Node y) { return x.r > y.r; }
struct Ques {
int x, y, id;
bool operator < (const Ques &c) const {
return max(s[x].r, s[y].r) > max(s[c.x].r, s[c.y].r);
}
} q[N];
int n, k, m;
int lsh1[N], cnt1;
int lsh2[N], cnt2;
int Status[N], Age[N];
int Ida (int x) { return lower_bound (lsh1 + 1, lsh1 + cnt1 + 1, x) - lsh1; }
int Idr (int x) { return lower_bound (lsh2 + 1, lsh2 + cnt2 + 1, x) - lsh2; }
inline void Init () {
For (i, 1, n) read(s[i].r), s[i].id = i, lsh2[++cnt2] = s[i].r;
For (i, 1, n) read(s[i].a), lsh1[++cnt1] = s[i].a;
sort (lsh1 + 1, lsh1 + cnt1 + 1);
cnt1 = unique(lsh1 + 1, lsh1 + cnt1 + 1) - lsh1 - 1;
sort (lsh2 + 1, lsh2 + cnt2 + 1);
cnt2 = unique(lsh2 + 1, lsh2 + cnt2 + 1) - lsh2 - 1;
For (i, 1, n) s[i].dw = Ida(s[i].a), s[i].r = Idr(s[i].r), Status[i] = s[i].r, Age[i] = s[i].a;
read(m);
For (i, 1, m)
read(q[i].x), read(q[i].y), q[i].id = i;
sort (q + 1, q + m + 1);
}
struct BIT {
int sum[N];
inline void upd (int x, int v) { for (int i = x; i <= cnt2; i += (i & (-i))) sum[i] += v; }
inline int que (int x) { int Ans = 0; for (int i = x; i; i -= (i & (-i))) Ans += sum[i]; return Ans; }
} tr;
int val[N];
inline void Captain() {
static int L, R;
L = 0, R = 0;
sort (s + 1, s + n + 1, cmp1);
For (i, 1, n) {
while (R < n && s[R + 1].a - s[i].a <= k) R++, tr.upd (s[R].r, 1);
while (L < R && s[i].a - s[L + 1].a > k) L++, tr.upd (s[L].r, -1);
val[s[i].id] = tr.que(s[i].r);
}
sort (s + 1, s + n + 1, cmp2);
}
int mx[N << 2];
#define ls x << 1
#define rs x << 1 | 1
inline void pushup (int x) { mx[x] = max(mx[ls], mx[rs]); }
void update (int x, int l, int r, int p, int v) {
if (l == r) return ckmax(mx[x], v), void();
int mid = l + r >> 1;
if (p <= mid) update (ls, l, mid, p, v);
else update(rs, mid + 1, r, p, v);
pushup(x);
}
int query (int x, int l, int r, int ll, int rr) {
if (ll > rr) return -1;
if (ll <= l && r <= rr) return mx[x];
int mid = l + r >> 1, Ans = -1;
if (ll <= mid) ckmax(Ans, query(ls, l, mid, ll, rr));
if (rr > mid) ckmax(Ans, query(rs, mid + 1, r, ll, rr));
return Ans;
}
#undef ls
#undef rs
int Ans[N];
inline void Solve () {
int L = 0;
For (i, 1, m) {
int tmp = max(Status[q[i].x], Status[q[i].y]);
while (L < n && s[L + 1].r >= tmp) L++, update(1, 1, cnt1, s[L].dw, val[s[L].id]);
int ql = Age[q[i].x], qr = Age[q[i].y];
if (ql > qr) swap(ql, qr);
int l = qr - k, r = ql + k;
if (l > r) { Ans[q[i].id] = -1; continue;}
int xx = r;
l = Ida(l), r = Ida(r); if (lsh1[r] > xx) r--;
Ans[q[i].id] = query (1, 1, cnt1, l, r);
if (!Ans[q[i].id]) Ans[q[i].id] = -1;
}
}
int main() {
read(n); read(k);
Init();
Captain();
Solve();
For (i, 1, m) printf ("%d\n", Ans[i]);
return 0;
}
|
