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>
using namespace std;
#define ll long long
#define pb push_back
#define pii array<int, 2>
const int N = 20 + 2;
int n, a[N], o[N], ans[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
o[i] = a[i];
ans[i] = a[i];
}
for (int msk = 0; msk < (1 << n); ++msk) {
for (int i = 1; i < n; ++i) {
if (msk & (1 << i)) {
swap(a[i + 1], a[(i + 1) / 2]);
}
}
for (int i = 1; i <= n; ++i) {
if (a[i] != ans[i]) {
if (a[i] < ans[i]) {
for (int j = 1; j <= n; ++j) {
ans[j] = a[j];
}
}
break;
}
}
for (int i = 1; i <= n; ++i) {
a[i] = o[i];
}
}
for (int i = 1; i <= n; ++i) {
cout << ans[i] << ' ';
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |