제출 #67227

#제출 시각아이디문제언어결과실행 시간메모리
67227RezwanArefin01앵무새 (IOI11_parrots)C++17
52 / 100
10 ms2480 KiB
#include "encoder.h"
#include "encoderlib.h"

void encode(int N, int M[]) {
    for(int i = 0; i < 8 * N; i++) {
        send((i * 2) | ((M[i / 8] >> (7 - i % 8)) & 1)); 
    }
}
#include "decoder.h"
#include "decoderlib.h"

void decode(int N, int L, int X[]) {
    int a[N * 8];
    for(int i = 0; i < L; i++) 
        a[X[i] >> 1] = X[i] & 1; 
    for(int i = 0; i < N; i++) {
        int num = 0; 
        for(int j = i * 8; j < (i + 1) * 8; j++) 
            num = num * 2 + a[j];
        output(num);
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...