Submission #1584192

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const int INF = 1e9;
 
const int MAX_LOG_V = 30;
int dp[MAX_LOG_V][100001];


int main(){
    int n, m, d;
    cin >> n >> m >> d;
 
    for (int i=0; i<100001; i++) {
        dp[0][i] = i;
    }
    vector<int> v;
    for (int i=0; i<m; i++) {
        int a;
        cin >> a;
        a--;
        v.push_back(a);
    }
    for (int i=v.size()-1; i>=0; i--) {
        swap(dp[0][v[i]], dp[0][v[i]+1]);
    }
 
    for (int i=0; i<MAX_LOG_V-1; i++) {
        for (int j=0; j<n; j++) {
            dp[i+1][j] = dp[i][dp[i][j]];
        }
    }
 
    for (int i=0; i<n; i++) {
        int d_ = d;
        int now = i;
        int j = 0;
        do {
            if (d_ & 1) {
                now = dp[j][now];
            }
            d_ >>= 1;
            j++;
        } while (d_ != 0);
 
        cout << now + 1 << endl;
    }
}

Submission Info

Judge Result