# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
674601 | QwertyPi | Labels (NOI20_labels) | C++14 | 139 ms | 6708 KiB |
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;
const int N = 3e5 + 11;
int a[N], d[N];
int main(){
int n; cin >> n;
for(int i = 0; i < n - 1; i++) cin >> d[i];
a[0] = 0; for(int i = 0; i < n - 1; i++) a[i + 1] = a[i] + d[i];
int _min = *min_element(a, a + n), _max = *max_element(a, a + n);
if(_max - _min != n - 1){
cout << -1 << endl;
}else{
for(int i = 0; i < n; i++) cout << a[i] - _min + 1 << ' '; cout << endl;
}
}
Compilation message (stderr)
# | 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... |