Submission #159321

#	Time	Username	Problem	Language	Result	Execution time	Memory
159321		mrtsima22	XOR Sum (info1cup17_xorsum)	C++17	0 / 100	1657 ms	8172 KiB

xorsum

#include <bits/stdc++.h>
using namespace std;
const int M=6;
int n,a[1000004],b[1000004];
int c[39],ans;
int main(){
for(int i=1;i<=M;i++){
	c[i]=(1<<(i+1))-1;
}
cin>>n;
for(int i=0;i<n;i++){
	cin>>a[i];
}
for(int i=1;i<=M;i++){
	for(int j=0;j<n;j++){
		b[j]=c[i]&a[j];
	}
	sort(b,b+n);
	int b1=(1<<(i));
	int b2=((1<<(i+1))-1);
	int B1=b1+(1<<(i+1));
	int B2=((1<<(i+2))-2);
	int k=0;
	for(int o=0;o<n;o++){
		for(int O=o;O<n;O++){
			int bo=b[O]+b[o];
//			cout<<bo<<" "<<b1<<" "<<b2<<" "<<B1<<" "<<B2<<endl;
			if((bo>=b1&&bo<=b2)||(bo>=B1&&bo<=B2)){
				k++;
			}
		}
	}
	if(k&1){
		ans|=(1<<(i));
	}
}
int k=0;
for(int i=0;i<n;i++){
	if(a[i]&1) k++;
}
if((k*(n-k))&1){
	ans++;
}
cout<<ans<<endl;

}

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