Submission #861314

#	Time	Username	Problem	Language	Result	Execution time	Memory
861314		sleepntsheep	Labels (NOI20_labels)	C++17	100 / 100	52 ms	6960 KiB

Labels

#include <cstdio>
#include <cstring>
#include <cassert>
#include <string>
#include <deque>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
using ll=long long;

#define N 300005
#define ALL(x) x.begin(), x.end()

int n, d[N], a[N];
map<int, int> fr;

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    for (int i = 0; i < n-1; ++i) cin >> d[i];
    for (int i = 0; i < n-1; ++i) a[i+1] = a[i] + d[i];
    int hi = *max_element(a, a+n), lo = *min_element(a, a+n);
    if (hi-lo+1 < n) return cout << -1, 0;
    for (int i = 0; i < n; ++i) cout << a[i] -lo + 1 << ' ';

    return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 15 / 15
• Subtask 3: 25 / 25
• Subtask 4: 18 / 18
• Subtask 5: 35 / 35