Submission #11458617

---

Source Code Expand

n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a = a + a[:-1]

da = [a[i] ^ a[i+1] for i in range(len(a) - 1)]
db = [b[i] ^ b[i+1] for i in range(len(b) - 1)]


fail = [0 for i in range(len(da))]
fail[0] = -1
p = 0
for q in range(2, len(da)):
    while p >= 0 and da[q-1] != da[p]:
        p = fail[p]
    p += 1
    fail[q] = p

p = 0
q = 0
while p + q < len(da):
    if db[q] == da[p+q]:
        if q == len(db) - 1:
            print(p, a[p] ^ b[0])
            p += q - fail[q]
            q = fail[q]
        else:
            q += 1
    else:
        p += q - fail[q]
        if q > 0:
            q = fail[q]

Submission Info

Judge Result