Submission #1812039

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;

template<class T> void vin(vector<T>& v, int n) {
    v.resize(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
    }
}

bool used[100001];

int main() {
    ll N, a;
    string k;
    cin >> N >> a >> k;
    a--;
    vector<int> b(N);
    rep(i, N) {
        cin >> b[i];
        b[i]--;
    }
    vector<int> v;
    int T = 0;
    int next = a;
    rep(i, N) {
        if (used[next]) {
            rep(j, v.size()) {
                if (v[j] == next) {
                    T = j;
                    break;
                }
            }
            break;
        }
        else {
            v.push_back(next);
            used[next] = 1;
            next = b[next];
        }
    }
    int mod = 0;
    bool f = false;
    rep(i, k.length()) {
        mod = (mod * 10 + (k[i] - '0'));
        if (mod > N) {
            mod %= (N - T);
            f = true;
        }
    }
    if (f) {
        int add = 0;
        while (add < N) add += (N - T);
        mod += add;
    }
    next = a;
    rep(i, mod) {
        next = b[next];
    }
    cout << next+1 << endl;
}

Submission Info

Judge Result