# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
426326 | TLP39 | Labels (NOI20_labels) | C++14 | 98 ms | 5664 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 <stdio.h>
#include <math.h>
#include <utility>
#include <string.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;
typedef long long int ll;
int main()
{
int n;
scanf("%d",&n);
vector<int> ans;
int a=0,ma=0,mi=0,d;
ans.push_back(a);
for(int i=1;i<n;i++)
{
scanf("%d",&d);
a+=d;
ma=max(ma,a);
mi=min(mi,a);
ans.push_back(a);
}
if(ma-mi !=n-1)
{
printf("-1");
return 0;
}
for(int i=0;i<n;i++)
{
printf("%d ",ans[i]-mi+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... |