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
| #include <bits/stdc++.h>
#define rep(i, l, r) for (int i = l, i##end = r; i <= i##end; ++i) #define repo(i, l, r) for (int i = l, i##end = r; i < i##end; ++i) #define per(i, l, r) for (int i = r, i##end = l; i >= i##end; --i) bool dbg = true; #define debug(x) if (dbg) cout << #x << ":\t" << (x) << endl; #define here if (dbg) printf("Passing [%s] in Line %d\n", __FUNCTION__, __LINE__); using namespace std; typedef long long LL; typedef long double LD; typedef pair<int, int> P; #define ll long long
const int maxn = 2e5 + 5; const int N = maxn; const int inf = 0x3f3f3f3f; const int INF = 0x3f3f3f3f; const ll mod = 1e9 + 7; const LD pi = acos(-1.0); const LD eps = 1e-13;
#define Assert(x) while (!(x));
int tree[maxn<<2], lazy[maxn<<2];
int n, m, t, a[maxn], b[maxn], k;
void build(int node, int l, int r) { lazy[node] = 0; if(l == r) { tree[node] = - n - 1 + l; return; } int mid = (l + r) / 2; build(node * 2, l, mid); build(node *2 + 1, mid + 1, r); tree[node] = min(tree[node * 2], tree[node * 2 + 1]); }
void push_down(int node) { if(lazy[node]) { tree[node*2] -= lazy[node]; tree[node*2+1] -= lazy[node]; lazy[node*2] += lazy[node]; lazy[node*2+1] += lazy[node]; lazy[node] = 0; } }
int query(int node, int l, int r, int x, int y) { if(x <= l && y >= r) return tree[node];
push_down(node); int mid = (l + r) / 2; int ans = INF; if(x <= mid) ans = min(ans, query(node * 2, l, mid, x, y)); if(y > mid) ans = min(ans, query(node * 2 + 1, mid + 1, r, x, y)); return ans; }
void update(int node, int l, int r, int x, int y, int c) { if(x <= l && y >= r) { tree[node] -= c; lazy[node] += c; return; }
push_down(node); int mid = (l + r) / 2; if(x <= mid) update(node * 2, l, mid, x, y, c); if(y > mid) update(node * 2 + 1, mid + 1, r, x, y, c); tree[node] = min(tree[node * 2], tree[node * 2 + 1]); }
int pro[maxn];
int main() { scanf("%d", &t); while(t--) { int tmp; scanf("%d %d %d", &n, &m, &k); for(int i = 1; i <= n; i++) scanf("%d", &a[i]); for(int i = 1; i <= m; i++) scanf("%d", &b[i]); for(int i = 1; i <= n; i++) a[i] = k - a[i]; sort(a + 1, a + 1 + n); for(int i = 1; i <= m; i++) { tmp = upper_bound(a + 1, a + 1 + n, b[i]) - a; b[i] = tmp - 1; } build(1, 1, n); int L = 1, R = 1; while(L <= m) { while(R <= m && query(1, 1, n, 1, n) < 0) { if(b[R] > 0) update(1, 1, n, 1, b[R], -1); R++; } if(query(1, 1, n, 1, n) >= 0) { pro[L] = R - 1; if(b[L] > 0) update(1, 1, n, 1, b[L], 1); L++; continue; } break; } for(int i = L; i <= m; i++) pro[i] = -1; int q, l, r; scanf("%d", &q); while(q--) { scanf("%d %d", &l, &r); if(pro[l] < 0 || pro[l] > r) printf("0\n"); else printf("%d\n", 1); } } }
|