Submission #3978851

---

Source Code Expand

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

int main () {
  int n, k, d;
  cin >> n >> k >> d;
  int a[k];
  for (int i = 0; i < k; i++) {
    cin >> a[i];  
  } 
  int dis[n + 1];
  for (int i = 0; i <= n; i++) {
    dis[i] = i;  
  }
  for (int i = 0; i < k; i++) {
    swap(dis[a[i]], dis[a[i] + 1]);  
  }
  int dis2[n + 1], ans[n + 1];
  dis2[0] = 0;
  ans[0] = 0;
  for (int i = 1; i <= n; i++) {
    dis2[dis[i]] = i;
    ans[i] = 0;
  }
  for (int i = 1; i <= n; i++) {
    if (ans[i] == 0) {
      vector<int> box;
      box.push_back(i);
      int now = dis2[i];
      while (now != box[0]) {
        box.push_back(now);
        now = dis2[now];  
      }
      int dd = d % box.size();
      if (box.size() == 1) {
        ans[now] = now;    
      }
      else {
        for (int j = 0; j < box.size(); j++) {
          // ans[box[j]]について考えている
          now = box[j];
          if (j + dd < box.size()) {
            ans[now] = box[j + dd];  
          }      
          else {
            int l = j + dd - box.size();
            ans[now] = box[l];  
          }
        }
      }
    }  
  }
  for (int i = 1; i <= n; i++) {
    cout << ans[i] << endl;  
  }
}

Submission Info

Judge Result