Submission #6903342

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define SP << " " <<
#define SPF << " "
#define SPEEDUP cin.tie(0);ios::sync_with_stdio(false);
#define MAX_I INT_MAX //1e9
#define MIN_I INT_MIN //-1e9
#define MAX_UI UINT_MAX //1e9
#define MAX_LL LLONG_MAX //1e18
#define MIN_LL LLONG_MIN //-1e18
#define MAX_ULL ULLONG_MAX //1e19
  typedef long long ll;
  typedef pair<int,int> PII;
  typedef pair<char,char> PCC;
  typedef pair<ll,ll> PLL;
  typedef pair<char,int> PCI;
  typedef pair<int,char> PIC;
  typedef pair<ll,int> PLI;
  typedef pair<int,ll> PIL; 
  typedef pair<ll,char> PLC; 
  typedef pair<char,ll> PCL; 

inline void YesNo(bool b){ cout << (b?"Yes" : "No") << endl;}
inline void YESNO(bool b){ cout << (b?"YES" : "NO") << endl;}
inline void Yay(bool b){ cout << (b?"Yay!" : ":(") << endl;}

int main(void){
  SPEEDUP
  cout << setprecision(15);
  int N,M,D;cin >> N >> M >> D;
  vector<int> v(N+1);
  int n_2 = 0;
  {
    int n = D;
    while(n){
      ++n_2;
      n/=2;
    }
  }

  vector<vector<int> > d(n_2,vector<int>(N+1));
  rep(i,N+1)v[i] = i;
  rep(i,M){
    int x;cin >> x;
    swap(v[x],v[x+1]);
  }

  repp(i,1,N+1) d[0][v[i]] = i;
  //repp(i,1,N+1) cout << d[0][i] SPF;
  //cout << endl;
  repp(n,1,n_2){
    repp(i,1,N+1) d[n][i] = d[n-1][d[n-1][i]];
    //repp(i,1,N+1) cout << d[n][i] SPF;
    //cout << endl;
  }

  int dp[2][N+1];
  int *pre,*nxt;
  pre = dp[0];
  nxt = dp[1];
  rep(i,N+1) pre[i] = i;
  rep(n,n_2){
    if(D>>n&1){
      repp(i,1,N+1) nxt[i] = d[n][pre[i]];
      swap(pre,nxt);
    }
  }
  swap(pre,nxt);
  repp(i,1,N+1) cout << nxt[i] << endl;
  return 0;
}

Submission Info

Judge Result