# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
118794 | Bruteforceman | Permutation Recovery (info1cup17_permutation) | C++11 | 3 ms | 512 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"
using namespace std;
int n;
int p[100010];
int q[100010];
int a[100010];
int main(int argc, char const *argv[])
{
scanf("%d", &n);
for(int i = 1; i <= n; i++) {
scanf("%d", p + i);
}
for(int i = n; i >= 1; i--) {
p[i] -= p[i - 1];
}
for(int i = 1; i <= n; i++) {
q[i] = p[i];
}
int cur = 0;
for(int i = 1; i <= n; i++) {
int idx = -1;
for(int j = 1; j <= n; j++) {
if(p[j] == 1) {
idx = j;
}
}
for(int j = idx; j <= n; j++) {
p[j] -= q[idx];
}
a[idx] = ++cur;
}
for(int i = 1; i <= n; i++) printf("%d ", a[i]);
printf("\n");
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... |