結果
| 問題 | No.1142 XOR と XOR |
| ユーザー |
 Shuz*
|
| 提出日時 | 2020-07-31 22:11:12 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,327 bytes |
| コンパイル時間 | 1,545 ms |
| コンパイル使用メモリ | 177,184 KB |
| 実行使用メモリ | 6,940 KB |
| 最終ジャッジ日時 | 2024-07-06 18:26:38 |
| 合計ジャッジ時間 | 6,842 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
5,248 KB |
| testcase_01 | AC | 2 ms
5,376 KB |
| testcase_02 | AC | 2 ms
5,376 KB |
| testcase_03 | WA | - |
| testcase_04 | AC | 233 ms
5,888 KB |
| testcase_05 | AC | 207 ms
5,376 KB |
| testcase_06 | AC | 243 ms
6,016 KB |
| testcase_07 | AC | 286 ms
6,656 KB |
| testcase_08 | AC | 295 ms
6,528 KB |
| testcase_09 | AC | 295 ms
6,656 KB |
| testcase_10 | AC | 290 ms
6,656 KB |
| testcase_11 | AC | 1 ms
5,376 KB |
| testcase_12 | AC | 2 ms
5,376 KB |
| testcase_13 | AC | 2 ms
5,376 KB |
| testcase_14 | AC | 163 ms
5,376 KB |
| testcase_15 | AC | 152 ms
5,376 KB |
| testcase_16 | AC | 14 ms
5,376 KB |
| testcase_17 | WA | - |
| testcase_18 | AC | 48 ms
5,376 KB |
| testcase_19 | AC | 234 ms
6,016 KB |
| testcase_20 | AC | 150 ms
5,376 KB |
| testcase_21 | AC | 95 ms
5,376 KB |
| testcase_22 | AC | 54 ms
5,376 KB |
| testcase_23 | AC | 221 ms
5,760 KB |
| testcase_24 | AC | 247 ms
6,144 KB |
| testcase_25 | AC | 146 ms
5,376 KB |
| testcase_26 | WA | - |
| testcase_27 | WA | - |
ソースコード
#include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define rt(i, n) (i == (ll)(n) -1 ? rt : sp)
#define len(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define ifn(x) if (not(x))
#define elif else if
#define elifn else ifn
#define fi first
#define se second
#define uniq(x) (sort(all(x)), (x).erase(unique(all(x)), (x).end()))
using graph = vector<vector<ll>>;
template <class T> using wgraph = vector<vector<ll, T>>;
bool __DIRECTED__ = true;
istream &operator>>(istream &is, graph &g) {
ll a, b;
is >> a >> b;
g[a - 1].pb(b - 1);
if (__DIRECTED__ == false) g[b - 1].pb(a - 1);
return is;
}
template <class T> istream &operator>>(istream &is, wgraph<T> &g) {
ll a, b;
T c;
is >> a >> b >> c;
g[a - 1].pb({b - 1, c});
if (__DIRECTED__ == false) g[b - 1].pb({a - 1, c});
return is;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// Debug
#define debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&X : {__VA_ARGS__}) cerr << "[" << X << "] "; \
cerr << rt; \
}
#define dump(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << rt; \
rep(_i, h) { \
rep(_j, w) { \
if (abs(a[_i][_j]) >= INF / 2 and a[_i][_j] <= -INF / 2) \
cerr << '-'; \
if (abs(a[_i][_j]) >= INF / 2) \
cerr << "∞" << sp; \
else \
cerr << a[_i][_j] << sp; \
} \
cerr << rt; \
} \
cerr << "]" << rt; \
}
#define vdump(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(_i, n) { \
if (_i) cerr << sp; \
if (abs(a[_i]) >= INF / 2 and a[_i] <= -INF / 2) cerr << '-'; \
if (abs(a[_i]) >= INF / 2) \
cerr << "∞" << sp; \
else \
cerr << a[_i]; \
} \
cerr << "]" << rt; \
}
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)
// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;
// Speed
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native,arch=skylake-avx512")
// Math
inline constexpr ll gcd(const ll a, const ll b) {
return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
inline constexpr ll modulo(const ll n, const ll m = MOD) {
ll k = n % m;
return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
n %= m;
return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
ll r = 1;
rep(i, 64) {
if (n & (1LL << i)) r *= a;
chmod(r, m);
a *= a;
chmod(a, m);
}
return r;
}
inline ll inv(const ll n, const ll m = MOD) {
ll a = n, b = m, x = 1, y = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return modulo(x, m);
}
ll C[1024][2], D[1024][2];
signed main() {
ll N, M, K;
cin >> N >> M >> K;
ll A[N + 1], B[M + 1];
A[0] = B[0] = 0;
rep(i, N) cin >> A[i + 1], A[i + 1] ^= A[i];
rep(i, M) cin >> B[i + 1], B[i + 1] ^= B[i];
rep(i, N + 1) C[A[i]][0]++;
rep(i, N + 1) rep(j, 1024) C[A[i] ^ j][1] += C[j][0];
rep(i, M + 1) D[B[i]][0]++;
rep(i, M + 1) rep(j, 1024) D[B[i] ^ j][1] += D[j][0];
C[0][1] -= N + 1, D[0][1] -= M + 1;
ll res = 0;
rep(i, 1024) res += C[i][1] / 2 % MOD * D[i ^ K][1] / 2 % MOD;
cout << res % MOD << rt;
}