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 main() {
int n;
cin >> n;
vector<int>d(n - 1);
int x = 1e6, diff = 0;
for(int i = 0; i < n - 1; i++) {
cin >> d[i];
diff += d[i];
x = min(x, diff);
}
if(x < 0) x = abs(x) + 1;
vector<int>a(n);
int curVal = x;
a[0] = x;
if(a[0] > n || a[0] < 1) {
cout << -1;
return 0;
}
bool f = false;
for(int i = 1; i < n; i++) {
curVal += d[i - 1];
a[i] = curVal;
if(a[i] > n || a[i] < 1) {
cout << -1;
return 0;
}
}
if((n == 2 && x == 0) || f) {
cout << -1;
return 0;
}
for(int i = 0; i < n; i++) {
cout << a[i] << " ";
}
}
# | 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... |