# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
285458 | arnold518 | Labels (NOI20_labels) | C++14 | 107 ms | 6824 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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 3e5;
int N;
ll A[MAXN+10];
int main()
{
scanf("%d", &N);
for(int i=2; i<=N; i++) scanf("%lld", &A[i]), A[i]+=A[i-1];
ll p=0, q=0;
for(int i=1; i<=N; i++) q=max(q, A[i]), p=min(p, A[i]);
if(q-p+1!=N) return !printf("-1\n");
for(int i=1; i<=N; i++) printf("%lld ", A[i]-p+1);
}
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... |