| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1181935 | m_a_d | Labels (NOI20_labels) | C++20 | 75 ms | 6984 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int length;
cin >> length;
int arr[length-1];
for(int i=0; i<length-1; ++i) cin >> arr[i];
int mini=999999999, maxi=0, curr=0;
for(auto elem:arr) {curr+=elem; mini=min(mini, curr); maxi=max(maxi, curr);}
if(maxi-min(mini, (int) 0)==length-1) {
int ans[length];
ans[0]=abs(min(mini, (int) 0))+1;
for(int i=1; i<length; ++i) ans[i]=ans[i-1]+arr[i-1];
for(auto elem:ans) cout << elem << " ";
}
else cout << -1;
return 0;
}| # | 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... | ||||
