Submission #552142

---

Source Code Expand

def find_kth(k, a, head, cycle, cycle_start, bs):
    if k < head:
        p = a
        while k:
            p = bs[p]
            k -= 1
        return p
    k -= head
    k %= cycle
    p = cycle_start
    while k:
        p = bs[p]
        k -= 1
    return p

def detect_cycle(N, a, bs):
    visited = [0] * (1 + N)
    p = a
    step = 0
    while not visited[p]:
        visited[p] = step
        step += 1
        p = bs[p]
    return visited[p], step - visited[p], p


N, a = map(int, input().split())
k = int(input())
bs = [0] + list(map(int, input().split()))
head, cycle, cycle_start = detect_cycle(N, a, bs)
print(find_kth(k, a, head, cycle, cycle_start, bs))

Submission Info

Judge Result