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 <bits/stdc++.h>
#include "encoder.h"
#include "encoderlib.h"
using namespace std;
void encode(int N, int M[])
{
int R = 0;
for (int i = 0; i < N; i++)
{
for (int count = 0; count < 4; count++)
{
R = (i << 4) + (count << 2);
for (int k = 2*count; k <= 2*(count + 1); k++)
{
R += ((M[i] & (1 << k)) >> (2*count));
}
send(R);
}
}
}
#include <bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"
using namespace std;
void decode(int N, int L, int X[])
{
sort(X, X+L);
for (int i = 0; i < L; i += 4)
{
int B = 0;
for (int k = 0; k < 4; k++)
{
B += ((X[i + k] & 3) << (2*k));
}
//cerr << B << '\n';
output(B);
}
}
# | 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... |