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] >> j) & 1) send((i << 3) + j);
}
#include "decoder.h"
#include <bits/stdc++.h>
#include "decoderlib.h"
bool mark[1000];
void decode(int N, int L, int X[]) {
memset(mark, 0, sizeof(mark));
for (int i = 0; i < L; i++) mark[X[i]] = true;
for (int i = 0; i < N; i++) {
int res = 0;
for (int j = 0; j < 8; j++)
if (mark[(i << 3) + j]) res += (1 << j);
output(res);
}
}
# | 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... |