129 lines
2.7 KiB
C++
129 lines
2.7 KiB
C++
/* Problem URL: https://codeforces.com/contest/1878/problem/E */
|
|
|
|
#include <bits/stdc++.h>
|
|
|
|
using namespace std;
|
|
|
|
#define V vector
|
|
|
|
#define rmin(a, b) a = min(a, b)
|
|
#define rmax(a, b) a = max(a, b)
|
|
|
|
#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
|
|
#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
|
|
|
|
#define repv(i, v) for (auto &i : (v))
|
|
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
|
|
#define sortv(v) sort(v.begin(), v.end())
|
|
#define all(v) (v).begin(), (v).end()
|
|
|
|
using vi = vector<int>;
|
|
using vvi = vector<vi>;
|
|
using vvvi = vector<vvi>;
|
|
using vvvvi = vector<vvvi>;
|
|
|
|
using ll = long long;
|
|
|
|
using vl = vector<ll>;
|
|
using vvl = vector<vl>;
|
|
using vvvl = vector<vvl>;
|
|
using vvvvl = vector<vvvl>;
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
|
|
os << vec[0];
|
|
for (size_t i = 1; i < vec.size(); i++) {
|
|
os << ' ' << vec[i];
|
|
}
|
|
os << '\n';
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<v> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
is >> i;
|
|
}
|
|
return is;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
|
|
for (auto &i : vec) {
|
|
os << i[0];
|
|
for (size_t j = 1; j < i.size(); j++) {
|
|
os << ' ' << i[j];
|
|
}
|
|
os << '\n';
|
|
}
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
for (auto &j : i) {
|
|
is >> j;
|
|
}
|
|
}
|
|
return is;
|
|
}
|
|
|
|
int main()
|
|
{
|
|
ios::sync_with_stdio(false);
|
|
cin.tie(nullptr);
|
|
|
|
int t;
|
|
cin >> t;
|
|
while (t--) {
|
|
int n;
|
|
cin >> n;
|
|
|
|
vl nums(n);
|
|
cin >> nums;
|
|
|
|
int q;
|
|
cin >> q;
|
|
|
|
int log = 32 - __builtin_clz(n);
|
|
vvl sparse(n, vl(log));
|
|
rep(i, n) {
|
|
sparse[i][0] = nums[i];
|
|
}
|
|
nrep(i, 1, log) {
|
|
for (size_t j = 0; j + (1 << (i)) - 1 < n; j++) {
|
|
sparse[j][i] = sparse[j][i - 1] & sparse[j + (1 << (i - 1))][i - 1];
|
|
}
|
|
}
|
|
|
|
while (q--) {
|
|
ll l, k;
|
|
cin >> l >> k;
|
|
l--;
|
|
|
|
ll low = l;
|
|
ll high = n - 1;
|
|
ll ans = -1;
|
|
while (low <= high) {
|
|
ll mid = (low + high) / 2;
|
|
|
|
ll log = 0;
|
|
log = 31 - __builtin_clz(abs(mid - l) + 1);
|
|
|
|
ll tmp = sparse[l][log] & sparse[mid - (1 << log) + 1][log];
|
|
if (tmp >= k) {
|
|
ans = mid + 1;
|
|
low = mid + 1;
|
|
continue;
|
|
}
|
|
|
|
high = mid - 1;
|
|
}
|
|
|
|
cout << ans << ' ';
|
|
}
|
|
cout << '\n';
|
|
}
|
|
}
|