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);
for (int i = 0; i < N - 1; i++) {
cin >> D[i];
}
vector<int> A(N);
A[0] = 1;
for (int i = 1; i < N; i++) {
A[i] = A[i - 1] + D[i - 1];
}
bool valid = true;
for (int i = 0; i < N - 1; i++) {
if (A[i] + D[i] != A[i + 1]) {
valid = false;
break;
}
}
if (valid) {
for (int i = 0; i < N; i++) {
cout << A[i] << " ";
}
cout << endl;
} else {
cout << -1 << 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... |