제출 #861311

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
861311		sleepntsheep	Labels (NOI20_labels)	C++17	7 / 100	8 ms	1116 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 200005
#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];
    ++fr[a[0] = 1];
    for (int i = 0; i < n-1; ++i) ++fr[a[i+1] = a[i] + d[i]];
    for (auto [x, y] : fr) if (y > 1) return cout << -1, 0;
    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] + n - hi << ' ';

    return 0;
}

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