Submission #872919

#TimeUsernameProblemLanguageResultExecution timeMemory
872919vjudge1Labels (NOI20_labels)C++17
100 / 100
128 ms5972 KiB
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int main(){
	int N;
	cin>>N;
	int arr[N];
	int s[N];
	arr[0] = 1;
	s[0] = 1;
	int add=0;
	for (int i=1; i<N; i++){
		int temp;
		cin>>temp;
		arr[i] = arr[i-1]+temp;
		if (arr[i]<1) add = max(1-arr[i], add);	
		s[i] = arr[i];
	}
	
	for (int j=0; j<N; j++) s[j]+=add;
	
	sort (s, s+N);
	
	if (s[0]==1 && s[N-1]==N) for (int j=0; j<N; j++) cout<<add+arr[j]<<' ';
	else cout<<-1<<endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...