# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
291393 | crossing0ver | Labels (NOI20_labels) | C++17 | 235 ms | 5624 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;
main() {
int n;
cin >> n;
vector<int> d(n-1);
int mn = INT_MAX,mx = INT_MIN;
for (int i = 0; i < n-1; i++) {
cin >> d[i];
if (i)
d[i] += d[i-1];
mn = min(mn,d[i]);
mx = max(mx,d[i]);
}
int L = 1 - mn;
int R = n - mx;
L = max(L,1);
R = min(n,R);
if (L != R) {
cout << -1;
return 0;
}
cout << L <<' ';
for (int i = 0;i < n-1; i++)
cout << d[i] + L <<' ';
}
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... |