Submission #3818069

---

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_N = (int)2e5 + 5;

int A[MAX_N];
int arr[MAX_N];
int orgArr[MAX_N];

int changeOne[MAX_N];
int trans[MAX_N];

int newArr[MAX_N];
int pos[MAX_N];
bool isSame(int n, int a[], int b[]){
	rep (i, n){
		if (a[i] != b[i]) return false;
	} // end rep
	return true;
}

int main()
{
	memset(A, 0, sizeof(A));
	memset(arr, 0, sizeof(arr));
	memset(orgArr, 0, sizeof(orgArr));
	memset(changeOne, 0, sizeof(changeOne));	
	memset(trans, 0, sizeof(trans));	
	memset(newArr, 0, sizeof(newArr));
	memset(pos, 0, sizeof(pos));

	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

	rep (i, N) arr[i] = i;
	memcpy(orgArr, arr, sizeof(int)*N);
	rep (j, M){
		swap (arr[A[j]], arr[A[j]+1]);
	} // end rep

	memcpy(changeOne, arr, sizeof(int)*N); // 一回の阿弥陀くじで変化した数列
	rep (i, N){
		trans[changeOne[i]] = i;	// 何がどの場所に行ったかの変換
	} // end rep

	memcpy(arr, orgArr, sizeof(int)*N);

	int repeatD = 0;
	while(true){
		rep (i, N){
			newArr[trans[i]] = arr[i];
		} // end rep

		memcpy(arr, newArr, sizeof(int)*N);

		++repeatD;
		if (isSame(N, arr, orgArr)){
			break;
		} // end if		
	} // end while

	memcpy(arr, orgArr, sizeof(int)*N);
	rep (d, D % repeatD){
		rep (i, N){
			newArr[trans[i]] = arr[i];
		} // end rep
		memcpy(arr, newArr, sizeof(int)*N);
	} // end rep

	rep (i, N){
		pos[arr[i]] = i;
	} // end rep
	
	rep (i, N){
		cout << pos[i] + 1 << endl;
	} // end rep

	return 0;
}

Submission Info

Judge Result