Submission #1822207

---

Source Code Expand

// 基本テンプレート

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

typedef pair<int, int> pii;
typedef long long ll;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;

const int S = 100010;
int a[S], mbit[S];
int dp[2][S];

signed main() {
    int N, K; cin >> N >> K;
    rep(i,0,N) {
        cin >> a[i];
    }
    sort(a, a+N);
    rep(i,0,N) {
        int p = a[i], tmp = 0;
        while(p) {
            tmp++;
            p >>= 1LL;
        }
        mbit[i] = tmp;
        // printf("mbit[%lld] = %lld\n", i, tmp);
    }

    dp[0][0] = 1;
    rep(i,0,N) {
        int mo = i % 2;
        rep(bit,0,1LL<<mbit[i]) {
            // do not use
            (dp[mo^1][bit] += dp[mo][bit]) %= MOD;

            // use
            (dp[mo^1][bit ^ a[i]] += dp[mo][bit]) %= MOD;
        }
        // rep(k,0,1LL<<(mbit[i])) printf("dp[%lld][%lld] = %lld\n", i+1, k, dp[mo^1][k]);
        memset(dp[mo], 0, sizeof(dp[mo]));
    }
    cout << dp[N%2][K] << endl;
    return 0;
}

Submission Info

Judge Result