Problem p02816 (python)

Fixed submission:
# -*- coding: utf-8 -*-
# import time
import sys
from collections import Counter, defaultdict
buff_readline = sys.stdin.buffer.readline
readline = sys.stdin.readline


def read_int():
    return int(buff_readline())


def read_int_n():
    return list(map(int, buff_readline().split()))

gpw = None


class RH():
    def __init__(self, s, base, mod):
        self.base = base
        self.mod = mod

        l = len(s)
        self.h = h = [0]*(l+1)
        tmp = 0
        for i in range(l):
            tmp = (tmp*base + s[i]) % mod
            h[i+1] = tmp

        global gpw
        if gpw is None:
            self.pw = pw = [1]*(len(s)+1)
            v = 1
            for i in range(l):
                pw[i+1] = v = v * base % mod
            gpw = pw
        else:
            self.pw = gpw

    def calc(self, l, r):
        return (self.h[r] - self.h[l] * self.pw[r-l]) % self.mod


def slv(N, A, B):
    L = max(max(A), max(B)).bit_length()
    ah = []
    bh = []
    bnh = []
    for i in range(L):
        ta = []
        tb = []
        tbn = []
        for a, b in zip(A, B):
            ta.append(a >> i & 1)
            tb.append(b >> i & 1)
            tbn.append(tb[-1] ^ 1)
        ah.append(RH(ta, 641, 10**9+7))
        bh.append(RH(tb, 641, 10**9+7))
        bnh.append(RH(tbn, 641, 10**9+7))

    ans = []
    x = [0] * N
    for i in range(L):
        for k in range(N):
            l = ah[i].calc(k, N)
            r = ah[i].calc(0, k)
            if x[k] is None:
                continue
            if l == bnh[i].calc(0, N-k) and r == bnh[i].calc(N-k, N):
                x[k] += 1 << i
            elif l == bh[i].calc(0, N-k) and r == bh[i].calc(N-k, N):
                pass
            else:
                x[k] = None
    for k, xx in enumerate(x):
        if xx is not None:
            ans.append('%d %d' % (k, xx))

    return ans


def main():
    N = read_int()
    A = read_int_n()
    B = read_int_n()
    print(*slv(N, A, B), sep='\n')

if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
# import time
import sys
from collections import Counter, defaultdict
buff_readline = sys.stdin.buffer.readline
readline = sys.stdin.readline


gpw = None


class RH():
    def __init__(self, s, base, mod):
        self.base = base
        self.mod = mod
        self.rev = pow(base, mod-2, mod)

        l = len(s)
        self.h = h = [0]*(l+1)
        tmp = 0
        for i in range(l):
            tmp = (tmp*base + s[i]) % mod
            h[i+1] = tmp

        global gpw
        if gpw is None:
            self.pw = pw = [1]*(len(s)+1)
            v = 1
            for i in range(l):
                pw[i+1] = v = v * base % mod
            gpw = pw
        else:
            self.pw = gpw

    def calc(self, l, r):
        return (self.h[r] - self.h[l] * self.pw[r-l]) % self.mod


def slv(N, A, B):
    L = max(max(A), max(B)).bit_length()
    ba = []
    bb = []
    ah = []
    bh = []
    bnh = []
    for i in range(L):
        ta = []
        tb = []
        tbn = []
        for a, b in zip(A, B):
            ta.append(a >> i & 1)
            tb.append(b >> i & 1)
            tbn.append(tb[-1] ^ 1)
        ba.append(ta)
        bb.append(tb)
        ah.append(RH(ta, 641, 10**9+7))
        bh.append(RH(tb, 641, 10**9+7))
        bnh.append(RH(tbn, 641, 10**9+7))

    ans = []
    for k in range(N):
        x = 0
        for i in range(L):
            l = ah[i].calc(k, N)
            r = ah[i].calc(0, k)
            if l == bh[i].calc(0, N-k) and r == bh[i].calc(N-k, N):
                pass
            elif l == bnh[i].calc(0, N-k) and r == bnh[i].calc(N-k, N):
                x += 1 << i
            else:
                break
        else:
            ans.append('%d %d' % (k, x))

    return ans


def main():
    N = int(input())
    A = list(map(int, buff_readline().split()))
    B = list(map(int, buff_readline().split()))
    print(*slv(N, A, B), sep='\n')

    # import random
    # N = 2 * 10**5
    # # A = [random.randint(0, 1 << 30) for _ in range(N)]
    # # B = [random.randint(0, 1 << 30) for _ in range(N)]
    # A = [2 ** 30 for _ in range(N)]
    # B = [2 ** 30 for _ in range(N)]
    # print(N)
    # print(*A)
    # print(*B)
    # # print(*slv(N, A, B), sep='\n')


if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
# import time
import sys
from collections import Counter, defaultdict
buff_readline = sys.stdin.buffer.readline
readline = sys.stdin.readline


gpw = None


class RH():
    def __init__(self, s, base, mod):
        self.base = base
        self.mod = mod
        self.rev = pow(base, mod-2, mod)

        l = len(s)
        self.h = h = [0]*(l+1)
        tmp = 0
        for i in range(l):
            tmp = (tmp*base + s[i]) % mod
            h[i+1] = tmp

        global gpw
        if gpw is None:
            self.pw = pw = [1]*(len(s)+1)
            v = 1
            for i in range(l):
                pw[i+1] = v = v * base % mod
            gpw = pw
        else:
            self.pw = gpw

    def calc(self, l, r):
        return (self.h[r] - self.h[l] * self.pw[r-l]) % self.mod


def slv(N, A, B):
    p = []
    p.append(time.perf_counter())
    L = max(max(A), max(B)).bit_length()
    ba = []
    bb = []
    ah = []
    bh = []
    bnh = []
    for i in range(L):
        ta = []
        tb = []
        tbn = []
        for a, b in zip(A, B):
            ta.append(a >> i & 1)
            tb.append(b >> i & 1)
            tbn.append(tb[-1] ^ 1)
        ba.append(ta)
        bb.append(tb)
        n = 1
        ah.append(RH(ta, 641, 10**9+7))
        bh.append(RH(tb, 641, 10**9+7))
        bnh.append(RH(tbn, 641, 10**9+7))

    # p.append(time.perf_counter())

    ans = []
    for k in range(N):
        x = 0
        for i in range(L):
            l = ah[i].calc(k, N)
            r = ah[i].calc(0, k)
            if l == bh[i].calc(0, N-k) and r == bh[i].calc(N-k, N):
                pass
            elif l == bnh[i].calc(0, N-k) and r == bnh[i].calc(N-k, N):
                x += 1 << i
            else:
                break
        else:
            ans.append((k, x))
    # p.append(time.perf_counter())

    # for i in range(len(p)-1):
    #     print(p[i+1]-p[i], file=sys.stderr)

    return ans


def main():
    N = int(input())
    A = list(map(int, input().split()))
    B = list(map(int, input().split()))
    for r in slv(N, A, B):
        print(*r)

    # import random
    # N = 2 * 10**5
    # # A = [random.randint(0, 1 << 30) for _ in range(N)]
    # # B = [random.randint(0, 1 << 30) for _ in range(N)]
    # A = [2 ** 30 for _ in range(N)]
    # B = [2 ** 30 for _ in range(N)]
    # print(N)
    # print(*A)
    # print(*B)
    # # print(*slv(N, A, B), sep='\n')


if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import time
import sys
from collections import Counter, defaultdict
buff_readline = sys.stdin.buffer.readline
readline = sys.stdin.readline


gpw = None


class RH():
    def __init__(self, s, base, mod):
        self.base = base
        self.mod = mod
        self.rev = pow(base, mod-2, mod)

        l = len(s)
        self.h = h = [0]*(l+1)
        tmp = 0
        for i in range(l):
            tmp = (tmp*base + s[i]) % mod
            h[i+1] = tmp

        global gpw
        if gpw is None:
            self.pw = pw = [1]*(len(s)+1)
            v = 1
            for i in range(l):
                pw[i+1] = v = v * base % mod
            gpw = pw
        else:
            self.pw = gpw

    def calc(self, l, r):
        return (self.h[r] - self.h[l] * self.pw[r-l]) % self.mod


def slv(N, A, B):
    p = []
    p.append(time.perf_counter())
    L = max(max(A), max(B)).bit_length()
    ba = []
    bb = []
    ah = []
    bh = []
    bnh = []
    for i in range(L):
        ta = []
        tb = []
        tbn = []
        for a, b in zip(A, B):
            ta.append(a >> i & 1)
            tb.append(b >> i & 1)
            tbn.append(tb[-1] ^ 1)
        ba.append(ta)
        bb.append(tb)
        n = 1
        ah.append(RH(ta, 641, 10**9+7))
        bh.append(RH(tb, 641, 10**9+7))
        bnh.append(RH(tbn, 641, 10**9+7))

    p.append(time.perf_counter())

    ans = []
    for k in range(N):
        x = 0
        for i in range(L):
            l = ah[i].calc(k, N)
            r = ah[i].calc(0, k)
            if l == bh[i].calc(0, N-k) and r == bh[i].calc(N-k, N):
                pass
            elif l == bnh[i].calc(0, N-k) and r == bnh[i].calc(N-k, N):
                x += 1 << i
            else:
                break
        else:
            ans.append((k, x))
    p.append(time.perf_counter())

    for i in range(len(p)-1):
        print(p[i+1]-p[i], file=sys.stderr)

    return ans


def main():
    N = int(input())
    A = list(map(int, input().split()))
    B = list(map(int, input().split()))
    for r in slv(N, A, B):
        print(*r)

    # import random
    # N = 2 * 10**5
    # # A = [random.randint(0, 1 << 30) for _ in range(N)]
    # # B = [random.randint(0, 1 << 30) for _ in range(N)]
    # A = [2 ** 30 for _ in range(N)]
    # B = [2 ** 30 for _ in range(N)]
    # print(N)
    # print(*A)
    # print(*B)
    # # print(*slv(N, A, B), sep='\n')


if __name__ == '__main__':
    main()