# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
410484 | nichke | XOR Sum (info1cup17_xorsum) | C++14 | 826 ms | 57828 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;
#define int long long
#define endl '\n'
int n, res;
int ar[1000006];
int tar[1000006];
vector< pair<int, int> > tmp, cur;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ar[i];
tmp.push_back({ar[i], 0});
}
for (int j = 0; j < 31; j++) {
for (auto i : tmp) {
if (i.first & (1 << j)) continue;
cur.push_back(i);
}
for (auto i : tmp) {
if (i.first & (1 << j)) {
cur.push_back({i.first, i.second + (1 << j)});
}
}
int p1, p2, p3, sum = 0;
# | 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... |