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;
#define int long long
typedef pair<int,int> pi;
#define f first
#define s second
#define FAST ios_base::sync_with_stdio(0); cin.tie(0);
const int maxn = 300010;
int n;
int d[maxn];
int pre[maxn];
int32_t main() {
FAST
cin >> n;
for (int i =1;i<n;i++) {
cin >> d[i];
}
int maxv = 0, minv = INT_MAX/2;
for (int i =1;i<n;i++) {
pre[i] = pre[i-1] + d[i];
maxv = max(maxv,pre[i]);
minv = min(minv,pre[i]);
}
int topbound = min(n, n - maxv);
int botbound = max(1ll,1 - minv);
if (topbound == botbound and topbound >= 1) {
cout << topbound << " ";
for (int i =1;i<n;i++) cout << topbound + pre[i] << " ";
} else {
cout << "-1";
}
}
# | 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... |