Submission #1043583

#	Time	Username	Problem	Language	Result	Execution time	Memory
1043583		vjudge1	Labels (NOI20_labels)	C++17	100 / 100	52 ms	9152 KiB

Labels

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }

#define MAX             300005
int  D[MAX];
int  nArr;
int A[MAX];
void process(void){
    cin >> nArr;
    for (int i = 1; i < nArr; ++i){
        cin >> D[i];
        D[i] += D[i - 1];
    }
    A[1] = 1;
    for (int i = 1; i < nArr; ++i){
        if (D[i] <= 0) maximize(A[1], -D[i] + 1);
        else{
            if (A[1] + D[i] > nArr) return void(cout << -1);
        }
    }
    for (int i = 1; i <= nArr; ++i){
        A[i + 1] = A[1] + D[i];
    }
    if(*max_element(A + 1, A + nArr + 1) < nArr) return void(cout << -1);
    for (int i = 1; i <= nArr; ++i) cout << A[i] << " ";
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

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