Submission #6207206

---

Source Code Expand

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

int main() {
  int N, M, K; cin >> N >> M >> K;
  vector<vector<int>> tap(N+1, vector<int>(40));
  for(int i = 1; i <= N; ++i) {
    tap[i][0] = i;
  }
  for(int i = 0; i < M; ++i) {
    int L; cin >> L;
    swap(tap[L][0], tap[L+1][0]);
  }
  for(int i = 1; i < 40; ++i){
    for(int j = 1; j <= N; ++j) {
      tap[j][i] = tap[tap[j][i-1]][i-1];
    }
  }

  vector<int> ans(N+1);
  for(int i = 1; i <= N; ++i) {
    int x = i;
    for(int j = 0; j < 40; ++j) {
      if(K >> j & 1) {
        x = tap[x][j];
      }
    }
    ans[x] = i;
  }
  for(int i = 1; i <= N; ++i) {
    cout << ans[i] << endl;
  }
  return 0;
}

Submission Info

Judge Result