Submission #73328211

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
struct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); cout << setprecision(13); } }init;
using ll = long long;
using pll = pair<ll, ll>;
const int inf = 1073741823;
const long long INF = 1LL << 60;
#define el '\n'
#define spa " "
#define pb emplace_back
#define rep(i, s, n) for(int i = (s); i < (int)(n); i++)
#define rrep(i, s, n) for(int i = (int)(n) - 1; i >= (s); i--)
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define unless(c) if(!(c))
#define until(c) while(!(c))

int sub(){
    return 0;
}

int solve() {
    ll n, cnt = 0;
    cin >> n;
    vector<ll> a(n+1, 0);
    vector<bool> stack(n+1, false);
    stack[0] = true;
    rep(i, 1, n+1){
        cin >> a[i];
        if(a[i] == i){
            stack[i] = true;
        }
    }
    
    while(true){
        cnt = 0;
        rep(i, 1, n+1){
            if(stack[i]){
                cnt++;
                continue;
            }
            a[i] = a[a[i]];
            if(stack[a[i]]){
                stack[i] = true;
            }
        }
        if(cnt == n){
            break;
        }
    }
    
    bool s = false;
    rep(i, 1, n+1){
        if(s)cout << spa;
        cout << a[i];
        s = true;
    }
    cout << el;
    return 0;
}


int main() {
    int t = 1;
    // cin >> t;
    rep(i, 0, t) {
        solve();
    }
    return 0;
}

Submission Info

Judge Result