#include "encoder.h"
#include "encoderlib.h"
void encode(int N, int M[])
{
if (N<=32)
{
for (int i=0; i<N; i++)
for (int j=0; j<8; j++)
if (M[i]&(1<<j))
send((j<<5)+i);
}
else
{
for (int i=0; i<N; i++)
for (int j=0; j<4; j++)
for (int k=0; k<((M[i]>>2*j)&3); k++)
send((j<<6)+i);
}
}
#include "decoder.h"
#include "decoderlib.h"
void decode(int N, int L, int X[])
{
int M[N]={};
if (N<=32)
for (int i=0; i<L; i++)
M[X[i]&((1<<5)-1)]+=(1<<(X[i]>>5));
else
for (int i=0; i<L; i++)
M[X[i]&((1<<6)-1)]+=(1<<(2*(X[i]>>6)));
for (int i:M)
output(i);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
776 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1312 KB |
Output is correct |
2 |
Correct |
1 ms |
1300 KB |
Output is correct |
3 |
Correct |
1 ms |
1316 KB |
Output is correct |
4 |
Correct |
1 ms |
1312 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1308 KB |
Output is correct |
2 |
Correct |
1 ms |
1316 KB |
Output is correct |
3 |
Correct |
1 ms |
1320 KB |
Output is correct |
4 |
Correct |
1 ms |
1320 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1308 KB |
Output is correct |
2 |
Correct |
2 ms |
1324 KB |
Output is correct |
3 |
Correct |
1 ms |
1320 KB |
Output is correct |
4 |
Correct |
3 ms |
1168 KB |
Output is correct |
5 |
Correct |
3 ms |
1332 KB |
Output is correct |
6 |
Correct |
3 ms |
1344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
1 ms |
1320 KB |
partially correct P=8.000000 |
2 |
Partially correct |
3 ms |
1436 KB |
partially correct P=8.000000 |
3 |
Partially correct |
3 ms |
1344 KB |
partially correct P=12.000000 |
4 |
Partially correct |
5 ms |
1624 KB |
partially correct P=12.000000 |
5 |
Partially correct |
6 ms |
1404 KB |
partially correct P=12.000000 |
6 |
Partially correct |
7 ms |
1396 KB |
partially correct P=12.000000 |
7 |
Partially correct |
6 ms |
1388 KB |
partially correct P=12.000000 |