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