TZOJ 5962 Happy Matt Friends(计数DP)

描述

Matt hzs N friends. They are playing a game together.

Each of Matt’s friends has a magic number. In the game, Matt selects some (could be zero) of his friends. If the xor (exclusive-or) sum of the selected friends’magic numbers is no less than M , Matt wins.
Matt wants to know the number of ways to win.

输入

The first line contains only one integer T , which indicates the number of test cases.
For each test case, the first line contains two integers N, M (1 ≤ N ≤ 40, 0 ≤ M ≤ 106).
In the second line, there are N integers ki (0 ≤ ki ≤ 106), indicating the i-th friend’s magic number.

输出

For each test case, output a single line “Case #x: y”, where x is the case number (starting from 1) and y indicates the number of ways where Matt can win.

样例输入

2
3 2
1 2 3
3 3
1 2 3

样例输出

Case #1: 4
Case #2: 2

提示

In the first sample, Matt can win by selecting:

friend with number 1 and friend with number 2. The xor sum is 3.

friend with number 1 and friend with number 3. The xor sum is 2.

friend with number 2. The xor sum is 2.

friend with number 3. The xor sum is 3. Hence, the answer is 4.

题意

N个数选择任意个数求异或和大于M的方案数。

题解

计数DP。

dp[i][j]代表第i个物品异或和为j的方案数。

显然dp[i][j]=dp[i-1][j]+dp[i-1][j^a[i]]（不装i或者装i）。

由于j高达1e6，所以需要滚动一维i。

代码

 #include<bits/stdc++.h>
 using namespace std;

 #define LL long long
 LL dp[][<<];
 int main()
 {
     ios::sync_with_stdio(false),cin.tie(),cout.tie();
     int t,n,m,ca=,a[];
     cin>>t;
     while(t--)
     {
         cin>>n>>m;
         int mx=;
         for(int i=;i<=n;i++)cin>>a[i],mx=max(mx,a[i]);
         int sta=;
         while(sta<=mx)sta<<=;
         for(int i=;i<sta;i++)dp[][i]=dp[][i]=;
         dp[][]=;
         int cur=;
         for(int i=;i<=n;i++,cur^=)
         {
             for(int j=;j<sta;j++)
                 dp[cur][j]=dp[cur^][j]+dp[cur^][j^a[i]];
             for(int j=;j<sta;j++)
                 dp[cur^][j]=;
         }
         LL sum=;
         for(int i=m;i<sta;i++)sum+=dp[cur^][i];
         cout<<"Case #"<<ca++<<": "<<sum<<endl;
     }
     return ;
 }