| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1317464 | neonglitch | Permutation Recovery (info1cup17_permutation) | C++20 | 1 ms | 332 KiB |
#include <iostream>
#include <vector>
using namespace std;
#define int long long
main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
int q[n+1]={0};
int ans[n+1]={0};
int val[n+1]={0};
for(int i=1;i<=n;i++)cin>>q[i];
for(int j=n;j>=1;j--)
{
int mx=0;
int sm=0,st=0;
for(int i=1;i<=n;i++)
{
if(!val[i])
{
if((q[i-1]*2+1 - sm )==q[i])
{
mx=i;
st=sm;
}
}
else{
sm+=val[i];
}
}
val[mx]=q[mx]-q[mx-1];
ans[mx]=j;
}
for(int i=1;i<=n;i++)cout<<ans[i]<<' ';
cout<<endl;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
