| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 872717 | racsosabe | XOR Sum (info1cup17_xorsum) | C++14 | 1639 ms | 35972 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<bits/stdc++.h>
using namespace::std;
const int N = 1000000 + 5;
int n;
int a[N];
vector<pair<int, int>> parse(vector<int> &v) {
int l = 0;
vector<pair<int, int>> res;
while(l < v.size()) {
int r = l;
while(r < v.size() and v[l] == v[r]) r += 1;
res.emplace_back(v[l], r - l);
l = r;
}
return res;
}
long long get_crossed(vector<pair<int, int>> &a, vector<pair<int, int>> &b, int m) {
int sum_a = 0, sum_b = 0;
for(auto x : a) sum_a += x.second;
for(auto x : b) sum_b += x.second;
long long res = 1ll * sum_a * sum_b;
int at = b.size() - 1;
int sum = 0;
for(auto x : a) {
if(x.first == 0) continue;
int want = m - x.first;
while(at >= 0 and b[at].first >= want) {
sum += b[at].second;
at -= 1;
}
res -= 1ll * x.second * sum;
}
return res;
}
long long get_pairs(vector<pair<int, int>> v, int m) {
vector<int> suffix_sum;
for(int i = 0; i < v.size(); i++) suffix_sum.emplace_back(v[i].second);
suffix_sum.emplace_back(0);
for(int i = (int)suffix_sum.size() - 2; i >= 0; i--) suffix_sum[i] += suffix_sum[i + 1];
long long res = 0;
int at = (int)v.size() - 1;
for(int i = 0; i < v.size(); i++) {
int want = m - v[i].first;
while(at >= 0 and v[at].first >= want) at -= 1;
int to = max(at, i) + 1;
res += 1ll * v[i].second * suffix_sum[to];
if((v[i].first << 1) >= m) res += 1ll * v[i].second * (v[i].second - 1) / 2;
}
return res;
}
long long get_bits(int b, int p) {
vector<int> ones;
vector<int> zeros;
for(int i = 0; i < n; i++) {
if(a[i] & p) ones.emplace_back(a[i] % p);
else zeros.emplace_back(a[i] % p);
}
sort(ones.begin(), ones.end());
sort(zeros.begin(), zeros.end());
vector<pair<int, int>> p_ones = parse(ones), p_zeros = parse(zeros);
long long res = get_crossed(p_ones, p_zeros, p);
if(not ones.empty()) res += get_pairs(p_ones, p);
if(not zeros.empty()) res += get_pairs(p_zeros, p);
return res;
}
int main(){
scanf("%d", &n);
int X = 0, O = 0;
for(int i = 0; i < n; i++) {
scanf("%d", a + i);
X ^= a[i] << 1;
O |= a[i] << 1;
}
int maxi = *max_element(a, a + n) << 1;
int l = 0;
while((1 << l) < maxi) l += 1;
for(int b = 0, p = 1; b < l; b++, p <<= 1) {
long long cnt = get_bits(b, p);
/* long long cnt2 = 0;
for(int i = 0; i < n; i++) {
for(int j = i + 1; j < n; j++) {
if((a[i] + a[j]) & p) cnt2 += 1;
}
}
cerr << p << " -> " << cnt << " vs " << cnt2 << endl;*/
if(cnt & 1) X ^= p;
if(cnt) O |= p;
}
printf("%d\n", X);
return 0;
}
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... | ||||
