| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 795952 | hgmhc | Parrots (IOI11_parrots) | C++17 | 1 ms | 736 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"
void encode(int N, int M[])
{
for (int i=0; i<N; i++)
send((1<<i)|(M[i]<<15));
}#include "decoder.h"
#include "decoderlib.h"
static int ans[8];
void decode(int N, int L, int X[])
{
int i, b;
for(i=0; i<L; i++) {
b = X[i];
for (int j = 0; j < N; ++j) if (b>>j&1) {
ans[j] = b>>15&1;
}
}
for (int i = 0; i < 8; ++i)
output(ans[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... | ||||
