Submission #1233522

---

Source Code Expand

import java.util.*;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    long N = sc.nextLong();
    long a = sc.nextLong();
    long k = sc.nextLong();
    long[] b = new long[(int)N];
    for(int i = 0; i < N; i++) {
      b[i] = sc.nextLong();
    }
    ArrayList<Long> list = new ArrayList<Long>();
    list.add(a);
    long[] f = new long[(int)N];
    f[0] = a;
    long presence = a;
    long s = 0;
    long g = 1;
    for(int i = 0; i < N; i++) {
      presence = b[(int)presence - 1];
      f[i + 1] = presence;
      if(list.contains(presence)) {
        for(int j = 0; j < N; j++) {
          if(f[j] == presence) {
            s = (long)j;
            g = (long)(i + 1) - s;
            break;
          }
        }
        break;
      } else {
        list.add(presence);
      }
    }
    long ans = 0;
    if(k <= s + g) {
      ans = f[(int)k];
    } else {
      long r = (k - s) % g;
      ans = f[(int)(s + r)];
    }
    System.out.println(ans);
  }
}

Submission Info

Judge Result