#include "encoder.h"
#include "encoderlib.h"
void encode(int N, int M[])
{
if (N <= 16)
{
int sz = 0, v[200];
for (int i=0; i<N; i++)
for (int j=0; j<8; j++)
v[sz ++] = (M[i] >> j) & 1;
for (int i=0; 2 * i < sz; i++)
{
int msk = (i << 2) | (v[2 * i] << 1) | v[2 * i + 1];
send (msk);
}
}
}
#include "decoder.h"
#include "decoderlib.h"
void decode(int N, int L, int X[])
{
if (N <= 16)
{
int v[200];
for (int i=0; i<L; i++)
{
int pos = X[i] >> 2;
v[2 * pos + 1] = X[i] & 1;
v[2 * pos] = (X[i] >> 1) & 1;
}
for (int j=0; j<2 * L; j+=8)
{
int msk = 0;
for (int k=j; k<j + 8; k++)
if (v[k])
msk |= 1 << (k - j);
output (msk);
}
return ;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
780 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
1608 KB |
Output is correct |
2 |
Correct |
6 ms |
1608 KB |
Output is correct |
3 |
Correct |
7 ms |
1896 KB |
Output is correct |
4 |
Correct |
8 ms |
2192 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
2192 KB |
Output is correct |
2 |
Correct |
5 ms |
2192 KB |
Output is correct |
3 |
Correct |
5 ms |
2192 KB |
Output is correct |
4 |
Correct |
7 ms |
2192 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
2224 KB |
Output is correct |
2 |
Correct |
5 ms |
2224 KB |
Output is correct |
3 |
Incorrect |
5 ms |
2224 KB |
Error : Output length must be N |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
2296 KB |
Output is correct - P = 4.000000 |
2 |
Incorrect |
4 ms |
2296 KB |
Error : Output length must be N |
3 |
Incorrect |
5 ms |
2296 KB |
Error : Output length must be N |
4 |
Incorrect |
5 ms |
2296 KB |
Error : Output length must be N |
5 |
Incorrect |
6 ms |
2296 KB |
Error : Output length must be N |
6 |
Incorrect |
6 ms |
2296 KB |
Error : Output length must be N |
7 |
Incorrect |
6 ms |
2296 KB |
Error : Output length must be N |