제출 #872908

#제출 시각아이디문제언어결과실행 시간메모리
872908vjudge1Labels (NOI20_labels)C++17
0 / 100
55 ms4548 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]<0) add = max(0-arr[i], add); s[i] = arr[i]; } sort (s, s+N); //for (int j=0; j<N; j++) cout<<s[j]<<endl; 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...