Submission #3817437

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

const int MAX_M = (int)2e5 + 5;

int A[MAX_M];

int main()
{
	memset(A, 0, sizeof(A));
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int N, M, D; cin >> N >> M >> D;
	rep (i, M){
		int a; cin >> a;
		--a;
		A[i] = a;
	} // end rep

	if (D > 1000){
		exit(-1);
	} // end if

	vector<int> n(N, 0);
	rep (i, N) n[i] = i;
	rep (d, D){
		rep (j, M){
			swap (n[A[j]], n[A[j]+1]);
		} // end rep
	} // end rep
	vector<int> pos(N, 0);
	rep (i, N){
		pos[n[i]] = i;
	} // end rep
	
	rep (i, N){
		cout << pos[i] + 1 << endl;
	} // end rep

	return 0;
}

Submission Info

Judge Result