Submission #337605

#TimeUsernameProblemLanguageResultExecution timeMemory
337605ncduy0303Labels (NOI20_labels)C++17
100 / 100
72 ms5740 KiB
#include <bits/stdc++.h> using namespace std; #define ar array #define ll long long const int MAX_N = 1e5 + 1; const ll MOD = 1e9 + 7; const ll INF = 1e9; void solve() { int n; cin >> n; vector<int> d(n - 1); ll sum = 0, mn = 0, mx = 0; for (int i = 0; i < n; i++) { cin >> d[i]; sum += d[i]; mx = max(mx, sum); mn = min(mn, sum); } if (mx - mn != n - 1) { cout << -1 << "\n"; return; } // a1 + mn = 1 int a1 = 1 - mn; cout << a1 << " "; for (int i = 0; i < n - 1; i++) { a1 += d[i]; cout << a1 << " "; } cout << "\n"; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int tc = 1; // cin >> tc; for (int t = 1; t <= tc; t++) { // cout << "Case #" << t << ": "; solve(); } }
#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...