Hdu 3949 XOR 线性基
来源:互联网 发布:java中的迭代器是什么 编辑:程序博客网 时间:2024/06/03 21:07
XOR
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3357 Accepted Submission(s): 1155
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.
Sample Input
221 241 2 3 431 2 351 2 3 4 5
Sample Output
Case #1:123-1Case #2:0123-1HintIf 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
2011 Multi-University Training Contest 11 - Host by UESTC
求一个数列当中异或和第k大的数。
高斯消元求线性基,之后把k二进制拆分,从最低位开始依次xor得到的基向量。
#include <cstdio>#include <iostream>#include <string.h>#include <string> #include <map>#include <queue>#include <deque>#include <vector>#include <set>#include <algorithm>#include <math.h>#include <cmath>#include <stack>#include <iomanip>#define mem0(a) memset(a,0,sizeof(a))#define meminf(a) memset(a,0x3f,sizeof(a))using namespace std;typedef long long ll;typedef long double ld;typedef double db;const int maxn=10005,maxk=60,inf=0x3f3f3f3f; const ll llinf=0x3f3f3f3f3f3f3f3f; const ld pi=acos(-1.0L);ll a[maxn],x[maxn];bool linear_basis_insert(ll p) {for (int i=maxk;i>=0;i--) {if ((p>>i)%2==1) {if (!x[i]) {x[i]=p;for (int j=i-1;j>=0;j--) if (x[j]&&((x[i]>>j)%2==1)) x[i]^=x[j]; for (int j=i+1;j<=maxk;j++) if ((x[j]>>i)%2==1) x[j]^=x[i];return true;} else p=p^x[i];}}return p!=0;}int main() {int cas,cot=0;bool zero;scanf("%d",&cas);while (cas--) {mem0(x);zero=true;cot++;printf("Case #%d:\n",cot);int n,i,j,q,tot=0;ll p;scanf("%d",&n);for (i=1;i<=n;i++) {scanf("%lld",&a[i]);zero=zero&linear_basis_insert(a[i]);}scanf("%d",&q);for (i=0;i<=maxk;i++) if (x[i]) tot++;for (i=1;i<=q;i++) {scanf("%lld",&p);ll ans=0;if (!zero) p--;j=0;while (p) {while (!x[j]&&j<=maxk) j++;if (j>maxk) {ans=-1;break;}if (p%2) ans^=x[j];j++;p=p>>1;}printf("%lld\n",ans);} }return 0;}
阅读全文
0 0
- 【HDU 3949】 XOR|线性基
- [HDU 3949]XOR:线性基
- Hdu 3949 XOR 线性基
- HDU-3949 XOR 线性基
- HDU 3949 XOR (高斯消元求线性基)
- hdu 3949 XOR (高斯消元求线性基)
- HDU 3949 XOR [线性基|高斯消元]【数学】
- [高斯消元 线性基 二进制拆分] HDU 3949 XOR
- HDOJ 3949 XOR (高斯消元 + XOR线性基)
- hduoj 3949: XOR(线性基)
- 【HDU3949】XOR 线性基
- [HDU3949]XOR-线性基
- [线性基] HDU3949: XOR
- bzoj2115 Xor dfs&线性基
- 2115: [Wc2011] Xor 线性基
- 线性基 bzoj2115 [Wc2011] Xor
- bzoj2460(xor线性基)
- [BZOJ]2115 Xor 线性基
- ubuntu安装docker
- 不可不知的SUSE Linux二三事
- Blog的开启之路
- jquery表单校验插件
- 34.开源项目--git标签的基本概念
- Hdu 3949 XOR 线性基
- 谷歌神秘新系统支持 Swift 编程语言,这真是海纳百川啊
- Tomcat
- GDOI2005 河床 题解
- hexo
- Codeforces Problem 691D
- python学习---第四天
- 这是在csdn的第一天
- Presto内存管理源码分析