# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
128893 | E869120 | Permutation Recovery (info1cup17_permutation) | C++14 | 76 ms | 376 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 <iostream>
using namespace std;
#pragma warning (disable: 4996)
long long N, P[100009], A[100009];
int main() {
cin >> N;
for (int i = 1; i <= N; i++) cin >> P[i];
for (int i = N; i >= 1; i--) P[i] = (P[i] - P[i - 1]);
for (int i = 1; i <= N; i++) {
for (int j = 0; j <= i; j++) {
long long s = 1;
for (int k = 1; k < i; k++) {
if (A[k] <= j) s += P[k];
}
if (s == P[i]) {
A[i] = j + 1;
for (int k = 1; k < i; k++) { if (A[k] > j) A[k]++; }
break;
}
}
}
for (int i = 1; i <= N; i++) { if (i >= 2) cout << " "; cout << A[i]; } cout << endl;
return 0;
}
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |