# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
335596 | Joshc | Parrots (IOI11_parrots) | C++11 | 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"
void decode(int N, int L, int X[]) {
int ans[66] = {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]);
}
#include "decoder.h"
void decode(int N, int L, int X[]) {
int ans[66] = {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]);
}