zoukankan      html  css  js  c++  java
  • hdu 3949 XOR

    http://acm.hdu.edu.cn/showproblem.php?pid=3949

    题意:

    给出n个元素

    求第k小子集异或和

    构造每个二进制位至多有1个1的线性基

    这样才能二进制拆分k查询第k小的异或值

    线性基消成上三角矩阵便可以,但在这里要消成对角矩阵

    #include<cstdio>
    #include<cstring>
    #include<iostream>
    
    using namespace std;
    
    #define N 10001
    
    typedef long long LL;
    
    LL a[N];
    
    LL b[61],res[61];
    
    template <typename T>
    void read(T &x)
    {
        x=0; char c=getchar();
        while(!isdigit(c)) c=getchar();
        while(isdigit(c))  { x=x*10+c-'0'; c=getchar(); }
    }
    
    int main()
    {
        int T,n,m;
        LL p,tot,ans;
        bool zero;
        int cnt;
        read(T);
        for(int t=1;t<=T;++t)
        {
            memset(b,0,sizeof(b));
            read(n);
            for(int i=1;i<=n;++i) read(a[i]);
            for(int i=1;i<=n;++i)
                for(int j=60;j>=0;--j)
                    if(a[i]>>j&1)
                    {
                        if(b[j]) a[i]^=b[j];
                        else
                        {
                            b[j]=a[i];
                            for(int k=j-1;k>=0;--k) 
                                if(b[j]>>k&1) b[j]^=b[k];
                            for(int k=j+1;k<=60;++k)
                                if(b[k]>>j&1) b[k]^=b[j];
                            break;
                        }
                    }
            cnt=0;
            for(int i=0;i<=60;++i) 
                if(b[i]) res[cnt++]=b[i];
            for(int i=0;i<cnt;++i) cout<<res[i]<<' ';
            cout<<'
    ';
        }
    }

    XOR

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 3524    Accepted Submission(s): 1211


    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.
     
    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.
     
    Author
    elfness
     
    Source
     
    Recommend
    xubiao   |   We have carefully selected several similar problems for you:  3946 3947 3945 3944 3950 
  • 相关阅读:
    03_输出程序状态信息
    06_键盘事件
    Silverlight中引用图片的方式
    04_响应单点触控
    02_ListActive中响应事件 并LogCat输出
    批量插入更新的 sql语句
    07_重力倾斜度响应
    读取XML
    人生启示录效应篇之牢骚效应:凡是公司中有对工作发牢骚的人,那家公司或老板一定比没有这种人或有这种人而把牢骚埋在肚子里的公司要成功得多
    鼠标事件之JS
  • 原文地址:https://www.cnblogs.com/TheRoadToTheGold/p/8204699.html
Copyright © 2011-2022 走看看