# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
99967 | tinjyu | Mechanical Doll (IOI18_doll) | C++14 | 0 ms | 0 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 <iostream>
using namespace std;
int m,n,a[400005],l[450000],r[450000],num[25],d[250000];
int main(){
cin>>m>>n;
for(int i=1;i<=n;i++)cin>>a[i];
int t=1,p=0;
while(t<n)
{
t*=2;
p++;
}
num[1]=-1;
for(int i=1;i<=t/2;i++)
{
num[1]++;
for(int j=1;j<=p;j++)
{
if(num[j]==2)
{
num[j]=0;
num[j+1]++;
}
else break;
}
int q=1;
for(int j=p;j>=1;j--)
{
d[i]+=q*num[j];
q*=2;
}
//cout<<d[i]<<endl;
}
for(int i=1;i<=t-1;i++)
{
l[i]=(i*2)*-1;
r[i]=(i*2+1)*-1;
if((l[i])*-1>t-1)l[i]=0;
if((r[i])*-1>t-1)r[i]=0;
}
//for(int i=1;i<=t-1;i++)cout<<l[i]<<" ";
//cout<<endl;
//for(int i=1;i<=t-1;i++)cout<<r[i]<<" ";
//cout<<endl;
for(int i=1;i<n;i++)
{
if(d[i]%2==1)r[(t+d[i])/2]=a[i];
else l[(t+d[i])/2]=a[i];
//cout<<d[i]%2<<" "<<(t+d[i])/2<<endl;
}
r[t-1]=a[n];
//for(int i=t/2;i<=t-1;i++)cout<<l[i]<<" "<<r[i]<<" ";
cout<<"-1 ";
for(int i=2;i<=n;i++)cout<<"0 ";
cout<<endl;
for(int i=1;i<=t-1;i++)cout<<l[i]<<" ";
cout<<endl;
for(int i=1;i<=t-1;i++)cout<<r[i]<<" ";
}