結果
問題 | No.1210 XOR Grid |
ユーザー | m_tsubasa |
提出日時 | 2020-08-30 16:23:51 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 349 ms / 2,000 ms |
コード長 | 3,316 bytes |
コンパイル時間 | 2,194 ms |
コンパイル使用メモリ | 208,636 KB |
実行使用メモリ | 65,076 KB |
最終ジャッジ日時 | 2024-04-27 10:04:03 |
合計ジャッジ時間 | 13,102 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 77 ms
61,800 KB |
testcase_01 | AC | 81 ms
61,920 KB |
testcase_02 | AC | 77 ms
61,808 KB |
testcase_03 | AC | 79 ms
61,884 KB |
testcase_04 | AC | 80 ms
61,812 KB |
testcase_05 | AC | 80 ms
61,804 KB |
testcase_06 | AC | 78 ms
61,908 KB |
testcase_07 | AC | 83 ms
61,744 KB |
testcase_08 | AC | 82 ms
61,836 KB |
testcase_09 | AC | 81 ms
61,760 KB |
testcase_10 | AC | 82 ms
61,748 KB |
testcase_11 | AC | 83 ms
61,988 KB |
testcase_12 | AC | 79 ms
61,748 KB |
testcase_13 | AC | 78 ms
61,768 KB |
testcase_14 | AC | 77 ms
61,924 KB |
testcase_15 | AC | 78 ms
61,764 KB |
testcase_16 | AC | 79 ms
61,804 KB |
testcase_17 | AC | 77 ms
61,748 KB |
testcase_18 | AC | 85 ms
61,760 KB |
testcase_19 | AC | 79 ms
61,768 KB |
testcase_20 | AC | 81 ms
61,904 KB |
testcase_21 | AC | 80 ms
61,752 KB |
testcase_22 | AC | 78 ms
61,916 KB |
testcase_23 | AC | 79 ms
61,812 KB |
testcase_24 | AC | 79 ms
61,884 KB |
testcase_25 | AC | 207 ms
63,324 KB |
testcase_26 | AC | 207 ms
63,448 KB |
testcase_27 | AC | 202 ms
63,456 KB |
testcase_28 | AC | 208 ms
63,392 KB |
testcase_29 | AC | 199 ms
63,328 KB |
testcase_30 | AC | 171 ms
63,236 KB |
testcase_31 | AC | 199 ms
63,528 KB |
testcase_32 | AC | 195 ms
63,336 KB |
testcase_33 | AC | 78 ms
61,884 KB |
testcase_34 | AC | 77 ms
61,808 KB |
testcase_35 | AC | 77 ms
61,800 KB |
testcase_36 | AC | 112 ms
63,412 KB |
testcase_37 | AC | 110 ms
63,364 KB |
testcase_38 | AC | 109 ms
63,468 KB |
testcase_39 | AC | 108 ms
63,340 KB |
testcase_40 | AC | 146 ms
64,908 KB |
testcase_41 | AC | 151 ms
64,864 KB |
testcase_42 | AC | 328 ms
64,884 KB |
testcase_43 | AC | 291 ms
64,948 KB |
testcase_44 | AC | 349 ms
65,024 KB |
testcase_45 | AC | 327 ms
64,884 KB |
testcase_46 | AC | 320 ms
65,040 KB |
testcase_47 | AC | 135 ms
65,000 KB |
testcase_48 | AC | 131 ms
65,076 KB |
testcase_49 | AC | 77 ms
61,880 KB |
testcase_50 | AC | 187 ms
65,044 KB |
testcase_51 | AC | 312 ms
64,888 KB |
testcase_52 | AC | 274 ms
64,700 KB |
testcase_53 | AC | 313 ms
64,908 KB |
testcase_54 | AC | 132 ms
65,044 KB |
testcase_55 | AC | 215 ms
64,992 KB |
testcase_56 | AC | 196 ms
63,484 KB |
testcase_57 | AC | 199 ms
64,468 KB |
testcase_58 | AC | 78 ms
61,772 KB |
testcase_59 | AC | 78 ms
61,856 KB |
ソースコード
#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 r ModInt<> 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; }