# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
939657 |
2024-03-06T16:11:48 Z |
Litusiano |
Labels (NOI20_labels) |
C++17 |
|
53 ms |
3412 KB |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin>>n;
int mn = INT_MAX; int mx = INT_MIN;
int cur = 0;
vector<int> v(n-1);
for(int i = 1; i<n; i++){
int x; cin>>x;
v[i-1] = x;
cur+=x;
mn = min(mn,cur); mx = max(mx,cur);
}
int l = max(1,1-mn); int r = n-mx;
if(l > r || r != l || r > n) cout<<-1<<endl;
else{
cout<<l<<" ";
for(int i : v){
l+=i; cout<<l<<" ";
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
53 ms |
3412 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Incorrect |
39 ms |
1588 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |