結果
問題 | No.1210 XOR Grid |
ユーザー |
![]() |
提出日時 | 2020-08-30 16:23:51 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 408 ms / 2,000 ms |
コード長 | 3,316 bytes |
コンパイル時間 | 2,130 ms |
コンパイル使用メモリ | 198,228 KB |
最終ジャッジ日時 | 2025-01-13 23:56:11 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 57 |
ソースコード
#include <bits/stdc++.h>using namespace std;template <int mod = (int)(1e9 + 7)>struct ModInt {int x;ModInt() : x(0) {}ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}ModInt &operator+=(const ModInt &p) {if ((x += p.x) >= mod) x -= mod;return *this;}ModInt &operator-=(const ModInt &p) {if ((x += mod - p.x) >= mod) x -= mod;return *this;}ModInt &operator*=(const ModInt &p) {x = (int)(1LL * x * p.x % mod);return *this;}ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}ModInt operator-() const { return ModInt(-x); }ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }bool operator==(const ModInt &p) const { return x == p.x; }bool operator!=(const ModInt &p) const { return x != p.x; }ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;while (b > 0) {t = a / b;swap(a -= t * b, b);swap(u -= t * v, v);}return ModInt(u);}ModInt pow(int64_t n) const {ModInt res(1), mul(x);while (n) {if (n & 1) res *= mul;mul *= mul;n >>= 1;}return res;}friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }friend istream &operator>>(istream &is, ModInt &a) {int64_t t;is >> t;a = ModInt<mod>(t);return (is);}static int get_mod() { return mod; }};struct Combination {vector<ModInt<>> _fact, _rfact, _inv;Combination(long long nsize = 5000000): _fact(nsize + 1), _rfact(nsize + 1), _inv(nsize + 1) {_fact[0] = _rfact[nsize] = _inv[0] = 1;for (int i = 1; i <= nsize; i++) _fact[i] = _fact[i - 1] * i;_rfact[nsize] /= _fact[nsize];for (int i = nsize - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);for (int i = 1; i <= nsize; i++) _inv[i] = _rfact[i] * _fact[i - 1];}inline ModInt<> fact(int k) const { return _fact[k]; }inline ModInt<> rfact(int k) const { return _rfact[k]; }inline ModInt<> inv(int k) const { return _inv[k]; }ModInt<> P(int n, int r) const {if (r < 0 || n < r) return 0;return fact(n) * rfact(n - r);}ModInt<> C(int p, int q) const {if (q < 0 || p < q) return 0;return fact(p) * rfact(q) * rfact(p - q);}// n types,choose rModInt<> H(int n, int r) const {if (n < 0 || r < 0) return (0);return r == 0 ? 1 : C(n + r - 1, r);}};int n, m, x;vector<long long> a, b;Combination com;ModInt<> solve();int main() {cin >> n >> m >> x;a.resize(n);b.resize(m);for (auto &p : a) cin >> p;for (auto &p : b) cin >> p;cout << solve() << endl;return 0;}ModInt<> solve() {ModInt<> res = 0;{ModInt<> sum = 0;for (int i = 0; i <= m; i += 2) sum += com.C(m, i);res = sum.pow(n - 1);res = res.pow(x);}for (int bit = 0; bit < x; ++bit) {int ncnt = 0, mcnt = 0;for (auto p : a)if (p >> bit & 1) ++ncnt;for (auto p : b)if (p >> bit & 1) ++mcnt;if (((mcnt ^ ncnt) & 1)) return 0;}return res;}