# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
483995 | T0p_ | Labels (NOI20_labels) | C++14 | 70 ms | 5476 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;
const int N = 3e5+5;
int d[N];
int main()
{
int n;
scanf(" %d",&n);
int mn = 1e9, mx = -1e9;
for(int i=2 ; i<=n ; i++)
{
scanf(" %lld",&d[i]);
d[i] += d[i-1];
mn = min(mn, d[i]);
mx = max(mx, d[i]);
}
int cnt = 0;
for(int a1=1 ; a1<=n ; a1++) if(1 <= a1+mn && a1+mn <= n && 1 <= a1+mx && a1+mx <= n) cnt++;
if(cnt != 1) printf("-1\n");
else
{
for(int a1=1 ; a1<=n ; a1++) if(1 <= a1+mn && a1+mn <= n && 1 <= a1+mx && a1+mx <= n)
{
printf("%d ",a1);
for(int i=2 ; i<=n ; i++) printf("%d ",a1+d[i]);
return 0;
}
}
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... |