Submission #10240615
Source Code Expand
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
template <typename T> using posteriority_queue = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
template <typename T> void unique(vector<T> &a) { a.erase(unique(ALL(a)), a.end()); }
struct IOSetup {
IOSetup() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} iosetup;
int mod = MOD;
struct ModInt {
unsigned val;
ModInt(): val(0) {}
ModInt(ll x) : val(x >= 0 ? x % mod : x % mod + mod) {}
ModInt pow(ll exponent) {
ModInt tmp = *this, res = 1;
while (exponent > 0) {
if (exponent & 1) res *= tmp;
tmp *= tmp;
exponent >>= 1;
}
return res;
}
ModInt &operator+=(const ModInt &x) { if((val += x.val) >= mod) val -= mod; return *this; }
ModInt &operator-=(const ModInt &x) { if((val += mod - x.val) >= mod) val -= mod; return *this; }
ModInt &operator*=(const ModInt &x) { val = static_cast<unsigned long long>(val) * x.val % mod; return *this; }
ModInt &operator/=(const ModInt &x) {
// assert(__gcd(static_cast<int>(x.val), mod) == 1);
unsigned a = x.val, b = mod; int u = 1, v = 0;
while (b) {
unsigned tmp = a / b;
swap(a -= tmp * b, b);
swap(u -= tmp * v, v);
}
return *this *= u;
}
bool operator==(const ModInt &x) const { return val == x.val; }
bool operator!=(const ModInt &x) const { return val != x.val; }
bool operator<(const ModInt &x) const { return val < x.val; }
bool operator<=(const ModInt &x) const { return val <= x.val; }
bool operator>(const ModInt &x) const { return val > x.val; }
bool operator>=(const ModInt &x) const { return val >= x.val; }
ModInt &operator++() { if (++val == mod) val = 0; return *this; }
ModInt operator++(int) { ModInt res = *this; ++*this; return res; }
ModInt &operator--() { val = (val == 0 ? mod : val) - 1; return *this; }
ModInt operator--(int) { ModInt res = *this; --*this; return res; }
ModInt operator+() const { return *this; }
ModInt operator-() const { return ModInt(val ? mod - val : 0); }
ModInt operator+(const ModInt &x) const { return ModInt(*this) += x; }
ModInt operator-(const ModInt &x) const { return ModInt(*this) -= x; }
ModInt operator*(const ModInt &x) const { return ModInt(*this) *= x; }
ModInt operator/(const ModInt &x) const { return ModInt(*this) /= x; }
friend ostream &operator<<(ostream &os, const ModInt &x) { return os << x.val; }
friend istream &operator>>(istream &is, ModInt &x) { ll val; is >> val; x = ModInt(val); return is; }
};
ModInt abs(const ModInt &x) { return x; }
struct Combinatorics {
int val; // "val!" and "mod" must be disjoint.
vector<ModInt> fact, fact_inv, inv;
Combinatorics(int val = 10000000) : val(val), fact(val + 1), fact_inv(val + 1), inv(val + 1) {
fact[0] = 1;
FOR(i, 1, val + 1) fact[i] = fact[i - 1] * i;
fact_inv[val] = ModInt(1) / fact[val];
for (int i = val; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i;
FOR(i, 1, val + 1) inv[i] = fact[i - 1] * fact_inv[i];
}
ModInt nCk(int n, int k) {
if (n < 0 || n < k || k < 0) return ModInt(0);
// assert(n <= val && k <= val);
return fact[n] * fact_inv[k] * fact_inv[n - k];
}
ModInt nPk(int n, int k) {
if (n < 0 || n < k || k < 0) return ModInt(0);
// assert(n <= val);
return fact[n] * fact_inv[n - k];
}
ModInt nHk(int n, int k) {
if (n < 0 || k < 0) return ModInt(0);
return (k == 0 ? ModInt(1) : nCk(n + k - 1, k));
}
};
int main() {
int n, k; cin >> n >> k;
Combinatorics com(n);
map<pair<int, int>, ModInt> mp;
mp[{0, 0}] = 1;
REP(_, n) {
int a; cin >> a;
map<pair<int, int>, ModInt> nx;
for (auto pr : mp) {
nx[{pr.first.first, pr.first.second}] += pr.second;
nx[{a ^ pr.first.first, pr.first.second + 1}] += pr.second;
}
mp.swap(nx);
}
// for (auto pr : mp) cout << pr.first.first << ' ' << pr.first.second << ' ' << pr.second << '\n';
ModInt ans = 0;
REP(i, n + 1) ans += mp[{k, i}] * com.fact[i];
cout << ans << '\n';
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Solving XOR-Puzzles |
User |
emthrm |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
4832 Byte |
Status |
AC |
Exec Time |
300 ms |
Memory |
3328 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Subtask3 |
Score / Max Score |
0 / 0 |
50 / 50 |
170 / 170 |
180 / 180 |
Status |
|
|
|
|
Set Name |
Test Cases |
Sample |
sample_1.txt, sample_2.txt, sample_4.txt |
Subtask1 |
sample_1.txt, sample_2.txt, sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub1_in4.txt, sub1_in5.txt, sub1_in6.txt, sub1_in7.txt |
Subtask2 |
sample_1.txt, sample_2.txt, sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub1_in4.txt, sub1_in5.txt, sub1_in6.txt, sub1_in7.txt, sub2_in1.txt, sub2_in2.txt, sub2_in3.txt, sub2_in4.txt, sub2_in5.txt, sub2_in6.txt, sub2_in7.txt, sub2_in8.txt, sub2_in9.txt |
Subtask3 |
sample_1.txt, sample_2.txt, sample_4.txt, sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub1_in4.txt, sub1_in5.txt, sub1_in6.txt, sub1_in7.txt, sub2_in1.txt, sub2_in2.txt, sub2_in3.txt, sub2_in4.txt, sub2_in5.txt, sub2_in6.txt, sub2_in7.txt, sub2_in8.txt, sub2_in9.txt, sub3_in1.txt, sub3_in2.txt, sub3_in3.txt, sub3_in4.txt, sub3_in5.txt, sub3_in6.txt, sub3_in7.txt, sub3_in8.txt, sub3_in9.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_1.txt |
AC |
1 ms |
256 KB |
sample_2.txt |
AC |
1 ms |
256 KB |
sample_4.txt |
AC |
6 ms |
640 KB |
sub1_in1.txt |
AC |
1 ms |
256 KB |
sub1_in2.txt |
AC |
1 ms |
256 KB |
sub1_in3.txt |
AC |
1 ms |
256 KB |
sub1_in4.txt |
AC |
1 ms |
256 KB |
sub1_in5.txt |
AC |
1 ms |
256 KB |
sub1_in6.txt |
AC |
1 ms |
256 KB |
sub1_in7.txt |
AC |
1 ms |
256 KB |
sub2_in1.txt |
AC |
7 ms |
768 KB |
sub2_in2.txt |
AC |
7 ms |
768 KB |
sub2_in3.txt |
AC |
7 ms |
768 KB |
sub2_in4.txt |
AC |
7 ms |
768 KB |
sub2_in5.txt |
AC |
6 ms |
768 KB |
sub2_in6.txt |
AC |
7 ms |
768 KB |
sub2_in7.txt |
AC |
7 ms |
768 KB |
sub2_in8.txt |
AC |
7 ms |
768 KB |
sub2_in9.txt |
AC |
7 ms |
768 KB |
sub3_in1.txt |
AC |
300 ms |
3328 KB |
sub3_in2.txt |
AC |
299 ms |
3328 KB |
sub3_in3.txt |
AC |
298 ms |
3328 KB |
sub3_in4.txt |
AC |
298 ms |
3328 KB |
sub3_in5.txt |
AC |
298 ms |
3328 KB |
sub3_in6.txt |
AC |
299 ms |
3328 KB |
sub3_in7.txt |
AC |
300 ms |
3328 KB |
sub3_in8.txt |
AC |
297 ms |
3328 KB |
sub3_in9.txt |
AC |
300 ms |
3328 KB |