제출 #869120

#제출 시각아이디문제언어결과실행 시간메모리
869120tvladm2009Labels (NOI20_labels)C++17
0 / 100
30 ms7016 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = (int) 3e5 + 7; ll n, a[N], pre[N]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); // freopen("input", "r", stdin); cin >> n; for (int i = 1; i < n; i++) { cin >> a[i]; } ll mx = a[1], mn = a[1]; for (int i = 1; i < n; i++) { pre[i] = pre[i - 1] + a[i]; mx = max(mx, pre[i]); mn = min(mn, pre[i]); } ll low = (mn <= 0 ? mn + 1 : 1), high = n - mx; if (low == high) { cout << low << " "; for (int i = 1; i < n; i++) { low += a[i]; cout << low << " "; } cout << "\n"; return 0; } cout << "-1\n"; 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...