# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
833712 | rainboy | Labels (NOI20_labels) | C11 | 50 ms | 3528 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 <stdio.h>
#define N 300000
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }
int main() {
static int aa[N];
int n, i, mn, mx;
scanf("%d", &n);
mn = 0, mx = 0;
for (i = 1; i < n; i++) {
scanf("%d", &aa[i]), aa[i] += aa[i - 1];
mn = min(mn, aa[i]), mx = max(mx, aa[i]);
}
if (mx - mn < n - 1) {
printf("-1\n");
return 0;
}
for (i = 0; i < n; i++)
printf("%d ", aa[i] - mn + 1);
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... |