제출 #335391

#제출 시각아이디문제언어결과실행 시간메모리
335391lauranLabels (NOI20_labels)C++14
100 / 100
147 ms9196 KiB
#include <bits/stdc++.h>
using namespace std;

int n;
long long a[300005], delta[300005];

int main()
{
    cin >> n;
    for (int i = 2; i <= n; i++) {
        cin >> delta[i];
    }

    a[1] = 1;
    for (int i = 2; i <= n; i++)
        a[i] = a[i - 1] + delta[i];

    long long minim = a[1], maxim = a[1];
    for (int i = 1; i <= n; i++)
        minim = min(minim, a[i]),
        maxim = max(maxim, a[i]);

    if (maxim - minim + 1 != n) {
        cout << -1;
        return 0;
    }

    for (int i = 1; i <= n; i++)
        cout << a[i] + (1 - minim) << " ";

    return 0;
}
#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...