Submission #1605086

---

Source Code Expand

#include <iostream>
#include <vector>
using namespace std;

vector<int> mul(const vector<int> &P1, const vector<int> &P2){
    int N = P1.size();
    vector<int> P(N);
    for(int i=0; i<N; i++)
        P[i] = P1[P2[i]];
    return P;
}

vector<int> rec(const vector<int> &P, int D){
    if(D == 1) return P;
    if(D % 2 == 0){
        vector<int> Q = mul(P, P);
        return rec(Q, D / 2);
    }
    return mul(P, rec(P, D-1));
}

int main(){
    int N, M, D;
    cin >> N >> M >> D;
    vector<int> A(M);
    for(int i=0; i<M; i++) cin >> A[i];
    vector<int> P(N);
    for(int i=0; i<N; i++) P[i] = i;

    for(int i=M-1; i>=0; i--)
        swap(P[A[i]-1], P[A[i]]);
    P = rec(P, D);
    for(int i=0; i<N; i++)
        cout << P[i]+1 << endl;

    return 0;
}

Submission Info

Judge Result