제출 #705330

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

void encode(int N, int M[])
{
    int cnt = 0;
    for(int i = 0; i < N; ++i) {
        for(int t = 6; t >= 0; t -= 2) {
            send((cnt << 2) | ((M[i] >> t) & 3));
            ++cnt;
        }
    }
}
#include "decoder.h"
#include "decoderlib.h"

#include <algorithm>

void decode(int N, int L, int X[])
{
    std::sort(X, X + L);
    for(int i = 0; i < L; i += 4) {
        int M = 0;
        for(int j = i; j < i + 4; ++j) {
            M = (M << 2) | (X[j] & 3);
        }
        output(M);
    }
}
#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...