# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1009546 | hahahoang132 | XOR Sum (info1cup17_xorsum) | C++17 | 783 ms | 47304 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>
#define ll long long
#define task " "
using namespace std;
const ll N = 1e6 + 5;
const ll mod = 1e9 + 7;
#define bit(x,y) ((x >> y) & 1)
ll a[N],b[N];
pair<ll,int> tmp[N],ntmp[N];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
ll i,j;
for(i = 1;i <= n;i++) cin >> a[i];
ll ans = 0;
for(ll id = 0;id <= 30;id++)
{
if(id == 0)
{
for(i = 1;i <= n;i++) tmp[i] = {(a[i] % (1LL << (id + 1))),i};
sort(tmp + 1,tmp + 1 + n);
}else
{
ll sus = 1;
for(i = 1;i <= n;i++)
{
if(!bit(a[tmp[i].second],id))
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... |