Submission #73312735

---

Source Code Expand

#include <algorithm>
//#include <atcoder/all>
//#include <array>
//#include <bitset>
//#include <cmath>
//#include <deque>
#include <iostream>
#include <map>
//#include <numeric>
#include <queue>
//#include <ranges>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define pb push_back
#define fr first
#define sc second
#define sor(v) sort(v.begin(), v.end())
#define rev(v) reverse(v.begin(), v.end())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int,int>;
//using pll = pair<ll,ll>;
//using pqdec = priority_queue<int,vector<int>,greater<int>>;
//using pqdecl = priority_queue<ll,vector<ll>,greater<ll>>;
template <typename T>
using graph = vector<vector<T>>;
const ll LLMAX = 9223372*1e10;
const int IMAX = 214*1e7;
/*--------考察--------------------
2^10 ~ 10^3
10^100 ~ 2^340
1e10動いた先をとりあえず求めるか
----------CODING----------------*/
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<int> v(n);
    rep(i,n){cin >> v[i]; v[i]--;}
    vector<int> vv(n);
    rep(i,n) vv[i] = i;
    rep(i,100){
        vector<int> vn(n);
        rep(i,10){
            rep(j,n){
                vn[j] = v[vv[j]];
            }
            rep(j,n) vv[j] = vn[j];
        }
        rep(j,n) v[j] = vv[j];
    }
    for(int i : v) cout << i+1 << " ";
}

Submission Info

Judge Result