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 * 8 + j);
}
}
}
#include "decoder.h"
#include <bits/stdc++.h>
using namespace std;
#include "decoderlib.h"
void decode(int N, int L, int X[]) {
vector<int> ans(N * 8, 0);
for (int i = 0; i < L; i++) {
ans[X[i]] = 1;
}
for (int i = 0; i < N; i++) {
int num = 0;
for (int j = i * 8 + 7; j >= i * 8; j--) {
num = num * 2 + ans[j];
}
output(num);
}
}
# | 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... |