Submission #13062190

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define ll long long 
void solve(){
    ll n,k;
    cin>>n>>k;
    vector<ll>a(n);
    for(int i=0;i<n;i++) cin>>a[i];
    map<ll,ll>mp;ll pos=1;ll time=1;
    while(mp[pos]==0){
        mp[pos]=time;
        time++;
        pos=a[pos-1];
    }
    //cout<<time-mp[pos];
    if(k>n)
    {
        k-=mp[pos]-1;
        //cout<<k;
        ll period = k%(time-mp[pos]);
        ll currpos = pos;
        while(period>0){
            currpos=a[currpos-1];
            period--;
        }
        cout<<currpos;
    }
    else
    {
        ll currpos=1;
        while(k>0)
        {
            currpos=a[currpos-1];
            k--;
        }
        cout<<currpos;
    }
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    t=1;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

Submission Info

Judge Result