Submission #691337

#TimeUsernameProblemLanguageResultExecution timeMemory
691337saayan007Labels (NOI20_labels)C++17
100 / 100
73 ms6640 KiB
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pi = pair<int, int>;
using pl = pair<long long, long long>;
using vi = vector<int>;
using vl = vector<long long>;
using vpi = vector<pair<int, int>>;
using vpl = vector<pair<long long, long long>>;

#define fur(i, a, b) for(ll i = a; i <= (ll)b; ++i)
#define ruf(i, a, b) for(ll i = a; i >= (ll)b; --i)
#define fr first 
#define sc second
#define mp make_pair
#define pb emplace_back
#define nl "\n"
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

int main() 
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    ll n;
    cin >> n;
    ll d[n];
    fur(i, 1, n) {
        cin >> d[i];
    }
    fur(i, 2, n)
        d[i] += d[i - 1];

    ll mx = d[1], mn = d[1];
    fur(i, 2, n - 1) {
        mx = max(mx, d[i]);
        mn = min(mn, d[i]);
    }

    ll least = 1 - mn;
    ll most = n - mx;
    least = max(least, 1ll);
    most = min(most, n);
    if(least != most) {
        cout << -1 << nl;
        return 0;
    }
    cout << least  << ' ';
    fur(i, 1, n - 1)
        cout << least + d[i] << ' ';
}
#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...