Submission #995284

#	Time	Username	Problem	Language	Result	Execution time	Memory
995284		vyshniak_n	Labels (NOI20_labels)	C++17	100 / 100	51 ms	9108 KiB

Labels

//#pragma optimize("Ofast")
//#pragma optimize("unroll-loops")
//#pragma traget("avx,avx2")

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define el '\n'
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define point pair <ll, ll>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using namespace std;

#include <random>
mt19937 rnd(time(0));

const ll INF = 1e18 + 10;
const ll inf = 1e9 + 10;
const ll N = 1e3 + 10;
const ll mod = 1e9 + 7;
const ll LOG = 20;
const ll K = 1e3 + 20;

void solve() {
    ll n;
    cin >> n;

    vector <ll> a(n - 1);
    for (ll i = 0; i < n - 1; i++)
        cin >> a[i];

    vector <ll> b(n);
    b[0] = 1;

    for (ll i = 1; i < n; i++)
        b[i] = b[i - 1] + a[i - 1];

    ll need = 1 - *min_element(all(b));
    for (ll i = 0; i < n; i++)
        b[i] += need;

    if (*max_element(all(b)) != n)
        return void(cout << -1 << el);

    for (ll i = 0; i < n; i++)
        cout << b[i] << " ";
    cout << el;
    return;
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int tests = 1;
    //cin >> tests;

    while (tests--) 
        solve();
    return 0;
}
/*
*/

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