| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 330058 | oak | Labels (NOI20_labels) | C++14 | 79 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 main(){
	int n,i;
	scanf("%d",&n);
	int arr[n],mi = 0,mx = 0;
	arr[0] = 0;
	for(i=1;i<n;i++){
		scanf("%d",&arr[i]);
		arr[i] += arr[i-1];
		mi = min(arr[i],mi);
		mx = max(arr[i],mx);
	}
	if(mx-mi+1 < n){
		printf("-1");
		return 0;
	}
	int c = 1 - mi;
	for(i=0;i<n;i++){
		printf("%d ",c+arr[i]);
	}
}
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... | ||||
