| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 223974 | peuch | Parrots (IOI11_parrots) | C++17 | 12 ms | 1536 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++){
int aux = i * 8;
for(int j = 0; j < 8; j++){
if(M[i] & (1<<j))
send(aux + j);
}
}
}
#include "decoder.h"
#include "decoderlib.h"
void decode(int N, int L, int X[])
{
int ans[N];
for(int i = 0; i < N; i++) ans[i] = 0;
for(int i = 0; i < L; i++) {
ans[X[i] / 8] |= (1 << (X[i] % 8));
}
for(int i = 0; i < N; 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... | ||||
