# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
226278 | Coroian_David | Parrots (IOI11_parrots) | C++11 | 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 M[])
{
int k = 0;
int a[700];
for(int i = 0; i < N; i ++)
{
for(int j = 7; j >= 0; j --)
a[++ k] = (((1 << j) & M[i]) != 0);
}
int cr = 0;
for(int i = 1; i <= k; i += 2)
{
int nr = (a[i] << 1) + a[i + 1];
for(int j = 1; j <= nr; j ++)
send(cr);
cr ++;
}
}
void decode(int N, int L, int X[])
{
int ap[600];
for(int i = 0; i <= 255; i ++)
ap[i] = 0;
for(int i = 0; i < L; i ++)
ap[X[i]] ++;
int cr = 0;
for(int i = 0; i < N; i ++)
{
// cout << " SNUTEM " << cr << " " << ap[cr] << " " << ap[cr + 1] << " " << ap[cr + 2] << " " << ap[cr + 3] << "\n";
int nr = (ap[cr] << 6) + (ap[cr + 1] << 4) + (ap[cr + 2] << 2) + ap[cr + 3];
output(nr);
cr += 4;
}
}