Submission #1182174

#TimeUsernameProblemLanguageResultExecution timeMemory
1182174mecukuryurtLabels (NOI20_labels)C++20
0 / 100
41 ms4676 KiB
#include <iostream> #define lli long long int using namespace std; int main() { int n; cin >> n; lli arr[n]; arr[0] = 0; lli val=0, valmax=-n-1, valmin=0, input; for (int i=1; i<n;i++) { cin >> input; val += input; arr[i] = val; if (val > valmax) valmax=val; if (val < valmin) valmin=val; } if ((valmax-valmin+1) == n) { lli offset = 1-valmin; for (int i=0; i<n; i++) cout << arr[i] + offset << " "; } else { cout << -1; } 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...