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"
#include <bits/stdc++.h>
using namespace std;
void encode(int N, int M[])
{
int mask = 0;
for (int i = 0; i < N; i++)
{
for (int j = 0; j < 8; j++)
{
if (M[i] & (1 << j))
{
send(mask);
}
mask++;
}
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
void decode(int N, int L, int X[])
{
vector<int> vec;
for (int i = 0; i < L; i++)
{
vec.push_back(X[i]);
}
sort(vec.begin(), vec.end(), greater<int>());
int mask = 8;
for (int i = 0; i < N; i++)
{
int sum = 0;
while (vec.size() && vec.back() < mask)
{
sum += (1 << vec.back() % 8);
vec.pop_back();
}
output(sum);
mask += 8;
}
}
# | 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... |