2011 Multi-University Training Contest 11 - Host by UESTC XOR HDU - 3949

XOR is a kind of bit operator, we define that as follow: for two binary base number A and B, let C=A XOR B, then for each bit of C, we can get its value by check the digit of corresponding position in A and B. And for each digit, 1 XOR 1 = 0, 1 XOR 0 = 1, 0 XOR 1 = 1, 0 XOR 0 = 0. And we simply write this operator as ^, like 3 ^ 1 = 2,4 ^ 3 = 7. XOR is an amazing operator and this is a question about XOR. We can choose several numbers and do XOR operatorion to them one by one, then we get another number. For example, if we choose 2,3 and 4, we can get 2³4=5. Now, you are given N numbers, and you can choose some of them(even a single number) to do XOR on them, and you can get many different numbers. Now I want you tell me which number is the K-th smallest number among them.
Input
First line of the input is a single integer T(T<=30), indicates there are T test cases.
For each test case, the first line is an integer N(1<=N<=10000), the number of numbers below. The second line contains N integers (each number is between 1 and 10^18). The third line is a number Q(1<=Q<=10000), the number of queries. The fourth line contains Q numbers(each number is between 1 and 10^18) K1,K2,…KQ.
Output
For each test case,first output Case #C: in a single line,C means the number of the test case which is from 1 to T. Then for each query, you should output a single line contains the Ki-th smallest number in them, if there are less than Ki different numbers, output -1.
Sample Input
2
2
1 2
4
1 2 3 4
3
1 2 3
5
1 2 3 4 5
Sample Output
Case #1:
1
2
3
-1
Case #2:
0
1
2
3
-1

Hint
If you choose a single number, the result you get is the number you choose.
Using long long instead of int because of the result may exceed 2^31-1.

没想到是我们学校出的题。
可是我感觉不太好做；
题目涉及的是异或空间，那么我们同样的使用 高斯消元；

这里要注意的一点是，如果最小的是0，那么就要 k–;
这里主要涉及的是线性基；
求第k 小，我们只需将其分解为二进制；
然后将是1的位置异或起来；

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<string>
#include<bitset>
#include<ctime>
#include<deque>
#include<stack>
#include<functional>
#include<sstream>
using namespace std;
#define maxn 200005
#define inf 0x3f3f3f3f
#define INF 0x7fffffff
typedef long long  ll;
typedef unsigned long long ull;
#define ms(x) memset(x,0,sizeof(x))
const long long int mod = 1e9 + 7;


inline int read()
{
	int x = 0, k = 1; char c = getchar();
	while (c < '0' || c > '9') { if (c == '-')k = -1; c = getchar(); }
	while (c >= '0' && c <= '9')x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
	return x * k;
}


ull a[maxn];
int n, m, t, T;


int main()
{
	//ios::sync_with_stdio(false);
	cin >> T;
	int cnt = 0;
	while (T--) {
		cnt++;
		cin >> n;
		int  i, j;
		for (i = 1; i <= n; i++)cin >> a[i];
		int zero = 0;
		t = n;
		for (i = 1; i <= n; i++) {
			for (j = i + 1; j <= n; j++) {
				if (a[j] > a[i])swap(a[j], a[i]);
			}
			if (a[i] == 0) {
				zero = 1; t = i - 1; break;
			}
			for (int k = 63; k >= 0; k--) {
				if ((a[i] >> k) & 1) {
					for (j = 1; j <= n; j++) {
						if (i != j && (a[j] >> k) & 1)a[j] ^= a[i];
					}
					break;
				}
			}
		}
		m = read();
		//cout << "Case #" << cnt << ":" << endl;
		printf("Case #%d:\n", cnt);
		while (m--) {
			ull k, ans = 0;
			cin >> k;
			if (zero)k--;
			if (k >= 1ull << t)puts("-1");
			else {
				for (i = t - 1; i>=0; i--) {
					if ((k >> i) & 1)ans ^= a[t - i];
				}
				cout << ans << endl;
			}
		}
	}
}