Submission #215663

---

Source Code Expand

#include<iostream>
#include<vector>
/*
#include<iomanip>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<string>
#include<sstream>
#include<ncurses.h>
*/

using namespace std;
void D1solve(int, int, int, vector<int>&, vector<int>&);
void Dnsolve(vector<int>&, vector<int>&, int, int);
void swap(int*, int*);

int main(){
  ios::sync_with_stdio(false);

  //入力
  int n, m, d;
  vector<int> a;
  cin >> n >> m >> d;
  a.assign(m+1, 0);
  a[0] = 0;
  for(int i = 1; i <= m; i++) cin >> a[i];
  //入力

  //solve
  vector<int> b(n+1);
  vector<int> c(n+1);
  //solve

  D1solve(n, m, d, a, b);

  if( d == 1 ){
    for(int i = 1; i < n+1; i++)
      cout << b[i] << endl;
  }else{
    Dnsolve(b, c, d, n);
    for(int i = 1; i < n+1; i++)
      cout << c[i] << endl;
  }

  return 0;
}

void Dnsolve(vector<int>& b, vector<int>& c, int d, int n){
  vector<int> tmp(n+1);
  for(int i = 1; i <= n; i++) tmp[i] = i;
  for(int dd = 0; dd < d; dd++){
    for(int j = 1; j <= n; j++){
      tmp[j] = b[tmp[j]];
    }
  }
  for(int k = 1; k <= n; k++) c[k] = tmp[k];

}

/*
void D1solve(int n, int m, int d, vector<int>& a, vector<int>& b){
  for(int i = 1; i <= n; i++){
    int current = i;
    for(int j = 1; j <= m; j++){
      if( current == a[j] ) current++;
      else if( current-1 == a[j] ) current--;
    }
    b[i] = current;
  }
}
*/

void D1solve(int n, int m, int d, vector<int>& a, vector<int>& b){
  vector<int> tmp(n+1);
  for(int i = 1; i <= n; i++){
    tmp[i] = i; //indexを現在の場所,tmp[index]の値を元の場所とする
  }
  for(int j = 1; j <= m; j++){
    swap(&tmp[a[j]], &tmp[a[j]+1]);
  }

  for(int k = 1; k <= n; k++)
    b[tmp[k]]  = k; //indexを元の場所, b[index]をたどり着いた場所として返す

}

void swap(int* l, int* r){
  int tmp;
  tmp = *l;
  *l = *r;
  *r = tmp;
}


//index番目がb[index]に移動する

Submission Info

Judge Result