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;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N = (int)3e5 + 10;
ll F[N];
int main(){
fastIO;
int n;
cin >> n;
ll low = 1, high = n;
ll x;
for(int i = 2; i <= n; i ++ ){
cin >> x;
F[i] = F[i - 1] + x;
low = max(low, 1 - F[i]);
high = min(high, n - F[i]);
}
if(low != high){
cout << -1 << "\n";
return 0;
}
for(int i = 1; i <= n; i ++ )
cout << low + F[i] << " ";
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... |