题意: 给定
n
n
n个数
k
i
k_i
ki,从中选取任意个(可以为
0
0
0)进行异或得到
a
n
s
ans
ans,问有多少种
a
n
s
≥
m
ans\geq m
ans≥m。
数据范围:
1
≤
n
≤
40
,
0
≤
k
i
≤
1
0
6
,
m
≤
1
0
6
1\leq n \leq 40, 0\leq k_i\leq 10^6,m\leq 10^6
1≤n≤40,0≤ki≤106,m≤106
题解:
f
[
i
]
[
j
]
f[i][j]
f[i][j]表示选前
i
i
i个数得到异或结果为
j
j
j的数量,状态转移为为
f
[
i
]
[
j
]
=
f
[
i
−
1
]
[
j
]
+
f
[
i
−
1
]
[
j
∧
k
i
]
f[i][j]=f[i-1][j]+f[i-1][j \wedge k_i]
f[i][j]=f[i−1][j]+f[i−1][j∧ki]
由于只与前一个状态有关,所以仍然可以用模
2
2
2来进行当前状态和上一状态的区分。
代码:
#include<cstdio>
#include<cstring>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<algorithm>
#include<iostream>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
while(ch >= '0' && ch <= '9') {x = x * 10 + ch - '0'; ch = getchar();}
return x * f;
}
const int N = 40 + 10, M = 1 << 20;
int f[2][M];
long long solve() {
memset(f, 0, sizeof f);
int n = read(), m = read();
f[0][0] = 1;
for(int i = 1; i <= n; ++i) {
int x = read();
for(int j = 0; j < M; ++j)
f[i & 1][j] = f[(i - 1) & 1][j] + f[(i - 1) & 1][j ^ x];
}
long long res = 1ll << n;
for(int j = 0; j < m; ++j) res -= f[n & 1][j];
return res;
}
int main()
{
int T = read();
for(int i = 1; i <= T; ++i) {
printf("Case #%d: %lld\n", i, solve());
}
return 0;
}