# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31742 | Diuven | 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"
#include "encoderlib.h"
void encode(int N, int M[]){
if(N<=32){
for(int i=0; i<N; i++){
for(int j=0; j<8; j++)
if(M[i]&(1<<j))
send((i<<3)+j);
}
}
else{
for(int i=0; i<N; i++){
for(int j=0; j<8; j++)
}
}
}
}
#include "decoder.h"
#include "decoderlib.h"
void decode(int N, int L, int X[]){
int ans[64]={};
if(N<=32){
for(int i=0; i<L; i++)
ans[X[i]>>3]|=1<<(X[i]%(1<<3));
for(int i=0; i<N; i++)
output(ans[i]);
return;
}
else{
for(int i=0; i<L; i++){
}
}
}