Submission #497099

#	Time	Username	Problem	Language	Result	Execution time	Memory
497099		AQ0212	XOR Sum (info1cup17_xorsum)	C++17	45 / 100	1022 ms	2416 KiB

xorsum

#include <iostream>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <vector>
#include <string>
#include <sstream>
#include <cstring>
 
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse,-fgcse-lm")
#pragma GCC optimize("-ftree-pre,-ftree-vrp")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
 
#define ll long long int
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define all(x) x.begin(), x.end()
 
using namespace std;
 
ll ans, a[ 100111 ];
 
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
 
    ll n;
 
    cin >> n;
 
    for(int i = 1; i <= n; i ++){
        cin >> a[ i ];
    }
 	sort(a + 1, a+ 1 + n);
    for(int i = 1; i <= n; i ++){
        for(int j = i; j <= n; j ++){
            ans ^= (a[ i ] + a[ j ]);
        }
    }
 
    cout << ans;
}

• Subtask 1: 7 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 21
• Subtask 4: 38 / 38
• Subtask 5: 0 / 23