Submission #1714042

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for(int i = 0; i < (n); i++)
#define FORR(x, arr) for(auto& x:arr)
#define ITR(x, c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define MEM(a, x) memset(a, x, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNIQUE(a) a.erase(unique(ALL(a)), a.end())
typedef long long ll;
typedef pair<int, int> P;

int n, m, d, to[100005], ans[100005];
bool used[100005];
P p[100005];

int main(int argc, char const *argv[]) {
	ios_base::sync_with_stdio(false);
	cin >> n >> m >> d;
	FOR(i, n) to[i] = i;
	FOR(i, m) {
		int a;
		cin >> a;
		swap(to[a-1], to[a]);
	}
	vector<vector<int> > v;
	FOR(i, n) {
		if (used[i]) continue;
		v.push_back(vector<int>(1, i));
		used[i] = true;
		p[i] = {v.size()-1, v.back().size()-1};
		for (int j = to[i]; j != i; j = to[j]) {
			v.back().push_back(j);
			used[j] = true;
			p[j] = {v.size()-1, v.back().size()-1};
		}
	}
	FORR(e, v) {
		int sz = e.size(), mod = d%sz;
		FOR(i, e.size()) {
			ans[e[i]] = e[(i+mod)%sz];
		}
	}
	vector<int> ret(n);
	FOR(i, n) ret[ans[i]] = i+1;
	FOR(i, n) cout << ret[i] << endl;
	return 0;
}

Submission Info

Judge Result