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;
typedef long long ll;
const int N = (int) 3e5 + 7;
int n, a[N], pre[N];
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// freopen("input", "r", stdin);
cin >> n;
for (int i = 1; i < n; i++) {
cin >> a[i];
}
int mx = 0, mn = 0;
for (int i = 1; i < n; i++) {
pre[i] = pre[i - 1] + a[i];
mx = max(mx, pre[i]);
mn = min(mn, pre[i]);
}
int low = mn + 1, high = n - mx;
if (low == high) {
cout << low << " ";
for (int i = 1; i < n; i++) {
low += a[i];
cout << low << " ";
}
cout << "\n";
return 0;
}
cout << "-1\n";
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... |