# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
724926 | Son | Labels (NOI20_labels) | C++14 | 76 ms | 9036 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back
#define mp make_pair
int N;
LL D[300005];
LL A[300005];
int main(){
scanf("%d",&N);
A[1] = 0;
for ( int i = 1; i < N; i++ ){
scanf("%lld",&D[i]);
A[i+1] = A[i] + D[i];
}
LL mx = -1e18, mn = 1e18;
for ( int i = 1; i <= N; i++ ){
if ( A[i] > mx ) mx = A[i];
if ( A[i] < mn ) mn = A[i];
}
if ( mx - mn != N - 1 ){
printf("-1\n");
} else {
printf("%lld",1 - mn);
for ( int i = 2; i <= N; i++ ){
printf(" %lld",1 + A[i] - mn);
}
printf("\n");
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |