Submission #2699178

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;

const int N_MAX = 100000;
const int M_MAX = 200000;

int main() {
	int N, M, D;
	int A[M_MAX];
	int table1[N_MAX];
	int table2[N_MAX];
	
	cin >> N >> M >> D;

	for (int i = 0; i < N_MAX; i++) table1[i] = i;

	for (int i = 0; i < M; i++) {
		int A;
		cin >> A;
		swap(table1[A - 1], table1[A]);
	}

	for (int i = 0; i < N_MAX; i++) {
		table2[table1[i]] = i;
	}


	vector<vector<int>> groups;
	int groupNum[N_MAX];
	for (int i = 0; i < N; i++)groupNum[i] = -1;

	for (int i = 0; i < N; i++) {
		if (groupNum[i] != -1)continue;

		vector<int> group;
		int s = i;

		do{
			groupNum[s] = groups.size();
			group.push_back(s);
			s = table2[s];
		}while (s != i);

		groups.push_back(group);
	}

	for (int i = 0; i < groups.size(); i++) {
		for (int j = 0; j < groups[i].size(); j++) {
			int n = groups[i][j];
			table2[n] = groups[i][(D + j) % groups[i].size()];
		}
	}

	for (int i = 0; i < N; i++) {
		cout << table2[i] + 1 << endl;
	}


	return 0;
}

Submission Info

Judge Result