oj.uz

Submission #872909

# Submission time Handle Problem Language Result Execution time Memory
872909 2023-11-14T04:44:24 Z vjudge1 Labels (NOI20_labels) C++17
0 / 100
 54 ms 4692 KB 
#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]<0) add = max(0-arr[i], add);	
		s[i] = arr[i];
	}
	
	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;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 4692 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 41 ms 2748 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -