# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
294558 | SeDunion | Mechanical Doll (IOI18_doll) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
using ll = long long;
using pii = pair <int, int>;
using pll = pair <ll, ll>;
using ld = long double;
// mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int mod = 1e9 + 7;
const ll inf = 1e9;
const ll INF = 2e18;
const int N = 2e6 + 66;
const int M = 5005;
void solve () {
int M, N;
cin >> M >> N;
vector<int> A(N);
for (int &i : A) cin >> i;
vector<int> C(M + 1);
for (int i = 1 ; i < N ; ++ i) {
C[A[i - 1]] = A[i];
}
C[0] = A[0];
C[A[N - 1]] = 0;
cout << "0\n";
for (int i : C) cout << i << " ";
cout << "\n";
}
int main (/*UwU*/) {
ios;
int tt = 1;
// cin >> tt;
while (tt--) {
solve();
cout << "\n";
}
}