Submission #1518049

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;

int main()
{
  int N, a;
  ll K;
  cin >> N >> a >> K;
  if(K > 0 && K <= 1e18) {
    int b[30][N+1];
    FOR(i,1,N+1) cin >> b[0][i];
    FOR(k,1,30) {
      FOR(i,1,N+1) {
        b[k][i] = b[k-1][b[k-1][i]];
      }
    }
    FOR(i,0,30) {
      if((K>>i)&1) {
        a = b[i][a];
      }
    }
    cout << a << '\n';
  }

  return 0;
}

Submission Info

Judge Result