【HDU 6129 Just do it】& 数学推导

Just do it

Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 680 Accepted Submission(s): 385

Problem Description
There is a nonnegative integer sequence a1…n of length n. HazelFan wants to do a type of transformation called prefix-XOR, which means a1…n changes into b1…n, where bi equals to the XOR value of a1,…,ai. He will repeat it for m times, please tell him the final sequence.

Input
The first line contains a positive integer T(1≤T≤5), denoting the number of test cases.
For each test case:
The first line contains two positive integers n,m(1≤n≤2×105,1≤m≤109).
The second line contains n nonnegative integers a1…n(0≤ai≤230−1).

Output
For each test case:
A single line contains n nonnegative integers, denoting the final sequence.

Sample Input
2
1 1
1
3 3
1 2 3

Sample Output
1
1 3 1

Source
2017 Multi-University Training Contest - Team 7

题解 ： 有一个长度为n的整数序列{an}，对其做m次前缀异或和，求最终的序列。1 <= n <= 10^5,1 <= m <= 10^9,0 <= a_i <= 2^30 - 1
可以发现做m次后，位置为x的初始值对位置为y的最终值的贡献次数是一个只和m与y-x相关的组合式，而我们只关注这个次数的奇偶性。考虑Lucas定理，C(a,b)是奇数当且仅当把a,b二进制表达后b中1的位置是a中1的位置的子集，于是这里所有满足条件的b有很好的性质，对每一个二进制位独立处理就能算出答案。

标程 ：

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAX = 2e5 + 10;
typedef long long LL;
int a[MAX];
int main()
{
    int T;
    scanf("%d",&T);
    while(T--){
        int n,m;
        scanf("%d %d",&n,&m);
        for(int i = 1; i <= n; i++) scanf("%d",&a[i]);
        int o = 1; m--;
        while(o < n){
            for(int i = n; i > o; i--) a[i] ^= m & 1 ? 0 : a[i - o];
            o <<= 1,m >>= 1;
        }
        for(int i = 1; i <= n; i++) printf(i == n ? "%d\n" : "%d ",a[i]);
    }
    return 0;
}