#include <bits/stdc++.h>
#include <vector>
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N; cin >> N;
int arr[N-1];
for (int i = 1; i < N; i++) {cin >> arr[i-1];}
bool solved = false;
int ans[N];
for (int i = 0; i < N; i++) {ans[i] = 0;}
int index = 0;
ans[index] = 2;
while (ans[index] <= N) {
index++;
if (index == N) {cout << -1; return 0;}
ans[index] = arr[index-1] + ans[index-1];
}
if (not solved) {
int ans[N];
for (int i = 0; i < N; i++) {ans[i] = 0;}
int index = 0;
ans[index] = 1;
while (ans[index] <= N) {
index++;
if (index == N) {for (int i = 0; i < N; i++) {cout << ans[i] << " ";}; return 0;}
ans[index] = arr[index-1] + ans[index-1];
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
1 ms |
312 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
1 ms |
312 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
1 ms |
312 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
39 ms |
9916 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Incorrect |
27 ms |
5816 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
1 ms |
312 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |