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[]){
for (int i = 0; i < N; i++)
send((i << 8) + M[i]);
}
#include "decoder.h"
#include "decoderlib.h"
void decode(int N, int L, int X[]){
int ans[16];
for (int i = 0; i < L; i++)
ans[X[i] >> 8] = X[i] & ((1 << 8) - 1);
for (int i = 0; i < N; i++)
output(ans[i]);
}
# | 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... |