Submission #8146281

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)
#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)
#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)
const ll INF = 1145141919;
const ll MOD = 1000000007;
template<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}
template<class T> void chmin(T &a, const T &b){if(a > b){a = b;}}

ll R[31][101010];
ll tmp[101010];
int main(){

    ll N, M, D;
    cin >> N >> M >> D;
    rep1(i, N)tmp[i] = i;
    rep1(i, M){
        ll a;
        cin >> a;
        swap(tmp[a], tmp[a + 1]);
    }
    rep1(i, N)R[0][tmp[i]] = i;
    rep1(i, 30)rep1(j, N)R[i][j] = R[i - 1][R[i - 1][j]];
    rep1(i, N){
        ll pos = i;
        for(ll i = 0; i < 30; i++){
            if((D & (1 << i)) == 0)continue;
            pos = R[i][pos];
        }
        cout << pos << endl;
    }

    return 0;
}

Submission Info

Judge Result