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]%2==1){
send((i<<4)+(j<<1)+1);
}
M[i]/=2;
}
}
}
#include "decoder.h"
#include "decoderlib.h"
void decode(int N, int L, int X[]) {
int res[N]{};
for(int i=0; i < L; i++) {
int p=(X[i]>>4),v=(1<<((X[i]%16)>>1));
res[p] += v;
}
for (int i=0;i<N;i++) {
output(res[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... |