Submission #68556270

---

Source Code Expand

import sys
sys.setrecursionlimit(10 ** 6)

# import numpy as np
# <nonumba> from numba import njit, jit, boolean, int64, float64, typeof




def main():
    from io import StringIO
    execute(StringIO(sample), sys.stderr)
    print("-- ^sample! --", file=sys.stderr)

    execute(sys.stdin, sys.stdout)

    # #<nonumba> if len(solve.nopython_signatures) != 1:
    # #<nonumba>     raise KeyboardInterrupt("!! Unexpected: wrong use of jit !!")

def execute(src, dst):

    N, M, = map(int, src.readline().split())
    S = src.readline().strip()
    T = src.readline().strip()
    LRs = [list(map(int, src.readline().split())) for _i in range(M)]

    ans = solve(N, M, S, T, LRs)
    print(ans, file=dst)

sample = """\
10 5
lemwrbogje
omsjbfggme
5 8
4 8
1 3
6 6
1 4
"""

# #<nonumba> @jit(nopython=True, cache=True)
def solve(N, M, S, T, LRs):
    swaps = [0 for _n in range(N + 1)]
    for l, r in LRs:
        i = l - 1
        swaps[i] = 1 ^ swaps[i]
        j = r
        swaps[j] = 1 ^ swaps[j]

    src = (S, T,)
    select = 0
    ansl = []
    for k, s in enumerate(swaps[:-1]):
        if s == 1:
            select = 1 ^ select
        ansl.append(src[select][k])

    ans = "".join(ansl)
    # print(swaps)
    return ans




main()

Submission Info

Judge Result