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 encode(int N, int M[])
{
int i;
int ptr = 0;
for(i=0; i<N; i++){
for(int j = 0; j < 8; j++) {
if(0 < (M[i] & (1 << j)))
send(ptr);
ptr++;
}
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <map>
std::map<int,int> code;
void decode(int N, int L, int X[])
{
code.clear();
for(int i = 0; i < L; i++)
code[X[i]] = 1;
int ptr = 0;
for(int i = 0; i < N; i++){
int number = 0;
for(int j = 0; j < 8; j++){
if(code[ptr])
number |= (1 << j);
ptr++;
}
output(number);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |