Submission #1191002

---

Source Code Expand

#if 1
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <stack>
#include <array>
#include <deque>
#include <algorithm>
#include <utility>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <numeric>
#include <assert.h>

#define in std::cin
#define out std::cout

int32_t N,M,D;
int32_t res[100000];
int32_t res2[100000];
int a[200000];
int main()
{
	using std::endl;
	in.sync_with_stdio(false);
	out.sync_with_stdio(false);
	in >> N >> M >> D; --D;
	std::iota(res, res + N, 0);
	for (size_t i = 0; i < M; i++)
	{
		in >> a[i];
		std::swap(res[a[i] - 1], res[a[i]]);
	}
	for (size_t i = 0; i < D; i++)
	{
		for (size_t i = 0; i < M; i++)
		{
			std::swap(res[a[i] - 1], res[a[i]]);
		}
	}

	for (size_t i = 0; i < N; i++)
	{
		res2[res[i]] = i;
	}
	for (size_t i = 0; i < N; i++)
	{
		out << res2[i]+1 << endl;
	}

	return 0;
}
#endif

Submission Info

Judge Result