# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
231063 | 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.
#include "encoder.h"
#include "encoderlib.h"
void aduna(int a[], int b[])
{
cout << " ADUN " << a[0] << " " << b[0] << "\n";
cout << a[1] << " " << b[1] << " " << a[2] << " " << b[2] << "\n";
int i = 1;
int t = 0;
for(i = 1; i <= max(a[0], b[0]) || t; i ++)
{
// cout << " SUTNEM " << i << "\n";
a[i] += b[i] + t;
t = 0;
if(a[i] > 9)
{
t = a[i] / 10;
a[i] %= 10;
}
}
cout << a[0] << " " << i-1 << "\n";
a[0] = i - 1;
}
bool cmp(int a[], int b[])
{
if(a[0] > b[0])
return 1;
if(a[0] < b[0])
return 0;
for(int i = a[0]; i >= 1; i --)
{
if(a[i] != b[i])
return (a[i] > b[i]);
}
return 1;
}
struct nr
{
int v[200];
/*
nr operator + (nr &x)
{
aduna(v, x.v);
return *v;
}*/
void operator +=(nr &x)
{
aduna (v, x.v);
}
bool operator > (nr &x)
{
return cmp(v, x.v);
}
/*
operator [] (nr & x)
{
return *x;
}*/
/*
nr operator = (nr &x)
{
//*v** = *(x.v);
return x;
}*/
};
nr a, b;
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 ++;
}
}
#include "decoder.h"
#include "decoderlib.h"
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 ++)
{
int nr = (ap[cr] << 6) + (ap[cr + 1] << 4) + (ap[cr + 2] << 2) + ap[cr + 3];
output(nr);
cr += 4;
}
}