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++) {
int bit = (M[i] & (1 << j)) ? 1 : 0;
send(i * 16 + j * 2 + bit);
}
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
void decode(int N, int L, int X[])
{
vector<int> v(N, 0);
for (int i = 0; i < L; i++) {
int val = (X[i] % 2);
int bit = (X[i] % 16) / 2;
int pos = (X[i] / 16);
v[pos] += (val << bit);
}
for (int i = 0; i < N; i++) {
output(v[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... |