Submission #1779039

---

Source Code Expand

#include <iostream>
#include <vector>

using namespace std;


int main(void){
	int n, m, d;

	cin >> n >> m >> d;

	vector<int> amida(n+1);

	for (int i = 0; i < n; i++)
		amida[i+1] = i+1;

	vector<int> a(m);
	for (int i = 0; i < m; i++){
		cin >> a[i];
	}
	for (int i = m - 1; i >= 0; i--){
		int temp = amida[a[i]];
		amida[a[i]] = amida[a[i]+1];
		amida[a[i]+1] = temp;
	}


	vector<int> par(n+1);
	vector< vector<int> > replace(0);
	for (int i = 1; i < n + 1; i++){
		par[i] = i;
	}
	int num = 1;
	while (num <= n){
		if (par[num] == num){
			replace.push_back(vector<int>(0));
			replace[replace.size()-1].push_back(num);
			int id = amida[num];
			while (id != num){
				par[id] = num;
				replace[replace.size()-1].push_back(id);
				id = amida[id];
			}
		}
		num++;
	}



	for (int i = 0; i < replace.size(); i++){
		int t = d % replace[i].size();

		vector<int> c(replace[i].size());
		c = replace[i];
		for (int j = 0; j < t; j++){
			int tmp = c[replace[i].size()-1];
			for (int k = 0; k < replace[i].size() - 1; k++){
				replace[i][k+1] = c[k];
			}
			replace[i][0] = tmp;
		}
		for (int j = 0; j < replace[i].size(); j++){
			amida[c[j]] = replace[i][j];
		}
	}
	for (int i = 0; i < n; i++){
		cout << amida[i+1] << endl;
	}

/*
	vector<int> b(n+1), c(n+1);
	c = amida;
	for (int i = 0; i < d - 1; i++){
		b = amida;
		for (int j = 0; j < n; j++){
			b[j+1] = amida[c[j+1]];
		}
		c = b;
	}

	for (int i = 0; i < n; i++){
		cout << c[i+1] << endl;
	}
*/

	return 0;
}

Submission Info

Judge Result