HDU3949 XOR(线性基第k小)
2024-10-01 01:39:23
Problem Description
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^3^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.
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.
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
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
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.
Author
elfness
Source
题目大意:给出$n$个数,问两两异或后第$k$小的数是多少
看了很多篇博客,发现都是在围绕着高斯消元解xor方程组来的。
然后我惊讶的发现,原来高斯消元解xor解方程组其实就是求出线性基然后再消元
通过消元保证线性基内有元素的每一列只有一个$1$
然后把$k$二进制分解,如果第$i$是$1$就异或上第$i$个有解的线性基
同时要特判$0$的情况,若线性基的大小与元素的大小相同则不能异或为$0$(线性无关),否则可以异或为零,这时我们只要求出第$k-1$小就可以了
这里把$k$二进制分解后的$0/1$实际对应了线性基中元素选/不选,可以证明这样一定是对的
#include<cstdio>
#include<cstring>
#include<algorithm>
#define int long long
using namespace std;
const int MAXN = 1e5 + , B = ;
inline int read() {
char c = getchar(); int x = , f = ;
while(c < '' || c > '') {if(c == '-') f = -; c = getchar();}
while(c >= '' && c <= '') x = x * + c - '', c = getchar();
return x * f;
}
int P[MAXN];
void Insert(int x) {
for(int i = B; i >= ; i--) {
if((x >> i) & ) {
if(P[i]) x = x ^ P[i];
else {P[i] = x; return ;}
}
}
}
void Debug(int *a, int N) {
for(int i = ; i <= N; i++) {
for(int j = ; j <= B; j++)
printf("%d ", (P[i] >> j) & );
puts("");
}
puts("********");
}
main() {
int QwQ = read();
for(int test = ; test <= QwQ; test++) {
printf("Case #%I64d:\n", test);
memset(P, , sizeof(P));
int N = read();
for(int i = ; i <= N; i++)
Insert(read());
for(int i = B; i >= ; i--) {
if(P[i]) {
for(int j = i + ; j <= B; j++)
if((P[j] >> i) & ) P[j] ^= P[i];
}
}
int now = ;
for(int i = ; i <= B; i++)
if(P[i])
P[now++] = P[i];
int Q = read();
while(Q--) {
int K = read(), ans = ;
if(now != N) K--;
if(K >= (1ll << now)) {puts("-1"); continue;}
for(int i = ; i <= B; i++)
if((K >> i) & )
ans ^= P[i];
printf("%I64d\n", ans);
}
}
}
最新文章
- YII2生成增删改查
- liquibase的使用
- springMvc配置编码过滤器
- Java面试题之九
- ORACLE函数TO_CHAR以及数字转换格式[Z]
- 一种抛弃GPS的中近距离高精度无线同步新方案
- PIC32MZ Live update bootloader
- Online Judge(OJ)搭建——5、配置
- wamp apache 设置多端口
- selenium加载配置参数,让chrome浏览器不出现‘Chrome正在受到自动软件的控制’的提示语,以及后台静默模式启动自动化测试,不占用桌面的方法
- ValidateCode源码
- mysql之用户权限管理
- 登录Windows界面前执行自定义脚本
- adoquery.refresh和adoquery.query的区别
- Python时间,日期,时间戳之间转换,时间转换时间戳,Python时间戳转换时间,Python时间转换时间戳
- HTML 滚动条样式修改
- python set()、len()、type()、保留小数、EOFError
- 进制转换 map
- 机器学习的MLE和MAP:最大似然估计和最大后验估计
- git学习(五):git diff魔法