Submission #3784497

---

Source Code Expand

import bisect

n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))

#a = [1, 2]
#b = [3, 4]

#a = [4, 6, 0, 0, 3, 3]
#b = [0, 5, 6, 5, 0, 3]

#a = [1, 2, 3, 4, 5]
#b = [1, 2, 3, 4, 5]

#a = [0,]
#b = [0,]

ans = 0
for i in range(1, 28):
    c = 2 ** i
    half_c = c // 2
    temp_a = [a_num % c for a_num in a]
    temp_b = [b_num % c for b_num in b]
    temp_b = sorted(temp_b)
    counts = 0
    for a_num in temp_a:
        if a_num < half_c:
            bound1 = bisect.bisect_left(temp_b, half_c - a_num)
            bound2 = bisect.bisect_left(temp_b, c - a_num)
            counts += bound2 - bound1
        elif a_num == half_c:
            bound3 = bisect.bisect_left(temp_b, half_c)
            counts += bound3
        else:
            bound4 = bisect.bisect_left(temp_b, c - a_num)
            bound5 = bisect.bisect_left(temp_b, c + half_c - a_num)
            counts += len(temp_b) - bound5 + bound4

    if counts % 2 == 1:
        ans += half_c

print(ans)

Submission Info

Judge Result