Submission #6904040

---

Source Code Expand

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

vector<int> get_binary_number(int n){
  vector<int> b;
  while(n != 0){
    b.emplace_back(n%2);
    n /=2;
  }
  return b;
}


int main() {
//  int n = 256;
//  while(n != 0){
//    cout << n%2 << endl;
//    n /=2;
//  }


  // 入力
  int lim = 33;
  long long N, M, D;
  cin >> N >> M >> D;

  //
  vector<int> a(M);
  for (int i = 0; i < M; ++i) {
    cin >> a[i];
    a[i]--;
  }

  //
  int results[lim][N];
  for (int i = 0; i < N; ++i) {
    results[0][i] = i;
  }
  for (int i = M-1; i >= 0; i--) {
    swap(results[0][a[i]], results[0][a[i]+1]);
  }
//  for (int i = 0; i < N; ++i) {
//    cout << results[0][i]+1 << endl;
//  }
//  cout << "-- -- " << endl;




  // ダブリング
  for (int i = 1; i < lim; ++i) {
    for (int j = 0; j < N; ++j) {
      int k = results[i-1][j];
      results[i][j] = results[i-1][k];
//      cout << results[i][j] << endl;
    }
  }

  //
  vector<int> ans(N);
  for (int i = 0; i < N; ++i) {
    ans[i] = i;
  }

  vector<int> b = get_binary_number(D);
  for (int i = 0; i < b.size(); ++i) {
    if(b[i] == 0) continue;
//    printf("i: %d\n", i);
    for (int j = 0; j < N; ++j) {
      ans[j] = results[i][ans[j]];
    }
  }

  for (int a: ans) {
    cout << a+1 << endl;
  }

  return 0;
}

Submission Info

Judge Result