제출 #883561

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
883561		pragmatist	XOR Sum (info1cup17_xorsum)	C++17	7 / 100	1682 ms	10576 KiB

xorsum

#include<iostream>
#include<cassert>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<vector>
#include<stack>
#include<set>
#include<queue>
#include<map>

using namespace std;

const int N = (int)1e6 + 7;
const int M = (int)1e6 + 7;
const int inf = (int)1e9 + 7;
const int MOD = (int)998244353;
const long long INF = (long long)1e18 + 7; 

int mult(int x, int y) {
	return 1ll*x*y%MOD;
}

int sum(int x, int y) {
	x += y;
	if(x >= MOD) {
		x -= MOD;
	}
	return x;
}

int sub(int x, int y) {
	x -= y;
	if(x < 0) {
		x += MOD;
	}
	return x;
}

int n, a[N], b[N];

long long f(int l, int r) {
	long long cur = 0;
	for(int i = 1; i <= n; ++i) {
		for(int j = 1; j <= i; ++j) {
			if(a[i] + a[j] >= l && a[i] + a[j] <= r) {
				cur++;
			}
		}
	}
	return cur;
}

int main() {	
	ios_base::sync_with_stdio(NULL);
	cin.tie(0);
	cin >> n;
	for(int i = 1; i <= n; ++i) {
		cin >> a[i];
	}
	int ans = 0;
	for(int j = 29; j >= 0; --j) {
		long long cur = f((1 << j), (1 << (j+1))-1) + f((1 << j) + (1 << (j+1)), (1 << (j+2))-1);
		for(int i = 1; i <= n; ++i) {
			if(a[i] >> j & 1) {
				a[i] ^= (1 << j);
			}
		}
		if(cur&1) {
			ans |= (1 << j);
		}
	}
	cout << ans << "\n";
	return 0;
}

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