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;
const int maxn = 2e5 + 10;
int a[maxn];
int main() {
int n;
cin >> n;
int first = n;
for(int i = 2; i <= n; i++) {
int x;
cin >> x;
a[i] = a[i - 1] + x;
if(abs(a[i]) >= n) {
cout << -1 << endl;
exit(0);
}
first = min(first, n - a[i]);
}
for(int i = 1; i <= n; i++) {
a[i] += first;
if(a[i] < 1 || n < a[i]) {
cout << -1 << endl;
exit(0);
}
}
if(*min_element(a + 1, a + n + 1) != 1 || *max_element(a + 1, a + n + 1) != n) {
cout << -1 << endl;
exit(0);
}
for(int i = 1; i <= n; i++) cout << a[i] << " ";
cout << endl;
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... |