제출 #764252

#제출 시각아이디문제언어결과실행 시간메모리
764252boris_mihov앵무새 (IOI11_parrots)C++17
0 / 100
2 ms1068 KiB
#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] & (1 << j))
            {
                send(8*i + j);
            }
        }
    }
}
#include "decoder.h"
#include "decoderlib.h"

const int MAXN = 64 + 6;
int ans[MAXN];

void decode(int N, int L, int X[])
{
    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]);
    }
}
#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...