# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
551131 | Olympia | XOR Sum (info1cup17_xorsum) | C++98 | 1689 ms | 4180 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <iomanip>
#include <algorithm>
#include <cassert>
#include <map>
#include <complex>
#include <cmath>
#include <set>
#include <queue>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
int64_t res (vector<int>& a, int x) {
//how many are <= x
int64_t r = a.size() - 1;
int64_t ans = 0;
for (int i = 0; i < a.size(); i++) {
if (a[i] + a[0] > x) {
break;
}
while (a[r] + a[i] > x) {
r--;
}
ans += abs(r) + 1 - (r >= i);
}
ans /= 2;
for (int i = 0; i < a.size(); i++) {
ans += (2 * a[i] <= x);
}
return ans;
}
int64_t res (vector<int>& a, int l, int r) {
return res(a, r) - res(a, l - 1);
}
int main () {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n; cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int64_t ans = 0;
for (int b = 30; b >= 0; b--) {
for (int i = 0; i < v.size(); i++) {
v[i] = v[i] & ((1 << (b + 1)) - 1);
}
sort(v.begin(), v.end());
int64_t r = 0;
r += res(v, (1 << b), (1 << (b + 1)) - 1);
r += res(v, (1 << b) + (1 << (b + 1)), (1 << (b + 2)) - 1);
ans += ((int64_t)1 << b) * (r % 2);
}
cout << ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |