제출 #1199848

#제출 시각아이디문제언어결과실행 시간메모리
1199848raphaelp앵무새 (IOI11_parrots)C++20
17 / 100
1 ms840 KiB
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;

void encode(int N, int M[])
{
    vector<int> Tab;
    for (int i = 0; i < N; i++)
    {
        for (int j = 7; j >= 0; j--)
            Tab.push_back(M[i] & (1 << j));
    }
    for (int i = 0; i < Tab.size(); i++)
    {
        send((i << 1) + Tab[i]);
    }
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;

void decode(int N, int L, int X[])
{
    vector<int> Tab;
    for (int i = 0; i < L; i++)
        Tab.push_back(X[i]);
    sort(Tab.begin(), Tab.end());
    for (int i = 0; i < N; i++)
    {
        int x = 0;
        for (int j = 0; j < 8; j++)
        {
            x *= 2;
            x += Tab[i * 8 + j] % 2;
        }
        output(x);
    }
}
#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...