Submission #680113

#TimeUsernameProblemLanguageResultExecution timeMemory
680113stevancvLabels (NOI20_labels)C++14
100 / 100
68 ms9012 KiB
#include <bits/stdc++.h> #define ll long long #define ld long double #define sp ' ' #define en '\n' #define smin(a, b) a = min(a, b) #define smax(a, b) a = max(a, b) #define sadd(a, b) a = Add(a, b) #define smul(a, b) a = Mul(a, b) using namespace std; const int N = 1e3 + 2; const int mod = 1e9 + 7; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; vector<ll> a(n - 1); for (int i = 0; i < n - 1; i++) { cin >> a[i]; if (i > 0) a[i] += a[i - 1]; } ll mn = *min_element(a.begin(), a.end()); ll mx = *max_element(a.begin(), a.end()); ll y = 1 - mn; ll x = n - mx; smin(x, (ll)n); smax(x, 1ll); smin(y, (ll)n); smax(y, 1ll); if (x != y) { cout << -1 << en; return 0; } vector<ll> ans(n); ans[0] = x; for (int i = 0; i < n - 1; i++) { ans[i + 1] = ans[0] + a[i]; } for (int i = 0; i < n; i++) cout << ans[i] << sp; cout << en; return 0; }
#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...