Submission #10368590
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long; using PII = std::pair<int, int>; using PLL = std::pair<ll, ll>; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define rep2(i, s, n) for (int i = (s); i < (int)(n); i++) const int mod = 1e9 + 7; const string wsp = " "; const string tb = "\t"; const string rt = "\n"; int main() { #ifdef DEBUG cout << "DEBUG MODE" << endl; ifstream in("input.txt"); //for debug cin.rdbuf(in.rdbuf()); //for debug #endif const int m = 256; int n, l, x; cin >> n >> l; ll ans, p; vector<vector<ll>> bitdp(n + 1, vector<ll>(m, 0)); bitdp[0][0] = 1; rep(k, n) { cin >> x; rep(i, n) { rep(j, m) { bitdp[n - i][j ^ x] += bitdp[n - i - 1][j]; bitdp[n - i][j ^ x] %= mod; } } } ans = 0; p = 1; rep(i, n) { p *= i + 1; p %= mod; ans += (bitdp[i + 1][l] * p) % mod; ans %= mod; } cout << ans << rt; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Solving XOR-Puzzles |
User | ASTR1104 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1135 Byte |
Status | AC |
Exec Time | 7 ms |
Memory | 512 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 | 2 ms | 256 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 | 1 ms | 256 KB |
sub2_in2.txt | AC | 1 ms | 256 KB |
sub2_in3.txt | AC | 1 ms | 256 KB |
sub2_in4.txt | AC | 1 ms | 256 KB |
sub2_in5.txt | AC | 1 ms | 256 KB |
sub2_in6.txt | AC | 1 ms | 256 KB |
sub2_in7.txt | AC | 1 ms | 256 KB |
sub2_in8.txt | AC | 1 ms | 256 KB |
sub2_in9.txt | AC | 1 ms | 256 KB |
sub3_in1.txt | AC | 7 ms | 512 KB |
sub3_in2.txt | AC | 7 ms | 512 KB |
sub3_in3.txt | AC | 7 ms | 512 KB |
sub3_in4.txt | AC | 7 ms | 512 KB |
sub3_in5.txt | AC | 7 ms | 512 KB |
sub3_in6.txt | AC | 7 ms | 512 KB |
sub3_in7.txt | AC | 7 ms | 512 KB |
sub3_in8.txt | AC | 7 ms | 432 KB |
sub3_in9.txt | AC | 7 ms | 512 KB |