# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
961983 | shoryu386 | Parrots (IOI11_parrots) | C++17 | 0 ms | 0 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[]){
bool bs[N*8];
memset(bs, 0, sizeof(bs));
for (int x = 0; x < N; x++){
for (int z = 0; z < 8; z++){
bs[x*8 + z] = ((M[x] & (1<<z)) != 0);
}
}
for (int x = 0; x < N; x++){
for (int z = 0; z < 8; z++){
if (bs[x*8+z]) send(x*8+z);
}
}
}
#include "decoder.h"
#include "decoderlib.h"
void decode(int N, int L, int X[]){
bool bs[N*8];
memset(bs, 0, sizeof(bs));
for (int x = 0; x < L; x++){
bs[X[x]] = 1;
}
int res[N]; memset(res, 0, sizeof(res));
for (int x = 0; x < N; x++){
for (int z = 0; z < 8; z++){
res[x] += bs[z] * (1<<z);
}
}
for (int x = 0; x < N; x++){
output(res[x]);
}
}