結果
問題 | No.1142 XOR と XOR |
ユーザー | firiexp |
提出日時 | 2020-07-31 22:09:24 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 109 ms / 2,000 ms |
コード長 | 2,568 bytes |
コンパイル時間 | 1,391 ms |
コンパイル使用メモリ | 108,044 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-04-25 16:21:05 |
合計ジャッジ時間 | 3,892 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 7 ms
6,812 KB |
testcase_01 | AC | 6 ms
6,944 KB |
testcase_02 | AC | 6 ms
6,940 KB |
testcase_03 | AC | 109 ms
6,944 KB |
testcase_04 | AC | 75 ms
6,944 KB |
testcase_05 | AC | 62 ms
6,940 KB |
testcase_06 | AC | 77 ms
6,944 KB |
testcase_07 | AC | 66 ms
6,940 KB |
testcase_08 | AC | 92 ms
6,944 KB |
testcase_09 | AC | 92 ms
6,940 KB |
testcase_10 | AC | 93 ms
6,940 KB |
testcase_11 | AC | 6 ms
6,944 KB |
testcase_12 | AC | 6 ms
6,940 KB |
testcase_13 | AC | 6 ms
6,940 KB |
testcase_14 | AC | 52 ms
6,944 KB |
testcase_15 | AC | 52 ms
6,944 KB |
testcase_16 | AC | 9 ms
6,940 KB |
testcase_17 | AC | 52 ms
6,940 KB |
testcase_18 | AC | 16 ms
6,940 KB |
testcase_19 | AC | 76 ms
6,940 KB |
testcase_20 | AC | 51 ms
6,940 KB |
testcase_21 | AC | 33 ms
6,940 KB |
testcase_22 | AC | 22 ms
6,944 KB |
testcase_23 | AC | 70 ms
6,940 KB |
testcase_24 | AC | 80 ms
6,940 KB |
testcase_25 | AC | 49 ms
6,944 KB |
testcase_26 | AC | 76 ms
6,940 KB |
testcase_27 | AC | 62 ms
6,940 KB |
ソースコード
#include <iostream> #include <algorithm> #include <map> #include <set> #include <queue> #include <stack> #include <numeric> #include <bitset> #include <cmath> static const int MOD = 1000000007; using ll = long long; using u32 = unsigned; using u64 = unsigned long long; using namespace std; template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; template<u32 M = 1000000007> struct modint{ u32 val; modint(): val(0){} template<typename T> modint(T t){t %= (T)M; if(t < 0) t += (T)M; val = t;} modint pow(ll k) const { modint res(1), x(val); while(k){ if(k&1) res *= x; x *= x; k >>= 1; } return res; } template<typename T> modint& operator=(T t){t %= (T)M; if(t < 0) t += (T)M; val = t; return *this;} modint inv() const {return pow(M-2);} modint& operator+=(modint a){val += a.val; if(val >= M) val -= M; return *this;} modint& operator-=(modint a){if(val < a.val) val += M-a.val; else val -= a.val; return *this;} modint& operator*=(modint a){val = (u64)val*a.val%M; return *this;} modint& operator/=(modint a){return (*this) *= a.inv();} modint operator+(modint a) const {return modint(val) +=a;} modint operator-(modint a) const {return modint(val) -=a;} modint operator*(modint a) const {return modint(val) *=a;} modint operator/(modint a) const {return modint(val) /=a;} modint operator-(){return modint(M-val);} bool operator==(const modint a) const {return val == a.val;} bool operator!=(const modint a) const {return val != a.val;} bool operator<(const modint a) const {return val < a.val;} }; using mint = modint<MOD>; int main() { int n, m, k; cin >> n >> m >> k; vector<int> A(n+1), B(m+1); for (int i = 0; i < n; ++i) { cin >> A[i+1]; A[i+1] ^= A[i]; } for (int i = 0; i < m; ++i) { cin >> B[i+1]; B[i+1] ^= B[i]; } vector<mint> cnt(1024), dnt(1024); for (auto &&l : A) cnt[l] += 1; for (auto &&l : B) dnt[l] += 1; vector<mint> S(1024), T(1024); for (int i = 0; i < 1024; ++i) { for (int j = i; j < 1024; ++j) { if(i != j){ S[i^j] += cnt[i]*cnt[j]; T[i^j] += dnt[i]*dnt[j]; }else { S[0] += cnt[i]*(cnt[i]-1)/2; T[0] += dnt[i]*(dnt[i]-1)/2; } } } mint ans = 0; for (int i = 0; i < 1024; ++i) { ans += S[i]*T[i^k]; } cout << ans.val << "\n"; return 0; }