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 n;
long long a[300005], delta[300005];
int main()
{
cin >> n;
for (int i = 2; i <= n; i++) {
cin >> delta[i];
}
a[1] = 1;
for (int i = 2; i <= n; i++)
a[i] = a[i - 1] + delta[i];
long long minim = a[1], maxim = a[1];
for (int i = 1; i <= n; i++)
minim = min(minim, a[i]),
maxim = max(maxim, a[i]);
if (maxim - minim + 1 != n) {
cout << -1;
return 0;
}
for (int i = 1; i <= n; i++)
cout << a[i] + (1 - minim) << " ";
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... |