제출 #1249280

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1249280		Geforgs	Labels (NOI20_labels)	C++20	25 / 100	24 ms	6984 KiB

Labels

#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
#define ll long long
#define ld long double
#define inf (ll)(2*1e18)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define pb push_back
#define endl "\n"
using namespace std;

void solve(){
    ll n, i, m;
    cin>>n;
    vector<ll> a(n);
    vector<ll> d(n-1);
    for(i=0;i<n-1;++i){
        cin>>d[i];
    }
    a[0] = 1;
    m = 1;
    for(i=0;i<n-1;++i){
        a[i+1] = a[i] + d[i];
        m = max(a[i+1], m);
        if(a[i+1] < 1){
            m = -1;
            break;
        }
    }
    if(m == n){
        for(auto el: a){
            cout<<el<<' ';
        }
        cout<<endl;
        return;
    }
    a[0] = n;
    m = n;
    for(i=0;i<n-1;++i){
        a[i+1] = a[i] + d[i];
        m = min(a[i+1], m);
        if(a[i+1] > n){
            m = n+1;
            break;
        }
    }
    if(m == 1){
        for(auto el: a){
            cout<<el<<' ';
        }
        cout<<endl;
        return;
    }
    cout<<-1<<endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    srand(time(nullptr));
    ll t=1;
//    cin>>t;
    for(;t>0;--t){
        solve();
    }
    return 0;
}

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