给定两个长度为N的整数序列a和b，计算所有ai+bj的XOR值。通过按位操作和二分查找优化算法，避免暴力解法。对于每个bi，对2的幂取余，然后检查加法结果对应位是否为1，根据出现次数确定最终XOR结果的相应位。
You are given two integer sequences, each of length N: a1,…,aN and b1,…,bN.
There are N2 ways to choose two integers i and j such that 1≤i,j≤N. For each of these N2 pairs, we will compute ai+bj and write it on a sheet of paper. That is, we will write N2 integers in total.
Compute the XOR of these N2 integers.
Definition of XOR
Constraints
- All input values are integers.
- 1≤N≤200,000
- 0≤ai,bi<228
Input
Input is given from Standard Input in the following format:
N
a1 a2 … aN
b1 b2 … bN
Output
Print the result of the computation.
Sample Input 1
最低0.47元/天 解锁文章
620
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
