# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
284852 | Ronin13 | Labels (NOI20_labels) | C++14 | 28 ms | 4224 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>
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ull unsigned ll
#define pb push_back
#define mp make_pair
using namespace std;
int d[100001];
int n;
int a[100001];
int cnt=0;
vector<vector<int> >ans;
void rec(int ind,int val,vector<int>k){
if(ind==n){
k.pb(val);
ans.pb(k);
cnt++;
return;
}
k.pb(val);
for(int i=1;i<=n;i++){
if(i-val==d[ind])rec(ind+1,i,k);
}
}
int main(){
cin>>n;
for(int i=1;i<n;i++)cin>>d[i];
for(int i=1;i<=n;i++){
vector<int>k;
k.pb(i);
for(int j=2;j<=n;j++){
k.pb(k[(int)k.size()-1]+d[j-1]);
}
bool ind=true;
for(int j=0;j<k.size();j++){
if(k[j]<=0||k[j]>n){
ind=false;
break;
}
}
if(ind)ans.pb(k);
}
if(ans.size()!=1){
cout<<-1;
return 0;
}
for(int i=0;i<ans[0].size();i++)cout<<ans[0][i]<<' ';
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... |