mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-12-25 17:52:02 +00:00
79 lines
1.5 KiB
C++
79 lines
1.5 KiB
C++
#include <iostream>
|
|
|
|
using std::cin;
|
|
using std::cout;
|
|
const char endl = '\n';
|
|
|
|
const int N = 65;
|
|
|
|
int t, n, m, cnt;
|
|
unsigned long long x, k, a[N], p[N], ans;
|
|
|
|
inline void insert(unsigned long long x) {
|
|
for (int i = 60; ~i; i--) {
|
|
if (x & (1ull << i)) {
|
|
if (a[i]) {
|
|
x ^= a[i];
|
|
} else {
|
|
for (int k = 0; k < i; k++) {
|
|
if (x & (1ull << k)) x ^= a[k];
|
|
}
|
|
|
|
for (int k = i + 1; k <= 60; k++) {
|
|
if (a[k] & (1ull << i)) a[k] ^= x;
|
|
}
|
|
|
|
a[i] = x;
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
int main() {
|
|
std::ios::sync_with_stdio(false);
|
|
cin.tie(nullptr);
|
|
|
|
cin >> t;
|
|
|
|
for (int c = 1; c <= t; c++) {
|
|
cout << "Case #" << c << ":" << endl;
|
|
|
|
cnt = 0;
|
|
std::fill(a, a + 62, 0);
|
|
|
|
cin >> n;
|
|
|
|
for (int i = 1; i <= n; i++) {
|
|
cin >> x;
|
|
|
|
insert(x);
|
|
}
|
|
|
|
for (int i = 0; i <= 60; i++) {
|
|
if (a[i]) p[cnt++] = a[i];
|
|
}
|
|
|
|
cin >> m;
|
|
|
|
while (m--) {
|
|
cin >> k;
|
|
|
|
if (cnt != n) k--;
|
|
|
|
if (k >= (1ull << cnt)) {
|
|
cout << -1 << endl;
|
|
} else {
|
|
ans = 0;
|
|
|
|
for (int i = 0; i < cnt; i++) {
|
|
if (k & (1ull << i)) ans ^= p[i];
|
|
}
|
|
|
|
cout << ans << endl;
|
|
}
|
|
}
|
|
}
|
|
return 0;
|
|
}
|