Submission #73303930

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

void O_O() {
    int n;
    cin >> n;

    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }

    vector<int> ans(n + 1);
    auto dfs = [&](auto& dfs, int i) -> int {
        if (i == a[i]) return ans[i] = a[i];
        if (ans[i]) return ans[i];
        return ans[i] = dfs(dfs, a[i]);
    };

    for (int i = 1; i <= n; i++) {
        dfs(dfs, i);
    }

    for (int i = 1; i <= n; i++) {
        cout << ans[i] << ' ';
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int TC = 1;
    //cin >> TC;
    while (TC--) {
        O_O();
        if (TC) cout << '\n';
    }

    return 0;
}

Submission Info

Judge Result