# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
586508 | krit3379 | Labels (NOI20_labels) | C++17 | 45 ms | 6948 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;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define N 300005
long long a[N],d[N],mi,ma;
int main(){
int n,i;
scanf("%d",&n);
for(i=2;i<=n;i++)scanf("%lld",&d[i]);
for(i=2;i<=n;i++)a[i]=a[i-1]+d[i],mi=min(mi,a[i]);
for(i=1;i<=n;i++){
a[i]+=mi+1;
ma=max(a[i],ma);
}
if(ma==n)for(i=1;i<=n;i++)printf("%lld ",a[i]);
else printf("-1");
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... |