提出 #18186529

---

ソースコード 拡げる

#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
#include<cassert>
using namespace std;
#include<atcoder/all>
using namespace atcoder;


#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

using mint = modint1000000007;

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;
/////////////////////////////////////


int main() {
	ll N, K;
	cin >> N >> K;
	vll a(N + 1);
	repn(i, N)cin >> a[i];
	ll t = 0;
	repn(i, N)t += a[i];

	ll S = 1;
	while (S <= t) { S *= 2; }

	vll c(S);
	repn(i, N)c[a[i]]++;

	vmint dp(S, 0);
	dp[0] = 1;

	rep(i, S) {
		if (c[i] == 0) { continue; }

		mint p = (mint(2)).pow(c[i] - 1);

		vmint ndp(S + 1, 0);
		rep(j, S) {
			ndp[j] = (dp[j] + dp[j ^ i]) * p;
		}

		swap(dp, ndp);
	}

	cout << dp[K].val() << endl;
}

提出情報

ジャッジ結果