Submission #2865750
Source Code Expand
#include<bits/stdc++.h> #define ALL(c) (c).begin(),(c).end() #define EACH(i,c) for(auto i=(c).begin();i!=(c).end();++i) using namespace std; int main(){ int N; cin >> N; vector<int> a(N), b(N); for(int i = 0; i < N; ++i) { cin >> a[i]; } for(int i = 0; i < N; ++i){ cin >> b[i]; } int res = 0; for(int k = 1; k <= 30; ++k) { long long M = 1LL << k; vector<int> bb(N); for(int i = 0; i < N; ++i) { bb[i] = b[i] % M; } sort(ALL(bb)); int cnt = 0; for(int i = 0; i < N; ++i) { int aa = a[i] % M; cnt += (lower_bound(ALL(bb), M - aa) - lower_bound(ALL(bb), M / 2 - aa)) + (lower_bound(ALL(bb), 2 * M - aa) - lower_bound(ALL(bb), 3 * M / 2 - aa)); } res |= (cnt % 2) << (k-1); } cout << res << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Two Sequences |
User | blue_jam |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 789 Byte |
Status | WA |
Exec Time | 2070 ms |
Memory | 2688 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 500 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example_0, example_1, example_2, example_3 |
All | N100000_0, N100000_1, N150000_0, N150000_1, N200000_0, N200000_1, N200000_ex_0, N200000_ex_1, example_0, example_1, example_2, example_3, rand_0, rand_1, smallrand_0, smallrand_1 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
N100000_0 | AC | 942 ms | 1408 KB |
N100000_1 | AC | 944 ms | 1408 KB |
N150000_0 | WA | 1506 ms | 2048 KB |
N150000_1 | WA | 1502 ms | 2048 KB |
N200000_0 | WA | 2070 ms | 2560 KB |
N200000_1 | WA | 2064 ms | 2560 KB |
N200000_ex_0 | WA | 1958 ms | 2688 KB |
N200000_ex_1 | WA | 1959 ms | 2560 KB |
example_0 | AC | 1 ms | 256 KB |
example_1 | AC | 1 ms | 256 KB |
example_2 | AC | 1 ms | 256 KB |
example_3 | AC | 1 ms | 256 KB |
rand_0 | AC | 47 ms | 256 KB |
rand_1 | AC | 104 ms | 384 KB |
smallrand_0 | AC | 1 ms | 256 KB |
smallrand_1 | AC | 1 ms | 256 KB |