| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 743764 | boyliguanhan | Parrots (IOI11_parrots) | C++17 | 3 ms | 1068 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++)
for(int j = 0; j < 8; j++)
if(M[i]&1<<j)
send((i<<3)+j);
}#include "decoder.h"
#include "decoderlib.h"
void decode(int N, int L, int X[]) {
int res[N]{};
for(int i = 0; i < L; i++)
res[X[i]>>3] += 1 << (X[i]&7);
for(auto i: res) output(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... | ||||
