Submission #214354

---

Source Code Expand

#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>

#define INF 1000000000
#define MAXM 200010

using namespace std;
typedef long long ll;

int N, M, D;
int A[MAXM];

int main(void) {
    cin >> N >> M >> D;
    for (int i = 0; i < M; i++) cin >> A[i];
    int to[N+1];
    for (int i = 1; i <= N; i++) {
        int cur = i;
        for (int j = 0; j < M; j++) {
            if (cur == A[j]) {
                cur = A[j] + 1;
            } else if (cur == A[j]+1) {
                cur = A[j];
            }
        }
        to[i] = cur;
    }
    for (int i = 1; i <= N; i++) {
        int cur = i;
        for (int i = 0; i < D; i++) {
            cur = to[cur];
        }
        cout << cur << endl;
    }
    return 0;
}

Submission Info

Judge Result