# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
883403 | dejandenib | Parrots (IOI11_parrots) | C++17 | 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.
void encode(int n, int a[])
{
for(int i =0;i<n;i++)
{
int k;
k = 0;
int tosend = 0;
int x = i;
for (int j=0;j<5;j++)
{
if ((i & (1<<j))>0)
{
tosend+=1<<k;
}
k+=1;
}
tosend<<=3;
for (int j=0;j<8;j++)
{
if ( (a[i] & (1<<j))>0)
{
send(tosend+j);
}
}
}
}
void decode(int n,int howmany2,int a[]){
int to_be_output[321];
for (int i =0;i<n;i++)
to_be_output[i]=0;
for(int i = 0;i<howmany2;i++)
{
int value = 0;
int k = 0;
for (int j = 0;j<3;j++)
{
if (a[i] %2==1)
value+=1<<k;
k+=1;
a[i]=a[i]/2;
}
value = 1<<value;
int position=0;
k = 0;
for (int j = 0;j<5;j++)
{
if (a[i] %2==1)
position+=1<<k;
k+=1;
a[i]=a[i]/2;
}
to_be_output[position]+=value;
}
for(int i =0;i<n;i++)
output(to_be_output[i]);
}