# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
310852 | ryangohca | Labels (NOI20_labels) | C++17 | 232 ms | 6904 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>
#define int long long
using namespace std;
int diff[300001];
main(){
int n; cin >> n;
diff[0] = 0;
int curr = 0;
int mini = 1;
int maxi = n;
for (int i = 1; i < n; i++){
int g; cin >> g;
curr += g;
diff[i] = curr;
if (curr <= 0){
mini = max(mini, abs(curr) + 1);
} else {
maxi = min(maxi, n - curr);
}
}
if (mini != maxi) cout << "-1\n";
else {
for (int i = 0; i < n; i++){
cout << mini + diff[i] << " \n"[i==n-1];
}
}
}
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... |