제출 #320578

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
320578		vishesh312	Labels (NOI20_labels)	C++17	100 / 100	73 ms	5988 KiB

Labels

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define deb(x)        cerr << #x << " = " << x << "\n";
#define deb2(x, y)    cerr << #x << " = " << x << ", " << #y << " = " << y << "\n";
#define deb3(x, y, z) cerr << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " << z << "\n";

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define f  first
#define s  second

#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()

using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
using ordered_multiset = tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;  

ll binpow(ll a, ll b) {
    //a = a % mod;
    ll res = 1;
    while ( b > 0) {
        if (b&1) {
            res = (a*res);//%mod;
        }
        a = (a*a);//%mod;
        b >>= 1;
    }
    return res;
}

void solve(int tc) {
    int n;
    cin >> n;
    vector<int> v(n-1), p(n);
    for (int i = 0; i < n-1; ++i) {
        cin >> v[i];
        p[i+1] = v[i];
        p[i+1] += p[i];
    }
    int mx = *max_element(all(p));
    int mn = *min_element(all(p));
    deb2(mx, mn)
    deb(n-1)
    if (mx-mn!=n-1) {
        cout << -1 << '\n';
        return;
    }
    vector<int> ans(n);
    ans[0] = n-mx;
    for (int i = 1; i < n; ++i) {
        ans[i] = ans[i-1] + v[i-1];
    }
    for (auto x : ans) cout << x << " ";
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);

    int tc = 1;
    //cin >> tc;

    for (int i = 1; i <= tc; ++i) {
        solve(i);
    }

    return 0;
}

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