# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
330055 | M_W | Labels (NOI20_labels) | C++14 | 82 ms | 5612 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;
int a[300300];
int main(){
int N, minn = 1, maxx = 1;
scanf("%d", &N);
a[0] = 1;
for(int i = 1, tmp; i < N; i++){
scanf("%d", &tmp);
a[i] = a[i - 1] + tmp;
minn = min(minn, a[i]);
maxx = max(maxx, a[i]);
if(maxx - minn >= N){
printf("-1");
exit(0);
}
}
int c = 1 - minn;
if(maxx - minn < N - 1){
printf("-1");
exit(0);
}
for(int i = 0; i < N; i++)
printf("%d ", a[i] + c);
}
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... |