# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
335613 | Joshc | Labels (NOI20_labels) | C++11 | 85 ms | 5612 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 <cstdio>
#include <algorithm>
using namespace std;
int a[300001];
int main() {
int n, x, p=0, q=0;
scanf("%d", &n);
for (int i=1; i<n; i++) {
scanf("%d", &x);
a[i] = a[i-1]+x;
p = min(p, a[i]);
q = max(q, a[i]);
}
if (q-p == n-1) {
for (int i=0; i<n; i++) printf("%d ", a[i]+1-p);
} else printf("-1\n");
}
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... |