제출 #1285297

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1285297		diep38	Labels (NOI20_labels)	C++20	7 / 100	27 ms	9376 KiB

Labels

#include <bits/stdc++.h>
using namespace std;
#define int long long

#define ed "\n"
#define fi first
#define se second
#define db double
#define irs insert
#define pb push_back
#define mpa make_pair
#define pi pair<int,int>
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x>>i)&1)
#define ON(x, i) ((x)  MASK(i))
#define OFF(x, i) ((x) & ~MASK(i))
#define ALL(v) v.begin() , v.end()
#define bp(x) __builtin_popcount(x)
#define pii pair<int,pair<int,int>>
#define fl(i,a,b) for(int i=a;i>=b;--i)
#define fis(i,a,b) for(int i=a;i<=b;++i)
#define Radian(x) (x * acos(-1.0) / 180)
const double eps = 1e-9;
const int mod=1e9+7;
const int Mdem=998244353;
const int LOG=19;
const int base=31;
const int maxn=3e5+5;
const int bl = 320;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define gay(a) freopen(a".inp","r",stdin),freopen(a".out","w",stdout)
template <class T>
bool minimize(T &a, const T &b) {
    if(a > b) {a = b; return 1;}
    return 0;
}

template <class T>
bool maximize(T &a, const T &b) {
    if(a < b) {a = b; return 1;}
    return 0;
}
template <class T>
void compress(vector <T> &v) {
    sort(ALL(v));
    v.erase(unique(ALL(v)), (v).end());
}

void add(int &a, int b) {   a += b; if (a >= mod)   a -= mod;   }
void sub(int &a, int b) {   a -= b; if (a <  0)     a += mod;   }
int n, a[maxn], b[maxn], d[maxn];

signed main(){
    fast;
    cin >> n;
    fis(i, 1, n - 1) cin >> d[i];
    fis(i, 1, n - 1) if(d[i] == 0){
        cout << -1 << ed; return 0;
    }
    int mx = 0, pos = 1;
    fis(i, 2, n){
        b[i] = b[i - 1] + d[i - 1];
        if(maximize(mx, b[i])) pos = i;
    }
    a[pos] = n;
    fl(i, pos - 1, 1){
        a[i] = a[i + 1] - d[i];
    }
    fis(i, pos + 1, n){
        a[i] = a[i - 1] + d[i - 1];
    }
    int mi = n;
    fis(i, 1, n) minimize(mi, a[i]);
    fis(i, 1, n) a[i] = a[i] - mi + 1;
    fis(i, 1, n) if(a[i] < 1 || a[i] > n){
        cout << -1 << ed; return 0;
    }
    fis(i, 1, n) cout << a[i] << " ";
    return 0;
}

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