| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1329786 | edo | Labels (NOI20_labels) | C++20 | 35 ms | 4748 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<ll> p(n + 1);
ll p_min = 0, p_max = 0;
for(int i = 1, d; i < n; i++) {
cin >> d;
p[i] = p[i - 1] + d;
p_min = min(p_min, p[i]);
p_max = max(p_max, p[i]);
}
ll a1 = 1 - p_min;
if(a1 + p_max == n) {
for(int i = 0; i < n; i++) {
cout << a1 + p[i] << " \n"[i == n - 1];
}
return 0;
}
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... | ||||
