题解 | 数列 k 重排

def solve(testcase):
    n, x = MI()
    A = LII()
    B = LII()

    for i in range(n):
        A[i] -= 1
    
    for bit in range(60):
        if x >> bit & 1:
            B = [B[A[i]] for i in range(n)]
        
        A = [A[A[i]] for i in range(n)]
    
    print(*B)

for testcase in range(1):
    solve(testcase)