Submission #1590644

---

Source Code Expand

#include <bits/stdc++.h>
#define FOR(i,bg,ed) for(ll i=(bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) for(ll i=1;i<=(n);i++)
#define MOD 1000000007
#define int long long
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<int> vec;
typedef vector<vec> mat;
const int INF = 1e9;
const ll LLINF = LLONG_MAX / 10;

vector<int> join(vector<int> amida1, vector<int> amida2)
{
    int n = amida1.size();

    vector<int> ret(n);
    REP(i,n) {
        ret[i] = amida1[amida2[i]-1];
    }

    return ret;
}

vector<int> amida_pow(vector<int> amida, int n)
{
    vector<int> res = amida;
    while (n > 0) {
        if (n & 1) res = join(res, amida);
        amida = join(amida, amida);
        n >>= 1;
    }
    return res;
}

int N, M, D;
vector<int> amida;
int A;

signed main()
{
    cin >> N >> M >> D;
    REP(i,N) {
        amida.push_back(i + 1);
    }
    REP(i,M) {
        cin >> A;
        swap(amida[A-1], amida[A]);
    }

    //REP(i,amida.size()) cout << amida[i] << " ";
    //cout << endl << endl;

    vector<int> ans = amida_pow(amida, D - 1);
    //REP(i,ans.size()) cout << ans[i] << endl;

    pair<int, int> pii[101010];
    REP(i,ans.size()) pii[i] = make_pair(ans[i], i + 1);
    sort(pii, pii + ans.size());
    REP(i,ans.size()) cout << pii[i].second << endl;
}

Submission Info

Judge Result