Submission #496723

#	Time	Username	Problem	Language	Result	Execution time	Memory
496723		Ierus	XOR Sum (info1cup17_xorsum)	C++17	7 / 100	239 ms	8080 KiB

xorsum

#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize ("unroll-loops,Ofast,O3")
#pragma GCC target("avx,avx2,fma")
#define F first
#define S second
#define int long long
#define sz(x) (int)x.size()
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define NFS ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0) ;
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
const int E = (int)1e6+777;
const int N = (int)4e3;
int n, a[E];
void solve1(int res = 0){
	for(int i = 1; i <= n; ++i){
		for(int j = i; j <= n; ++j){
			res ^= (a[i] + a[j]);
		}
	}
	cout << res;
	exit(false);
}
void solve2(int res = 0){
	vector<int> cnt(N, 0);
	for(int i = 1; i <= n; ++i){
		++cnt[a[i]];
	}
	for(int i = 1; i <= N; ++i){
		for(int j = i; j <= N; ++j){
			int cur = min(cnt[i], cnt[j]);
			if(cur & 1) res ^= (i + j);
		}
	}
	cout << res;
	exit(false);
}
signed main(){
	cin >> n;
	for(int i = 1; i <= n; ++i){
		cin >> a[i];
	}
	if(n <= 4 * 1000){
		solve1();
	}
	solve2();
}

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