Submission #1181717

#	Time	Username	Problem	Language	Result	Execution time	Memory
1181717		kaanpasaa	Labels (NOI20_labels)	C++20	100 / 100	69 ms	4680 KiB

Labels

#include<bits/stdc++.h> 
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<bitset>
#define int long long
#define spc <<" "<<
#define vi vector<int>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>
#define dfab int a,b;cin>>a>>b;
#define dfa int a;cin>>a;
#define ff first 
#define ss second
#define pb push_back
#define dfoutput if(cvp){cout<<"YES\n";}else{cout<<"NO\n";}
#define dfnarr int n;cin>>n;int arr[n];for(int i=0;i<n;i++){cin>>arr[i];}
#define mod 1000000007
#define mod2 998244353
#define inf 1e18
#define N 1e5+10
#define C 1e9+10
#define all(x) x.begin(),x.end()
using namespace std;
void solve() {
    int n;cin>>n;
    int arr[n-1];
    int b=0,l=0,c=0;
    for(int i=0;i<n-1;i++){
        cin>>arr[i];
        c+=arr[i];
        b=max(b,c);
        l=min(l,c);
    }
    if(b-l==n-1){
        c=abs(l)+1;
        cout<<c<<" ";
        for(int i=0;i<n-1;i++){
            c+=arr[i];
            cout<<c<<" ";
        }
        return;
    }
    cout<<-1;
}
signed main(){ 
    int t=1;
    //cin>>t;
    while(t--){ 
        solve();
    }
}

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