Submission #2871137

---

Source Code Expand

from bisect import *

def read():
  return int(input())

def reads():
  return [int(x) for x in input().split()]

N = read()
A = reads()
B = reads()

D = 28
xor = 0
for d in range(D + 1):
  mask = (1 << (d + 1)) - 1 # [1] * (d+1)
  BB = sorted(x & mask for x in B)
  count = 0
  for a in (x & mask for x in A):
    count += bisect_left(BB, (1 << (d + 1)) - a) - bisect_left(BB, (1 << d) - a)
    count += bisect_left(BB, (1 << (d + 2)) - a) - bisect_left(BB, (1 << d) + (1 << (d + 1)) - a)
  if count & 1:
    xor |= 1 << d

print(xor)

Submission Info

Judge Result