제출 #837159

#제출 시각아이디문제언어결과실행 시간메모리
83715912345678Labels (NOI20_labels)C++17
100 / 100
49 ms9040 KiB
#include <bits/stdc++.h> using namespace std; const int nx=3e5+5; long long n, d[nx], dp[nx], mn, mx, ans[nx]; int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>n; for (int i=2; i<=n; i++) cin>>d[i], dp[i]=dp[i-1]+d[i], mn=min(mn, dp[i]), mx=max(mx, dp[i]); if (mx-mn<n-1) { cout<<-1; return 0; } for (int i=1; i<=n; i++) cout<<dp[i]-mn+1<<' '; }
#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...