# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1091930 | BarbarBrick | Parrots (IOI11_parrots) | C++14 | 3 ms | 1336 KiB |
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[])
{
for (int i = 0; i < 8 * N; i++)
{
int message = (i << 1) + !!(M[i / 8] & (1 << (i % 8)));
send(message);
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
void decode(int N, int L, int X[])
{
vector<int> vec;
int mask = (1 << 8) - 1;
for (int i = 0; i < L; i++)
{
int b = X[i];
vec.push_back(b);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < N; i++)
{
int sum = 0;
for (int j = 0; j < 8; j++)
{
sum += (vec[i * 8 + j] & 1) << j;
}
output(sum);
}
}
Compilation message (stderr)
# | 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... |